The one hundred thirty-three papers in this collection include the following: M.\ J. D. Powell, Interior point methods for semi-infinite programming calculations (3--5); B.\ D.\ Craven, Matrix shadow costs for multilinear programs (6--10); R.\ E.\ Mahony\ and J.\ B.\ Moore [John\ Barratt\ Moore], Recursive interior-point linear programming algorithm based on Lie-Brockett flows (21--29); I.\ M.\ Navon, X.\ Zou, M.\ Berger, Paul\ K. H. Phua, T.\ Schlick\ and F.-X.\ Le Dimet, Numerical experience with limited-memory quasi-Newton and truncated Newton methods (33--48); Emilio\ Spedicato, Deriving quasi-Newton updates via the ABS approach (49--51); Paul\ Kang Hoh Phua\ and Steven\ Boon-Wei\ Chew, Symmetric rank-one update and quasi-Newton methods (52--63); Yong\ Tian, A gradient projection variable metric method for solving the nonlinear programming (64--71); Rio\ Hirowati\ Shariffudin\ and Ithnin\ Abdul Jalil, Formulae-variable for conjugate gradient strategies (72--79); N.\ L.\ Boland, A dual-active-set algorithm for positive semi-definite quadratic programming (80--89); Xing\ Si\ Li, A smoothing technique for nonsmooth optimization problems (90--97). \par Rabindra\ Nath\ Sen [Rabindranath\ Sen]\ and Jharnadan, On a class of complex nonlinear programming problems (98--103); Ali\ bin Abdul Rahman, On the numerical solution of generalised polynomial equations using an optimisation-based algorithm (104--113); Choon\ Peng\ Tan\ and Kee\ Mein\ Gooi, Minimization of the scaled tau-infinity coefficient over a convex cone in the positive orthant (114--123); Choon\ Peng\ Tan, On the extreme points of the intersection of the unit ball of the trimmed $l_1$ norm with a hyperplane (124--131); Sudarsan\ Nanda, Generalized convexity in mathematical programming (132--140); Marida\ Bertocchi [Maria\ Bertocchi]\ and Claudio\ Di Odoardo, A stochastic algorithm for global optimization based on threshold accepting technique (141--146); Chung\ Ping\ Wan, A class of algorithm of feasible direction by using curvilinear fitting for nonlinear constrained optimization (147--153); Yun\ Kang\ Sui, Xin\ Chuan\ Qin\ and Xi\ Cheng\ Wang, Curved-line search using ordinary differential equations (154--158); Yun\ Fang, Ji\ Zhou, Jianhua\ Wang [Jian\ Hua Wang\asup 4], Jian\ Zhong\ Cha\ and Zuo\ Dai, The discrete recursive quadratic programming with artificial intelligence strategy (159--166); S.\ Wawan, Y.\ K.\ Huen, G.\ P.\ Rangaiah\ and S.\ L.\ Sim, Graphical optimization using HGRAM graphical format (167--176). \par Ellis\ L.\ Johnson\ and George\ L.\ Nemhauser, Recent developments in integer programming (179--186); Anthony\ Fu Wha Han\ and Ming\ Chorng\ Hwang, Location-search-based heuristic methods for set covering problems (187--196); H.-W.\ Leong\ and S.\ F.\ Lee, A new approach to game scheduling with preassignments (197--208); John\ Walker, A hybrid approach to the multiple-choice knapsack problem (209--218); Yu.\ G.\ Stoyan\ and S.\ V.\ Yakovlev, Original methods of optimization on combinatorial sets (219--228); En\ Yu\ Yao, Rong\ Heng\ Li\ and Yong\ He, New progress on optimal partitioning problems (229--234); Sin\ Hoon\ Hum\ and Thin\ Yin\ Leong, A weighted graph partitioning problem with side constraints (235--240); Chong\ John\ Lim\ and Graham\ B.\ McMahon, A decomposition process for the recognition of series-parallel subgraphs (241--247); Witold\ M.\ Paczkowski, Discrete optimization program based on the ortho-diagonal method (248--255); K.\ V.\ Ramani, Graphics software for teaching optimization algorithms (256--263). \par Mehryar\ Nooriafshar, Towards nonalgorithmic optimization: a practical and general purpose method of formulating and solving dynamic programming problems (264--272); Dinesh\ S.\ Dave, Kathy\ E.\ Fitzpatrick\ and A.\ Rao\ Korukonda, Implementing optimization methods in network crashing: an illustration (275--283); C.\ J.\ Goh, N.\ L.\ Boland\ and A.\ I.\ Mees, An algorithm for solving quadratic cost network flow optimization problems (284--293); Zhong\ Fu\ Zhang, Shou\ Huai\ Gu, Lin\ Zhong\ Liu, Si\ Hai\ Zhang\ and Lan\ Zhang, An algorithm of the shortest path for the network with negative arcs (294--296); N.\ R.\ Achuthan, L.\ Caccetta, P.\ Caccetta\ and J.\ F.\ Geelen, Algorithms for the minimum weight spanning tree with bounded diameter problem (297--304); Shou\ Yang\ Wang, An interactive method for multicriteria decision making (307--316); M.\ A.\ Quaddus\ and K.\ L.\ Poh, A comparative evaluation of multiple objective linear programming methods (317--328); M.\ A.\ Quaddus, An interactive approach to multiple objective transportation problems (329--336); Jiu\ Ping\ Xu, The optimal order method of double basic points of multiple attribute evaluation (337--342); Stefan\ Jendo\ and Witold\ M.\ Paczkowski, Multicriterion discrete optimization of large scale frame structures (343--351). \par Da\ Yong\ Chang\ and Li\ Li\ Zhang, Extent analysis and synthetic decision (352--359); Ji\ Chao\ Xu, Bin\ Nan\ and Yu\ Min\ Liu, All solutions of clustering for attributes (360--367); Y.\ D.\ Hu [Yu\ Da\ Hu], Major optimality and major efficiency in multicriteria optimization (368--374); N.\ R.\ Achuthan\ and T.\ Lotulelei, Project crashing with earliness and tardiness penalties: a goal programming model (375--384); K.\ L.\ Teo [Kok\ Lay\ Teo], A computational approach to an optimal control problem with a cost on changing control (397--413); Bean\ San\ Goh, Algorithms for unconstrained optimization: a new approach using control theory (414--422); Xun\ Yu\ Zhou\ and Suresh\ Sethi, A sufficient condition for near optimal stochastic controls and its application to an HMMS model under uncertainty (423--432); Kok\ Tin\ Tan\ and Elmer\ G.\ Gilbert, Multi-mode controllers for linear discrete-time systems with general state and control constraints (433--442); I.\ M.\ Navon, X.\ Zou, M.\ Berger, Paul\ K. H. Phua, T.\ Schlick\ and F.-X.\ Le Dimet, Testing the reliability and robustness of optimization codes for large-scale optimization problems (445--480); Paul\ Kang Hoh Phua\ and Rudy\ Setiono, Multi-step, multi-directional parallel algorithms for unconstrained optimization (481--488). \par Arabinda\ Tripathy, Modelling and analysis of large systems: some approaches (489--496); Y.\ L.\ Deshpande, Towards reducing computational demands in calculating lower bounds in permutation flow shop scheduling (527--537); Shaukat\ A.\ Brah, Complexity of the flow shop with multiple processors scheduling problem, and some dominance conditions (538--545); Hoong\ Chuin\ Lau, Preference-based scheduling via constraint satisfaction (546--554); A.\ R.\ Warburton, E.\ U.\ Choo\ and D.\ Pronovost, A parametric model for staff scheduling problems with flexible demand constraints (555--564); H.-W.\ Leong\ and T.\ S.\ Tia, New heuristic algorithms for precedence constrained scheduling (565--575); John\ R.\ Birge, Stochastic programming: optimizing the uncertain (613--632); P.\ E.\ Kloeden, E.\ Platen\ and H.\ Schurz, Effective simulation of optimal trajectories in stochastic control (633--644); K.\ H.\ Wong, N.\ Lock\ and K.\ Kaji, Output feedback for a class of linear-quadratic systems with jump stochastic parameters (645--652); E.\ N.\ Voyevudskiy [E.\ N.\ Voevudskiĭ], Stochastic optimisation of queueing system control (653--656). \par Yaacob\ Ibrahim, Reliability analysis of linear dynamic systems using optimization techniques (664--671); Guang\ Wu\ Zeng, The pattern transformation method---a new method in engineering optimum design (740--746); H.\ T.\ Loh, C.\ S.\ Teng\ and Y.\ S.\ Wong, An algorithm for linear interpolation of cubic Bézier curves (815--822); C.\ M.\ Wang\ and C.\ J.\ Goh, A unified approach to optimization of structural elements (825--834); Janusz\ Niczyj\ and Witold\ M.\ Paczkowski, An expert system of controlling a program for discrete structural optimization (835--842); L.\ J.\ Schmid, G.\ Sved\ and A.\ R.\ Simpson, Genetic algorithms applied to structural engineering problems (843--849); Hiroaki\ Ishii [Hiroaki Ishii\asup 1]\ and Tatsuo\ Matutomi, The asymmetric rectilinear distance location problem with barriers (965--969); Tatsuo\ Matsutomi\ and Hiroaki\ Ishii [Hiroaki Ishii\asup 1], A single facility location problem with fixed orientations (970---975); Kar\ Yan\ Tam, A genetic algorithm approach to the facility layout problem (976--981); Cheng\ Xian\ Xu\ and J.\ L.\ de Jong, Sequential quadratic programming methods for optimal control problems with state constraints (1197--1208); François-Xavier\ Le Dimet, Optimization and optimal control in atmospheric sciences (1220--1229). \par \{Some of the papers are being reviewed individually.\}