Mathematical Programming

Mathematical Programming

Volumn , Issue , 2006, Pages

  Sinha, S M ^a  

^a UNIVERSITY OF DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85013698665     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-81-312-0376-7.X5000-3     Document Type: Book

References (581)

1. Nonlinear Programming 1967, North Holland Publishing company, Amsterdam. J. Abadie (Ed.).
2. Abadie J On the Kuhn-Tucker Theorem 1967, [1].
3. Integer and Nonlinear Programming 1970, North Holland Publishing Company, Amsterdam. J. Abadie (Ed.).
4. Abadie J, Carpenter J Generalization of the Wolfe Reduced Gradient Method to the case of Nonlinear constraints. optimization 1969, Academic Press, London. R. Fletcher (Ed.).
5. Abadie J, Williams AC Dual and Parametric Methods in Decompostion. Recent Advances in Mathematical Programming 1963, McGraw-Hill Book Company, New York. R.L. Graves, P. Wolfe (Eds.).
6. Aggarwal SP, Swarup Kanti Fractional Functionals Programming with a Quadratic Constraints. Operations Research 1966, Vol. 14:950-956.
7. Aggarwal SP, Sharma IC Maximization of the Transimission Rate of a Discrete Constant Channel. Unternehmensforschung 1970, Vol. 11:152-155.
8. Aggarwal SP, Saxena PC Duality Theorems for Nonlinear Fractional Programs. ZAMM 1975, Vol. 55:523-524.
9. Aggarwal SP, Saxena PC A class of Fractional Programming Problems. New Zealand, Operational Research 1979, Vol. 7:79-90.
10. Allen RGD Mathematical Economies 1957, McMillan & Company, London.
11. Almogy Y, Levin O Parametric Analysis of a Multistage Stochastic Shipping Problem. Operational Research 1970, Tavistock Publications, London. J. Lawrence (Ed.).
12. Almogy Y, Levin O A Class of Fractional Programming Problems. Operations Research 1971, Vol. 19:57-67.
13. Anstreicher KM Analysis of a Modified Karmarkar Algorithm for Linear Programming. Working Paper Series B, No 84 1985, CT06520, Yale School of Organization and Management, Box 1 A, New Haven.
14. Anstreicher KM A Strenthened Acceptance Criterion for Approximate Projection in Karmarlar's Algorithm. Operations Research Letters 1986, Vol. 5:211-214.
15. Apostol TM Mathematical Analysis 1957, Addison-Wesley, Reading, Mass.
16. Arrow KJ, Enthoven AC Quasi-Concave Programming. Econometrica 1961, Vol. 29:779-800.
17. Studies in Linear and Non Linear Programming 1958, Stanford University Press, Stanford. K.J. Arrow, L. Hurwicz, Huzawa (Eds.).
18. Arrow KJ, Hurwicz L Constraint Qualifications in Maximization Problems. Naval Research Logistics Quarterly 1961, Vol. 8:175-191.
19. Avriel M Nonlinear Programming: Analysis and Methods 1976, Prentice Hall, Englewood Cliffs, NJ.
20. Avriel M, Zang I Generalized Convex Functions with Applications to Nonlinear Programming. Mathematical Programs for Activity Analysis 1974, P. Van Moeseki (Ed.).
21. Aylawadi DR Duality for Homogeneous Fractional Programming with Nonlinear Constraints. J. Math, Sciences 1978, Vol. 12-13:29-32.
22. Balas E Solution of Large Scale Transportation Problems Through Aggregation. Operations Research 1965, Vol. 13:82-93.
23. Balas E The Dual Method for the Generalized Transportation Problem. Management Science 1966, Vol. 12:555-568.
24. Balas E Nonconvex Quadratic Programming via Generalized Polars. SIAM J Applied Mathematics 1975, Vol. 28:335-349.
25. Balinski ML Fixed Cost Transportation Problems. Naval Research Logistics Quarterly 1961, Vol. 8:41-54.
26. Balinski ML An Algorithm for Finding All Vertices of Convex Polyhedral Sets. SIAM J Applied Mathematics 1961, Vol. 9:72-88.
27. Non Differentiable Optimization, Mathematical Programming study 1975, American Elsevier, New York. M.L. Balinski, P. Wolfe (Eds.).
28. Barankin EW and R Dorfman, "On Quadratic Programming," University of California Publications in Statistics Vol. 2, pp 285-318, University of California Press, Berkeley, California.
29. Bartle RG The Elements of Real Analysis 1976, John Wiley & Sons, New York.
30. Bazaraa MS A Theorem of the Alternative with Applications to Convex Programming; Optimality, Duality and Stability. J Mathematical Analysis and Applications 1973, Vol. 41:701-715.
31. Bazaraa MS, Goode JJ Necessary Optimality Criteria in Mathematical Programming in the Presence of Differentiability. J Mathematical Analysis and Applications 1972, Vol. 40:609-621.
32. Bazaraa MS, Goode JJ On Symmetric Duality in Nonlinear Programming. Operations Research 1973, Vol. 21:1-9.
33. Bazaraa MS, Goode JJ, Shetty CM Optimality Criteria without Differentiablity. Operations Research 1971, Vol. 19:77-86.
34. Bazaraa MS, Goode JJ, Shetty CM A Unified Nonlinear Duality Formulation. Operations Research 1971, Vol. 19:1097-1100.
35. Bazaraa MS, Goode JJ, Shetty CM Constraint Qualifications Revisited. Management Science 1972, Vol. 18:567-573.
36. Bazaraa MS, Jarvis JJ, Sharali HD Linear programming and Network Flows 1990, John Wiley and Sons, New York.
37. Bazaraa MS, Sharali HD, Shetty CM Non Linear Programming: Theory and Algorithms 1993, John Wiley and Sons, New York.
38. Beale EML An Alternative Method for Linear Programming. Proceedings of the Cambridge Philosophical Society 1954, Vol. 50:513-523.
39. Beale EML On Minimizing a Convex Function Subject to Linear Inequalities. J Royal Stastical Society, Ser B 1955, Vol. 17:173-184.
40. Beale EML Cycling in the Dual Simplex Algorithms. Naval Research Logistics Quaterly 1955, Vol. 2:269-276.
41. Beale EML On Quadratic Programming. Naval Research Logistics Quaterly 1959, Vol. 6:227-244.
42. Beale EML The Simplex Method Using Pseudo-basic Variables for Structured Linear Programming Problems. Recent Advances in Mathematical Programming 1963, McGraw-Hill Book Company, NY. R.L. Graves, P. Wolfe (Eds.).
43. Beale EML Numerical Methods. Nonlinear Programming 1967, J. Abadic (Ed.).
44. Bector CR Programming Problems with convex Fractional Functions. Operations Research 1968, Vol. 16:383-391.
45. Bector CR Duality in Nonlinear Fractional Programming. Zietschrift fiir Operations Research 1973, Vol. 17:183-193.
46. Bellman R Dynamic Programming 1957, Princeton University Press, Princeton, NJ.
47. Bellman R Adaptive Control Processes: A Guided Tour 1961, Princeton University Press, Princeton, New Jersey.
48. Bellman R, Dreyfus SE Applied Dynamic Programming 1962, Princeton University Press, Princeton, NJ.
49. Benders JF Partitioning Procedures for Solving Mixed Variables Programming Problems. Numerische Mathematik 1962, Vol. 4:238-252.
50. Benson HP Finding an Initial Efficient Point for a Linear Multiple Objective Program. J Operational Research Society 1981, Vol. 32:495-498.
51. Benson HP Global Optimization Algorithm for the Nonlinear Sum of Ratios Problem. J Optimization Theory and Applications 2002, Vol. 112:1-29.
52. Bereanu B Distribution Problems and Minimum-Risk Solutions in Stochastic Programming. Colloquium on Applications of Mathematics in Economics 1963, 37-42. Academiai Kiado, Budapest. A. Prekopa (Ed.).
53. Bereanu B On Stochatic Linear Programming. Rev Math Purest Appl, Acad Rep Populaire Roumaine 1963, Vol. 8:683-697.
54. Berge C Topological Spaces 1963, MacMillan Company, New York.
55. Berge C, Houri A Ghouila Programming, Games and Transportation Networks 1965, John Wiley and Sons, New York.
56. Birkhoff G, Maclane S A Survey of Modern Algebra 1953, MacMillan Company, New York.
57. Bitran GR Theory and Algorithms for Linear Multiple Objective Programs with Zero-One variables. Mathematical Programming 1979, Vol. 17:362-390.
58. Bitran GR, Magnanti TL Duality and Sensitivity Analysis for Fractional Programs. Operations Research 1976, Vol. 24:657-699.
59. Bitran GR, Novaes AG Linear Programming with a Fractional Objective Function. Operations Research 1973, Vol. 21:22-29.
60. Bland RG, Goldfarb D, Todd MJ The Ellipsoid Method: A Survey. Operations Research 1981, Vol. 29:1039-1091.
61. Blum E, Oettli W Direct Proof of the Existence Theorem for Quadratic Programming. Operations Research 1972, Vol. 20:165-167.
62. Boot JCG Quadratic Programming 1964, North Holland Publishing Co., Amsterdam.
63. Bradley SP, Frey SC Fractional Programming with Homogenous Functions. Operations Research 1974, Vol. 22:350-357.
64. Buck RC Mathematical Analysis 1965, McGraw Hill Book Co, New York.
65. Cambini A, Martein L, Schaible S On Maximizing a Sum of Ratios. J Information and Optimization Sciences 1989, Vol. 10:65-79.
66. Carathèodory C Uber den variabilitatsbereich der koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen. Mathematsche Annälen 1907, Vol. 64:95-115.
67. Chadha SS A Dual Fractional Program. ZAMM 1971, Vol. 51:560-561.
68. Chandra S, Gulati TR A Duality Theorem for a Nondifferentiable Fractional Programmig Problem. Management Science 1976, Vol. 23:32-37.
69. Charnes A Optimality and Degeneracy in Linear Programming. Econometrica 1952, Vol. 20:160-170.
70. Charnes A, Cooper WW The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems. Management Science 1954, Vol. l(1).
71. Charnes A, Cooper WW Nonlinear Power of Adjacent Extreme Point Methods of Linear Programming. Econometrica 1957, Vol. 25:132-153.
72. Charnes A, Cooper WW Chance Constrained Programming. Management Science 1959, Vol. 6:73-79.
73. Charnes A, Cooper WW Management Models and Industrial Applications of Linear Programming, Vols. I and II 1961, John Wiley & Sons, New York.
74. Charnes A, Cooper WW Programming with Linear Fractional Functionals. Naval Research Logistics Quaterly 1962, Vol. 9:181-186.
75. Charnes A, Cooper WW Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints. Operations Research 1963, Vol. 11:18-39.
76. Charnes A, Cooper WW Goal Programming and Multiple Objective Optimization-Part 1. Europeon Journal of Operational Research 1977, Vol. 1:39-54.
77. Charnes A, Cooper WW, Ferguson RO Optimal Estimation of Executive Compensation by Linear Programming. Management Science 1955, Vol. 1:138-151.
78. Charnes A, Cooper WW, Kortanek KO A Duality Theory for Convex Programs with Convex Constraints. Bull American Mathematical Society 1962, Vol. 68:605-608.
79. Charnes A, Kirby MJL, Raike WM Solution Theorems in Probabilistic Programming-A Linear Programming Approach. J Mathematical Analysis and Applications 1967, Vol. 20:565-582.
80. Charnes A, Lemke CE The Bounded Variable Problem. ONR Research Memorandum No 10 1954, Graduate School of Industrial Administration Carnegie Institute of Technology, Pittsburgh, Pa.
81. Charnes A, Lemke CE Minimisation of Non linear Separable convex Functionals. Naval Research Logistics Quaterly 1954, Vol. 1(4).
82. Charnes A, Song T, Wolfe M An Explicit Solution Sequence and Convergence of Karmarkar's Algorithm. Research Report CCS 501 1984, College of Business Administration, The University of Texas at Austin, Austin.
83. Contini B A Stochastic Approach to Goal Programming. Operations Research 1968, Vol. 16:576-586.
84. Cottle RW A Theorem of Fritz John in Mathematical programming. The Rand Corporation Research Memorandum RM-3858-PR 1963.
85. Cottle RW Symmetric Dual Quadratic Programs. Quaterly of Applied Mathematics 1963, Vol. 21:237-243.
86. Cottle RW, Dantzig GB Complementary Pivot Theory of Mathematical Programming. Linear Algebra and Applications 1968, Vol. l:103-125.
87. Cottle RW, Dantzig GB A Generalization of the Linear Complementarity Problem. Journal of Combinational theory 1970, Vol. 8:79-90.
88. Non linear Programming 1976, American Mathematical Society, Providence, RI. R.W. Cottle, C.E. Lemke (Eds.).
89. Courant R Differential and Integral Calculus 1947, Vol. II. Interscience Publishers, New York.
90. Courant R, Hilbert D Methods of Mathematical Physics 1953, Vol. I. Interscience Publishers, New York.
91. Courtillot M On Varying All the Parameters in a Linear Programming Problem and Sequential Solution of a Linear Programming Problem. Operations Research 1962, Vol. 10(4).
92. Cramer H Mathematical Methods of Statistics 1946, Princeton University Press, Princeton, NJ.
93. Craven BD A generalization of Lagrange Multipliers. Bull Australian Mathematical Society 1970, Vol. 3:353-362.
94. Craven BD, "Fractional Programming-A Survey," Opsearch, Vol. 25, pp 165-175.
95. Craven BD Control and Optimization 1995, Chapman and Hall, London.
96. Craven BD, Mond B The Dual of a Fractional Linear Program. Journal of Mathematical Analysis and Applications 1973, Vol. 42:507-512.
97. Craven BD, Mond B Duality for Homogenous Fractional Programming. Cahiers Du Centre D'etudes de Recherche Operationnelle 1976, Vol. 18:413-417.
98. Dantzig GB Maximization of a Linear Function of Variables subject to Linear Inequalities 1951, Chap 21 in [283].
99. Dantzig GB Application of the Simplex Method to a Transportation Problem 1951, Chap 23 in [283].
100. Dantzig GB Computational Algorithm of the Revised Simplex Method. RM 1266 1953, The Rand Corporation.
101. Dantzig GB The Dual Simplex Algorithm. RM 1270 1954, The Rand Corporation.
102. Dantzig GB Composite Simplex-Dual Simplex Algorithm. RM 1274 1954, The Rand Corporation.
103. Dantzig GB Upper Bounds, Secondary Constraints and Block Triangularity in Linear Programming. Econometrica 1955, Vol. 23:174-183.
104. Dantzig GB Linear Programming under Uncertainty. Management Science 1955, Vol. 1:197-206.
105. Dantzig GB Recent Advances in Linear Programming. Management Science 1956, Vol. 2:131-144.
106. Dantzig GB Discrete Variable Extremum Problems. Operations Research 1957, Vol. 5:266-277.
107. Dantzig GB On the Significance of Solving Linear Programming Problems with Some Integar Variables. Economerica 1960, Vol. 28:30-44.
108. Dantzig GB On the Shortest Route through a Network. Management Science 1960, Vol. 6:187-190.
109. Dantzig GB General Convex Objective Forms. Mathematical Methods in the Social Sciences 1960, Stanford University Press, Stanford. K. Arrow, S. Karlin, P. Suppes (Eds.).
110. Dantzig GB Quadratic Programming, A Variant of the Wolfe-Markowitz Algortihms. ORC 61-2 1961, Operations Research Center, University of California, Berkeley, Calif.
111. Dantzig GB Linear Pogramming and Extensions 1963, Princeton University Press, Princeton, NJ.
112. Dantzig GB Linear Control Processes and Mathematical Programming. SIAM J control 1966, Vol. 4:56-60.
113. Dantzig GB, Eisenberg E, Cottle RW Symmetric Dual Nonlinear Programs. Pacific J Mathematics 1965, Vol. 15:809-812.
114. Dantzig GB, Ford LR, Fulkerson DR A Primal Dual Algorithm for Linear Programs. Annals of Mathematics Study 1956, No 38. H.W. Kuhn, A.W. Tucker (Eds.).
115. Dantzig GB, Johson SM, White WB A Linear Programming Approach to the Chemical Equilibrium Problem. Management Science 1958, Vol. 5:38-43.
116. Dantzig GB, Madansky A On the Solution of Two-Stage Linear Programs under Uncertainty. Proceedings Fourth Berkeley Symposium on Mathematical Statistics and Probability 1961, Vol. I. J. Neyman (Ed.).
117. Dantzig GB, Orchard-Hays W Alternate Algorithm for the Revised Simplex Method Using Product Form for the Inverse. RAND Report RM- 1268 1953, The RAND Corporation.
118. Dantzig GB, Orden A Duality Theorems. RAND Report RM-1265 1953, The RAND Corporation.
119. Dantzig GB, Orden A, Wolfe P Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints. Pacific J Mathematics 1955, Vol. 5:183-195.
120. Dantzig GB, Vanslyke RM Generalized Upper Bounded Techniques for Linear Programming. ORC 64-17, and ORC 64-18 1964, Operations Research Center, University of California, Berkeley, Calif.
121. Dantzig GB, Wolfe P Decomposition Principle for Linear Programs. Operations Research 1960, Vol. 8:101-111.
122. Dantzig GB, Wolfe P The Decomposition Algortihm for Linear Programming. Econometrica 1961, Vol. 29:767-778.
123. Dantzig GB, Infanger G Multi-Stage Stochastic Linear Programs for Portfolio Optimization. Proceedings of the Third RAMP Symposium 1991.
124. Dauer JP, Krueger RJ An Iterative Approach to Goal Programming. Operational Research Quaterly 1977, Vol. 28:671-681.
125. Davies D Some Practical Methods of Optimization 1970, Abadie [3].
126. Dennis JB Mathematical Programming and Electrical Networks 1959, John Wiley & Sons, New York.
127. Dinkelbach W On Nonlinear Fractional programming. Management Science 1967, Vol. 13:492-498.
128. Dixon LCW Nonlinear Optimization 1972, The English University Press, London.
129. Dorfman R Application of Linear Programming to the Theory of the Firm 1951, University of California Press, Berkeley.
130. Dorfman R, Samuelson PA, Solowo RM Linear Programming and Economic Analysis 1958, McGraw Hill Book Company, New York.
131. Dorn WS Duality in Quadratic Programming. Quarterly of Applied Mathematics 1960, Vol. 18:155-162.
132. Dorn WS On Lagrange Multipliers and Inequalities. Operations Research 1961, Vol. 9:95-104.
133. Dorn WS Self-dual Quadratic Programs. SIAMJ 1961, Vol. 9:51-54.
134. Dorn WS Linear Fractional Programming. IBM Research Report, RC-830 1962.
135. Dorn WS Nonlinear Programming-A survey. Management Science 1963, Vol. 9:171-208.
136. Dreyfus S Computational Aspects of Dynamic Programming. Operations Research 1957, Vol. 5:409-415.
137. Duffin RJ Infinite Programs 1956, [292].
138. Dur M, Horst R, Thoai NV Solving Sum of Ratios Fractional Programs using Efficient Points. Optimizaton 2001, Vol. 49.
139. Dwyer PS The Solution of the Hitchcock Transportation Problem with the Method of Reduced Matrices. Engineering Research Institute Report 1955, University of Michigan, Ann Arbor, Michigan.
140. Eaves BC On the Basic Theorem of Complementarity. Mathematical Programming 1971, Vol. 1:68-75.
141. Eaves BC The Linear Complementarity Problem. Management Science 1971, Vol. 17:612-634.
142. Ecker JG, Hegner NS On Computing an Initial Efficient Extreme Point. Journal of the Operational Research Society 1978, Vol. 29:1005-1007.
143. Ecker JG, Hegner NS, Kouada IA Generating All Maximal Efficient Faces for Multiple Objective Linear Programs. Journal of Optimization Theory and Applications 1980, Vol. 30:353-381.
144. JG Ecker, Kouada IA Finding Efficient points for Linear Multiple Objective Programs. Mathematical Programming 1975, Vol. 8:375-377.
145. Ecker JG, Kouada IA Finding All Efficient points for Linear Multiple Objective Programs. Mathematical Programming 1978, Vol. 14:249-261.
146. Egerváry E On Combinational Properties of Matrices (1931). Paper no. 4 1954, translated by HW Kuhn, George Washington University Logistics Research Project.
147. Eisenberg E Duality in Homogenous Programming. Proc American Mathematical Society 1961, Vol. 12:783-787.
148. Eisenberg E Supports of a Convex Function. Bull American Mathematical Society 1962, Vol. 68:192-195.
149. Eisenberg E On Cone Functions. Recent Advances in Mathematical Programming 1963, R.L. Graves, P. Wolfe (Eds.).
150. Eisenberg E A Gradient Inequality for a Class of Non Differentiable Functions. Operations Research 1966, Vol. 14:157-163.
151. Evans JP On Constraint Qualifications in Nonlinear Programming. Naval Research Logistics Quaterly 1970, Vol. 17:281-286.
152. Evans JP, Gould FJ A Nonlinear Duality Theorem Without Convexity. Econometrica 1972, Vol. 40:487-496.
153. Evans JP, Steuer RE A Revised Simplex Method for Linear Multiple Objective Programs. Mathematical Programming 1973, Vol. 5:54-72.
154. Everett H Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources. Operations Research 1963, Vol. 11:399-417.
155. Falk JE, Palocsay SW Optimizing the Sum of Linear Fractional functions. Recent Advances in Global Optimization 1992, Kluwer Academic Publishers, Dordrecht. C.S. Floudas, P.M. Pardalos (Eds.).
156. Fan K, Glicksburg I, Hoffman AJ Systems of Inequalities Involving Convex Functions. Proceed American Mathematical Society 1957, Vol. 8:617-622.
157. Farkas J Uber die Theorie der einfachen Ungleichungen. Journal für die Reine and Angewandte Mathematik 1902, Vol. 124:1-24.
158. Feller W An Introduction to Probality Theory and its Applications, Vol l 1957, John Wiley & Sons, New York. Second Edition.
159. Fenchel W Convex Cones, Sets and Functions. Lecture Notes 1953, Department of Mathematics, Princeton University.
160. Ferguson Allen R, Dantzig GB The Allocation of Aircraft to Routes- An Example of Linear Programming under Uncertain Demand. Management science 1956, Vol. 3:45-73.
161. Ferland JA. Mathematical Programming Problems with Quasi-Convex Objective Functions. Mathematical Programming 1972, Vol. 3:296-301.
162. Fiacco AV, McCormick GP Nonlinear Programming: Sequential Unconstrained Minimization Techniques 1968, John Wiley & Sons, New York.
163. Finkbeiner DT Introduction to Matrices and Linear Transformations 1966, WH Freeman and Company, London.
164. Fleming WH Functions of Several Variables 1965, McGraw-Hill Book Company, New York.
165. Optimization 1969, Academic Press, London. R. Fletcher (Ed.).
166. Fletcher R A General Quadratic Programming Algorithm. J Institute of Mathematics and Its Applications 1971, Vol. 7:76-91.
167. Fletcher R Practical Methods of Optimization 1987, John Wiley and Sons, New York. Second Edition.
168. Fletcher R A General Quadratic Programming Algorithm. J Institute of Mathematics and Its Applications 1971, Vol. 7:76-91.
169. Flood MM On the Hitchcock Distribution Problem. Pacific Journal of Mathematics 1953, Vol. 3(2).
170. Flood MM The Traveling Salesman Problem. Operations Research 1956, Vol. 4:61-75.
171. Ford LR, Fulkerson DR Maximal Flow Through a Network. Canadian Journal of Mathematics 1956, Vol. 8:399-404.
172. Ford LR, Fulkerson DR Solving the Transportation Problem. Management Science 1956, Vol. 3(1).
173. Ford LR, Fulkerson DR A Primal-Dual Algorithm for the Capacitated Hitchcock Problem. Naval Research Logistics Quarterly 1957, Vol. 4:47-54.
174. Ford LR, Fulkerson DR Flows in Networks 1962, Princeton University Press, Princeton, NJ.
175. Frank M, Wolfe P Am Algorithm for Quadratic Programming. Naval Research Logistics Quarterly 1956, Vol. 3:95-110.
176. Frechet M Recherches Thèoriques Modernes sur la Thèorie des Probabilities 1937, Paris.
177. Freund RJ The Introduction of Risk into a Programming Model. Econometrica 1956, Vol. 24:253-263.
178. Fraund RW, Jarre F Solving the Sum of Ratios Problem by an Interior Point Method. J of Global Optimization 2001, Vol. 19.
179. Frisch RAK The multiplex method for Linear and Quadratic Programming 1957, Memorandum of Social Institute, University of Oslo, Norway.
180. Frisch RAK Quadratic Programming by the Multiplex Method in the General Case where the Quadratic Form may be Singular. Memorandum of Economic Institute 1960, University of Oslo, Norway.
181. Gacs P, Lovasz L Khachian's Algorithm for Linear Programming. Mathematical Programming Study 1981, 14:61-68. North-Holland, Amsterdam.
182. Gal T A General Method for Determining the set of All Efficient Solutions to a Linear Vector Maximum Problem. European Journal of Operational Research 1977, Vol. 1:307-322.
183. Gale D Convex Polyhedral Cones and Linear Inequalitites 1951, [283].
184. Gale D Neighboring Vertices on a Convex Polyhedron 1956, [292].
185. Gale D The Theory of Linear Economic Model 1960, McGraw-Hill Book Company, New York.
186. Gale D On the Number of Faces of a Convex Polytope. Technical Report No 1 1962, Department of Methematics, Brown University.
187. Gale D, Kuhn HW, Tucker AW Linear Programming and the Theory of Games. Activity Analysis of Production and Allocation 1951, John Wiley & Sons, New York. T.C. Koopmans (Ed.).
188. Garvin WW Introduction to Linear Programming 1960, McGraw-Hill Book Co., New York.
189. Gass SI Linear Programming: Methods and Applications 1975, McGraw- Hill Book Co. 4th ed.
190. Gass SI The Dualplex Method for Large-scale Linear Programs. ORC Report 66-15 1966, Operations Research Center, University of California, Berkeley, Calif.
191. Gass SI, Saaty TL The Computational Algorithm for the Parametric Objective Function. Naval Research Logistics Quarterly 1955, Vol. 2:39-45.
192. Gass SI, Saaty TL Parametric Objective Function, Part II: Generalization. Operations Research 1955, Vol. 3:395-401.
193. Gassner Betty J Cycling in the Transportation Problem. Naval Research Logistics Quarterly 1964, Vol. 11(1).
194. Gay DM A Variant of Karmarkar's Linear Programming Algorithms for Problems in Standard Form. Mathematical Programming 1987, Vol. 37:81-90.
195. Geoffrion AM Strictly Concave Parametric Programming, I, II. Management Science 1966, Vol. 13:244-253.
196. Geoffrion AM Strictly Concave Parametric Programming, I, II. Management Science 1967, Vol. 13:359-370.
197. Geoffrion AM Solving Dicriterion Mathematical Programs. Operations Research 1967, Vol. 15:39-54.
198. Geoffrion AM Stochastic Programming with Aspiration or Fractile Criteria. Management Science 1967, Vol. 13:672-679.
199. Geoffrion AM Proper Efficiency and the Theory of Vector Maximization. J Mathematical Analysis and Applications 1968, Vol. 22:618-630.
200. Geoffrion AM Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems. Operations Research 1970, Vol. 18:375-403.
201. Geoffrion AM Duality in Nonlinear programming: A Simplified Applications- Oriented Development. SIAM Review 1971, Vol. 13:1-37.
202. Gill PE, Murray W, Saunders MA, Tomlin JA, Wright MH On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method. Mathematical Programming 1986, Vol. 36:183-209.
203. Gilmore PC, Gomary RE A Linear Programming Approach to the Cutting Stock Problem-Part I. Operations Research 1961, Vol. 9:849-859.
204. Gilmore PC, Gomory RE A Linear Programming Approach to the Cutting Stock Problem-Part 2. Operations Research 1963, Vol. 11:863-867.
205. Goldfarb D Extension of Davidson's Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints. SIAM J Applied Mathematics 1969, Vol. 17:739-764.
206. Goldfarb D, Mehrotra S A Relaxed Version of Karmarkar's Method. Mathematical programming 1988, Vol. 40:289-316.
207. Goldman AJ, Tucker AW Theory of Linear Programming 1956, 53-98. [292].
208. Goldman AJ, Tucker AW Polyhedral Convex Cones 1956, 19-39. [292].
209. Gol'stein EG Dual Problems of Convex and Fractionally-Convex Programming in Functional Spaces. Soviet Math-Doklady 1967, Vol. 8:212-216.
210. Gomory RE An Algorithm for Integer Solutions to Linear Programs. Princeton-IBM, Mathematics Research Project, Tech Report No. 1 1958.
211. Recent Advances in Mathematical Programming 1963, McGraw-Hill Book Co, New York. R.L. Groves, P. Wolfe (Eds.).
212. Gomory RE An Algorithm for the Mixed Integer Problem. Research Memorandum RM-2597 1960, The Rand Corporation, Santa Monica, Calif.
213. Gomory RE All-Integer Programming Algorithm. IBM Research Center, RC 189 1960, New York.
214. Gordan P Uber die Auflosungen linearer Gleichungen mit reelen coefficienten. Math Annalen 1873, Vol. 6:23-28.
215. Graves RL Parametric Linear Programming 1963, 201-210. [211].
216. Recent Advances in Mathematical Programming 1963, McGraw-Hill Book Company, New York. R.L. Graves, P. Wolfe (Eds.).
217. Greenberg HJ, Pierskalla WP A Review of Quasi-Convex Functions. Operations Research 1971, Vol. 19:1553-1570.
218. Griffith RE, Stewart RA A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems. Management Science 1961, Vol. 17:379-392.
219. Gupta SK, Bector CR Nature of Quotients, Products and Rational Powers of Convex (Concave)-Like Functions. Mathematics Student 1968, Vol. 36:63-67.
220. Hadley G Linear Algebra 1961, Addison-Wesley, Reading, Mass.
221. Hadley G Linear Programming 1962, Addison-Wesley, Reading, Mass.
222. Hadley G Nonlinear and Dynamic Programming 1964, Addison-Wesley, Reading, Mass.
223. Halmos PR Finite - Dimensional Vector Spaces 1958, D Van Nostrand Company, Princeton, NJ.
224. Hannan EL Nondominance in Goal Programming. INFOR 1978, Vol. 18:300-309.
225. Hannan EL On Fuzzy Goal Programming. Decision Sciences 1981, Vol. 12:522-531.
226. Hanson MA A Duality Theorem in Nonlinear Programming with Nonlinear constraints. Australian Journal of Statistics 1961, Vol. 3:64-72.
227. Hanson MA An Algorithm for Convex Programming. Australian Journal of Statistics 1963, Vol. 5:14-19.
228. Hanson MA Duality and Self-Duality in Mathematical Programming. SIAM J Applied Mathematics 1964, Vol. 12:446-449.
229. Hanson MA On Sufficiency of the Kuhn-Tucker Conditions. J Mathematical analysis and Applications 1981, Vol. 80:545-550.
230. Hanson MA, Mond B Further Generalizations of Convexity in Mathematical Programming. J Information and Optimization Sciences 1982, Vol. 3:25-32.
231. Hartley HO Nonlinear Programming by the Simplex Method. Econometrica 1961, Vol. 29:223-237.
232. Hildreth C A Quadratic Programming Procedure. Naval Research Logistics Quarterly 1957, Vol. 4:79-85.
233. Hiller FS, Lieberman GJ Introduction to Operations Research 1968, Holden- Day, Inc, San Francisco.
234. Hirche J A Note on Programming Problems with Linear-plus-Linear- Fractional Objective Functions. European Journal of Operational Research 1996, Vol. 89:212-214.
235. Hitchcock FL The Distribution of a Product from Several Sources to Numerous Localities. J Mathematical Physics 1941, Vol. 20:224-230.
236. Hodgson TJ, Lowe TJ Production Lot Sizing with Material Handing Cost Considerations. IEE Transactions 1982, Vol. 14:44-51.
237. Hoffman AJ Cycling in the Simplex Algorithm. National Bureau of Standards, Report No. 2974 1953.
238. Hoffman AJ Some Recent Applications of the Theory of Linear Inequalities to Extremal Combinatorial Analysis. Proc Sympos Appl Math 1960, Vol. 10. R. Bellman, M. Hall (Eds.).
239. Some Techniques of Operational Research 1962, The English Universities Press Ltd, London. B.T. Houlden (Ed.).
240. Houthakker HS On the Numerical Solution of Transportation Problem. Operations Research 1955, Vol. 3(2).
241. Houthakker HS The Capacity Method of Quadratic Programming. Econometrica 1960, Vol. 28:62-87.
242. Howard RA Dynamic Programming and Markov Processes 1960, John Wiley and Sons, New York.
243. Huard P Dual Programs 1963, [211].
244. Huard P Resolution of Mathematical Programming with Nonlinear Constraints by the Method of Centres 1967, [1].
245. Ibaraki T Solving Mathematical Programming Problem with Fractional Objective Function. Generalized Concavity in Optimization and Economics 1981, Academic Press, New York. S. Schaible, W.T. Ziemba (Eds.).
246. Ibaraki T Parametric Approaches to Fractional Programs. Technical Report 1962, Kyoto University.
247. Ignizio JP Goal Programming and Extensions 1976, DC Heath and Co, Lexington, Mass.
248. Ignizio JP A Review of Goal Programming: A Tool for Multi-objective Analysis. J Operational Research 1978, Vol. 29:1109-1119.
249. Ignizio JP The Determination of a Subset of Efficient Solutions via Goal Programming. Computers and Operations Research 1981, Vol. 8:9-16.
250. Ignizio JP Linear Programming in Single & Multiple-Objective Systems 1982, Prentice-Hall, NJ.
251. Ignizio JP A Note on Computational Methods in Lexicographic Linear Goal Programming. J Operational Research 1983, Vol. 34:539-542.
252. Ignizio JP, Perlis JH Sequential Linear Goal Programming: Implementation via MPSX. Computers and Operations Research 1979, Vol. 6:141-145.
253. Ijiri Y Management Goals and Accounting for Control 1965, North Holland, Amsterdam.
254. Isbell JR, Marlow WH Attrition Games. Naval Research Logistics Quarterly 1956, Vol. 3:71-93.
255. Isermann H Proper Efficiency and the Linear Vector Maximum Problem. Operations Research 1974, Vol. 22:189-191.
256. Iserman H The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program. Operational Research Quarterly 1977, Vol. 28:711-725.
257. Isermann H, "Lexicographic Goal Programming: The Linear Case," in Multiobjective and Stochastic Optimization, GA Lewandowski and AP Wierzbicki (eds), Int Inst for Applied Systems Analysis, Luxemberg, Austria.
258. Jagannathan R On Some Properties of Programming Problems in Parametric Form Pertaining to Fractional Programming. Management Science 1966, Vol. 12:609-615.
259. Jagannathan R Duality for Nonlinear Fractional Programs. Zietschrift fur Operations Research 1973, Vol. 17:1-3.
260. Jagannathan R A Sequential Algorithm for a Class of Programming Problems with Nonlinear Constraints. Management Science 1974, Vol. 21:13-21.
261. Jagannathan R, Schaible S Duality in Generalized Fractional Programming via Farkas' Lemma. J Optimization theory and applications 1983, Vol. 41:417-424.
262. John F Extremum Problems with Inequalities as Subsidiary Conditions. Studies and Essays: Courant Anniversary Volume 1948, Interscience Publishers, New York. K.O. Friedrichs, O.E. Neugebauer, J.J. Stoker (Eds.).
263. Johnsen E Studies in Multiobjective Decission Models. Studenlitteratur 1968, Economic Research Center, Lund, Sweden.
264. Joksch HC Programming with Fractional Linear Objective Functions. Naval Research Logistics Quarterly 1964, Vol. 11:197-204.
265. Jones PC, Marwil ES A Dimensional Reduction Variant of Khachiyan's Algorithm for Linear Programming Problems 1980, EG & G, Idaho, POB 1625, Idaho Falls, Idaho 83415.
266. Jones PC, Marwil ES Solving Linear Complementarity Problems with Khachiyan's Algorithm 1980, EG & G Idaho, POB 1625, Idaho Falls, Idaho 83415.
267. Kall P Stochastic Linear Programming 1976, Springer-Verlag, New York.
268. Kambo NS Mathematical Programming Techniques 1991, Affiliated East West Press, New Delhi.
269. Kantorovich LV Mathematical Methods in the Organization and Planning of Production 1939, Publication House of the Leningrad State University.
270. Management Science 1958, Vol. 6:366-422.
271. Kantorovich LV On The Translocation of Masses. Compt Rend Aead Sci, USSR 1942, Vol. 37:199-201.
272. Management Science 1958, Vol. 5(1).
273. Karamardian S Strictly Quasi-Convex (Concave) Functions and Duality in Mathematical Programming. J Mathematical Analysis and Applications 1967, Vol. 20:344-358.
274. Karamardian S Generalized Complementarity Problem. J Optimization Theory and Applications 1971, Vol. 8:161-168.
275. Karlin S Mathematical Methods and Theory in Games, Programming and Economics 1959, 1. Addison-Wesley, Reading, Mass.
276. Karlin S Mathematical Methods and Theory in Games, Programming and Economics 1959, 2. Addison-Wesley, Reading, Mass.
277. Karmarkar N A New Polynomial-Time Algorithm for Linear Programming. Combinatorica 1984, Vol. 4:373-395.
278. Karmarkar N, Lagarias JC, Slutsman L, Wang P Power Series Variants of Karmarkar-Type Algorithms. AT & T Technical Journal 1989, Vol. 68:20-36.
279. Kaska J Duality in Linear Fractional Programming. Ewn. Mat. Obzor 1969, Vol. 5:442-453.
280. Kaska J, Pisek M Quadratic Linear Fractional Programming. Ewn. Mat Obzor 1966, Vol. 2:169-173.
281. Kelley JE Parametric Programming and the Primal-Dual Algorithm. Operations Research 1959, Vol. 7.
282. Kelley JE The Cutting Plane Method for Solving Convex Programs. SIAM Journal 1960, Vol. 8:703-712.
283. Khachiyan LG, "A Polynomial Algorithm for Linear Programming," Doklady Akad Nauk USSR, 244, 1093-1096.
284. Soviet Math. Doklady 1979, Vol. 20:191-194.
285. Klee V, Minty GJ How Good is the Simplex Algorithm?. Inequalities III 1972, 159-175. Academic Press, New York. O. Shisha (Ed.).
286. Klein D, Hannan EL An Algorithm for the Multiple Objective Integer Programming Problem. European Journal of Operational Researh 1982, Vol. 9:378-385.
287. Klein M Inspection-Maintenance-Replacement Schedule under Markovian deterioration. Management Scieence 1962, Vol. 9:25-32.
288. Kojima M Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm. Algorithmica 1986, Vol. 1:499-516.
289. Kojima M, Megiddo N, Mizuno S A Primal-Dual Infeasible Interior- Point Algorithm for Linear Programming. Mathematical Programming 1993, Vol. 61:263-280.
290. Konig D Grphen and Matrices. Mat Fiz Lapok 1931, 38:116.
291. Konno H, Yamashita H Minimization of the Sum and the Product of Several Linear Fractional Functions. Naval Research Logistics 1999, Vol. 46:583-596.
292. Koopmans TC Optimum Utilization of the Transportation System. Econometrica 1949, Vol. 17. (Supplement).
293. Activity Analysis of Production and Allocation. Cowles Commission Monograph 1951, 13. John Wiley & Sons, New York. T.C. Koopmans (Ed.).
294. Kornbluth JSH A Survey of Goal Programming. Omega 1973, Vol. 1:193-205.
295. Kornbluth JSH, Salkin GR A Note on the Economic Interpretation of the Dual Variables in Linear Fractional Programming. ZAMM 1972, Vol. 52:175-178.
296. Kornbluth JSH, Steuer RE Goal Programming with Linear Fractional Criteria. European Journal of Operational Research 1981, Vol. 8:58-65.
297. Kornbluth JSH, Steuer RE Multiple Objective Linear Fractional Programming. Management Science 1981, Vol. 27:1024-1039.
298. Kortanek KO, Evans JP Pseudo-Concave Programming and Lagrange Regularity. Operations Research 1967, Vol. 15:883-891.
299. Kovacs LB Gradient Projection Method for Quasi-Concave Programming. Colloquium on Applications of Mathematics to Economics 1963, Budapest. A. Prekopa (Ed.).
300. Kuhn HW The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly 1955, Vol. 2:83-97.
301. Kuhn HW, Tucker AW Nonlinear programming. Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability 1950, 481-492. University of California Press, Berkley, Calif. J. Neyman (Ed.).
302. Linear Inequalities and Related Systems. Annals of Mathematics Study 1956, Princeton University Press, Princeton, NJ. H.W. Kuhn, A.W. Tucker (Eds.).
303. Kuno T A Branch and Bound Algorithm for Maximizing the Sum of Several Linear Ratios. J Global Optimization 2002, Vol. 22:155-174.
304. Kunzi HP, Krelle W, Oettli W Nonlinear Programming 1966, Bleisdell, Waltham, Mass.
305. Kydland F Duality in Fractional Programming. Naval Research Logistics Quarterly 1972, Vol. 19:691-697.
306. Lasdon LS Duality and Decomposition in Mathematical Programming. IEEE Transactions on Systems Science and Cybernetics 1968, Vol. 4:86-100.
307. Lasdon LS Optimization Theory for Large Systems 1970, Macmillan, New York.
308. Lee SM Goal Programming for Decision Analysis 1972, Auerbach Publishers, Philadelphia, PA.
309. Lee SM, Morris RL Integer Goal Programming Methods. TIMS Studies in the Management Sciences 1977, Vol. 6:273-289.
310. Lemke CE The Dual Method of Solving the Linear Programming Problem. Naval Research Logistics Quarterly 1954, Vol. 1:36-47.
311. Lemke CE A Method of Solution for Quadratic Programs. Management Science 1962, Vol. 8:442-455.
312. Lemke CE On Complementary Pivot Theory. Mathematics of the Decision Sciences 1968, G.B. Danting, A.F. Veinoff (Eds.).
313. Lemke CE Recent Results on Complementarity Problems. Nonlinear Programming 1970, Academic Press, New York. J.B. Rosen, O.L. Mangasarian, K. Ritter (Eds.).
314. Leontief WW The Structure of the American Economy, 1919-1939 1951, Oxford University Press, New York.
315. Lintner J The Valuation of Risk Assets and the Selection of Risky Investments in Stock Portfolios and Capital Budgets. Rev Econ and Stat 1965, Vol. 47:13-37.
316. Luenberger DG Quasi-Convex Programming. SIAM Journal Applied Mathematics 1968, Vol. 16:1090-1095.
317. Luenberger DG Introduction to Linear and Nonlinear Programming 1984, Addison-Wesley, Reading, Mass. Second Edition.
318. Lustig IJ Feasibility Issues in a Primal-Dual Interior Point Method for Linear Programming. Mathematical Programming 1991, Vol. 49:145-162.
319. Madansky A Some Results and Problems in Stochastic Linear Programming. The Rand Corporation, Paper P-1596 1959.
320. Madansky A Inequalities for Srochastic Linear Programming Problems. Management Science 1960, Vol. 6(2).
321. Madansky A Methods of Solution of Linear Programs under Uncertainty. Operations Research 1962, Vol. 10:463-471.
322. Madansky A Dual Variables in Two Stage Linear Programming under Uncertainty. J Math Analysis and Applications 1963, Vol. 6:98-108.
323. Madansky A Linear Programming under Uncertainty. Recent Advances in Mathematical Programming 1963, McGraw-Hill, New York. R.L. Graves, P. Wolfe (Eds.).
324. Mahajan DG, Vartak MN Generalization of Some Duality Theorems in Nonlinear Programming. Mathematial Programming 1977, Vol. 12:293-317.
325. Mangasarian OL Duality in Nonlinear Programming. Quarterly of Applied Mathematics 1962, Vol. 20:300-302.
326. Mangasarian OL Nonlinear Programming Problems with Stochastic Objective Functions. Management Science 1964, Vol. 10:353-359.
327. Mangasarian OL Pseudo-Convex Functions. SIAM J-Control 1965, Vol. 3:281-290.
328. Mangasarian OL Nonlinear Fractional Programming. J Operations Research Society of Japan 1969, Vol. 12:1-10.
329. Mangasarian OL Nonlinear Programming 1969, McGraw-Hill Book Co, New York.
330. Mangasarian OL Optimality and Duality in Nonlinear Programming. Proceedings of Princeton Symposium on Mathematical Programming 1970, H.W. Kuhn (Ed.).
331. Mangasarian OL Convexity, Pseudo-Convexity and Quasi-Convexity of Composite Functions. Cahiers Centre Etudes Recherche Operationnelle 1970, Vol. 12:114-122.
332. Mangasarian OL Linear Complimentarity Problems Solveable by a Single Linear Program. Mathematical Programming 1976, Vol. 10:265-270.
333. Mangasarian OL, Fromovitz S The Fritz John Necessary Optimality Conditions in the Presence of Equality and Inequality Constraints. J Math Analysis and Applications 1967, Vol. 17:37-47.
334. Mangasarian OL, Ponstein J Minimax and Duality in Nonlinear Programming. J Math Analysis and Applications 1965, Vol. 11:504-518.
335. Manne AS Linear Programming and Sequential Decisions. Management Science 1960, Vol. 6:259-267.
336. Manne AS On the Job-Shop Scheduling Problem. Operations Research 1960, Vol. 8:219-223.
337. Markowitz HM Portfolio Selection. Journal of Finance 1952, Vol. 7:77-91.
338. Markowitz HM The Optimization of a Quadratic Function Subject to Linear Constraints. Naval Research Logistics Quarterly 1956, Vol. 3:111-133.
339. Markowitz HM Portfolio Selection: Efficient Diversification of Investments 1959, John Wiley and Sons, New York.
340. Markowitz HM, Manne AS On the Solution of Discrete Programming Problems. Econometrica 1957, Vol. 25:84-110.
341. Martos B Hyperbolic Programming. Naval Research Logistics Quarterly 1964, Vol. 11:135-155.
342. Martos B The Direct Power of Adjacent Vertex Programming Methods. Management Science 1965, Vol. 12:241-252.
343. Martos B Quasi-Convexity and Quasi-Monotonicity in Nonlinear Programming. Studia Sci Math Hungarica 1967, Vol. 2:265-273.
344. Martos B Quadratic Programming with a Quasiconvex Objective Function. Operations Research 1971, Vol. 19:87-97.
345. Martos B Nonlinear Programming: Theory and Methods 1975, American Elsevier, New York.
346. McCormick GP Second Order Conditions for Constrained Minima. SIAM J Applied Mathematics 1967, Vol. 15:641-652.
347. McCormick GP Anti-Zig-Zagging by Bending. Management Science 1969, Vol. 15:315-320.
348. McCormick GP The Variable Reduction, Method for Nonlinear Programming. Management Science 1970, Vol. 17:146-160.
349. McCormick GP A Second Order Method for the Linearly Constrained Nonlinear Programming Problems. Nonlinear Programming 1970, J.B. Rosen, O.L. Mangasarian, K. Ritter (Eds.).
350. Mehndiratta SL General Symmetric Dual Programs. Operations Research 1966, Vol. 14:164-172.
351. Mehndiratta SL Symmetry and Self-duality in Nonlinear Programming. Numerische Mathematik 1967, Vol. 10:103-109.
352. Mehndiratta SL Self-Duality in Mathematical Programming. SIAM J Applied Mathematics 1967, Vol. 15:1156-1157.
353. Mehndiratta SL A Generalization of a Theorem of Sinha on Supports of a Convex Function. Australian Journal of Statistics 1969, Vol. 11:1-6.
354. Meister B, Oettli W On the Capacity of a Discrete Constant Channel. Information and control 1967, Vol. II:341-351.
355. Miller CE The Simplex Method for Local Separable Programming. Recent Advances in Mathematical Programming 1963, R.L. Graves, P. Wolfe (Eds.).
356. Mishra AD Optimality Criteria for a Class of Nondifferentiable Programs. Opsearch 1976, Vol. 12:91-106.
357. Mjelde KM Allocation of Resources according to a Fractional Objective. European J Operational Research 1978, Vol. 2:116-124.
358. Mjelde KM Methods of the Allocation of Limited Resources 1983, John Wiley & Sons.
359. Mond B A Symmetric Dual Theorem for Nonlinear Programs. Quarterly of Applied Mathematics 1965, Vol. 23:265-268.
360. Mond B On a Duality Theorem for a Nonlinear Programming Problem. Operations Research 1973, Vol. 21:369-370.
361. Mond B A Class of Nondifferentiable Mathematical Programming Problems. J Math Analysis and Applications 1974, Vol. 46:169-174.
362. Mond B A class of Nondifferentiable Fractional Programming Problems. ZAMM 1978, Vol. 58:337-341.
363. Mond B, Cottle RW Self-Duality in Mathematical Programming. SIAM J Applied Mathematics 1966, Vol. 14:420-423.
364. Mond B, Craven BD A Note on Mathematical Programming with Fractional Objective Function. Naval Research Logistics Quarterly 1973, Vol. 20:577-581.
365. Mond B, Schechter M On a Constraint Qualification in a Nondifferentiable Programming Problem. Naval Research Logistics Quarterly 1976, Vol. 23:611-613.
366. Monroe AE Early Economic Thought; Selections from Economic Literature Prior to Adam Smith 1924, Harvard University Press, Cambridge, Massachusetts.
367. Motzkin TS Beitrage zur theorie der Linearen Ungleichungen. Dissertation 1936, University of Basel, Jerusalem.
368. Murty KG Linear and Combinational Programming 1976, John Wiley & Sons, New York.
369. Mylander WC Finite Algorithms for Solving Quasiconvex Quadratic Programs. Operations Research 1972, Vol. 20:167-173.
370. Nemhauser GL Introduction to Dynamic Programming 1967, John Wiley & Sons, New York.
371. Ohlson JA, Ziemba WT Portfolio Selection in a Lognormal Market when the Investor has a Power Utility Function. J Financial Quantitive Anal 1976, Vol. 11:57-71.
372. Orden A A Procedure for Handling Degeneracy in the Transportation Problem. Minieograph DCS/Comptroller 1951, Headquarter US Air Force, Washington, DC.
373. Orden A The Transhipment Problem. Management Science 1956, Vol. 2:276-285.
374. Panne C van de Methods for Linear and Quadratic Programming 1974, North Holland, Amsterdam.
375. Panne C van de, Whinston A Simplical Methods for Quadratic Programming. Naval Research Logistics Quarterly 1964, Vol. 11:273-302.
376. Panne C van de, Whinston A The Simplex and the Dual Method for Quadratic Programming. Operational Research Quarterly 1964, Vol. 15:355-388.
377. Parikh SC Equivalent Stochastic Linear programs. SIAM J Applied Mathematics 1970, Vol. 18:1-5.
378. Pearson ES, Hartley HO Biometrica Tables for Statisticians 1958, Vol. I. University of Cambridge Press, Cambridge, England.
379. Philip J Algorithms for the Vector Maximization Problem. Mathematical Programming 1972, Vol. 2:207-229.
380. Ponstein J Seven Kinds of Convexity. SIAM Review 1967, 9:115-119.
381. Powell MJD A Survey of Numerical Methods for Unconstrained Optimization. SIAM Review 1970, 12:79-97.
382. Powell MJD Recent Advances in Unconstrained Optimization. Mathematical Programming 1971, Vol. 1:26-57.
383. Prèpoka A Stochastic Programming 1995, Kluwer Publishers, Dordrecht.
384. Rani O, Kaul RN Duality Theorems for a Class of Nonconvex Programming Problems. J Optimization theory and Applications 1973, Vol. 11:305-308.
385. Rech P Decomposition and Interconnected Systems in Mathematical programming. ORC Report 65-31 Operations Research Center 1965, University of California, Berkley, Calif.
386. Reinfeld NV, Vogel WR Mathematical Programming 1958, Prentice-Hall, Englewood, Cliffs, NJ.
387. Riley V, Gass SI Linear Programming and Associated Techniques: A comprehensive bibliography on linear, nonlinear and dynamic programming 1958, John Hopkins Press, Baltimore, Md.
388. Ritter K Ein Verfahren zur Lösung parameterabhängiger nichtlinearer Maximum Problems. Unternehmensforschung 1962, Band 6:149-166.
389. Ritter K A Decomposition Method for Linear Programming Problems with Coupling Constraints and Variables. Mathematics Research Center, US Army, MRC Report No 739 1967, University of Wisconsin, Madison, Wis.
390. Rockafellar RT Duality Theorems for Convex Functions. Bulletin of the American Math Society 1964, 70:189-192.
391. Rockafellar RT Duality in Nonlinear programming. Mathematics of the Decision Sciences 1969, American Mathematical Society, Providence, RI. G.B. Dantzig, A. Veinott (Eds.).
392. Rockafellar RT Convex Analysis 1970, Princeton University Press, Princeton, NJ.
393. Rosen JB The Gradient Projection Method for Nonlinear programming, Part I, Linear Constraints. SIAM J Applied Mathematics 1960, Vol. 8:181-217.
394. Rosen JB The Gradient Projection Method for Nonlinear Programming, Part II Nonlinear Constraints. SIAM J Applied Mathematics 1961, Vol. 9:514-532.
395. Rosen JB Convex Partition Programming. Recent advances in Mathematical Programming 1963, McGraw Hill Book Co, New York. R.L. Graves, P. Wolfe (Eds.).
396. Rosen JB Primal Partition Programming for Block Diagonal Matrices. Numerical Mathematics 1964, Vol. 6:250-260.
397. Rudin W Principles of Mathematical Analysis 1964, McGraw- Hill Book Co., New York. Second Edition.
398. Saaty TL The Number of Vertices of a Ployhedron. American Monthly 1995, Vol.62.
399. Saaty TL Coefficient Perturbation of a Constrained Extremum. Operations Research 1959, Vol. 7.
400. Saaty TL, Bram J Nonlinear Mathematics 1964, McGraw-Hill Book Co, New York.
401. Saaty TL, Gass SI The Parametric Objective Function, Part 1. Operations Research 1954, Vol. 2.
402. Samuelson PA The Fundamental Approximation Theorem of Portfolio Analysis in terms of Means, Variances and Higher Moments. Rev Econom Studies 1974, 537-542.
403. Savage SL Some Theoretical Implications of Local Optimization. Mathematical Programming 1976, Vol. 10:354-366.
404. Schaible S On Factored Quadratic Functions. Zeitschrift für Operations Research 1973, Vol. 17:179-181.
405. Schaible S Maximization of Quasi-Concave Quotients and Products of Finitely Many Functionals. Cahiers du Centre d'Etudes de Recherche Operationnelle 1974, Vol. 16:45-53.
406. Schaible S Parameter-free Convex Equivalent and Dual Programs of Fractional Programming Problems. Zeitschrift fur Operations Research 1974, Band 18:187-196.
407. Schaible S Fractional Programming I, Duality. Management Science 1976, Vol. 22:858-867.
408. Schaible S Duality in Fractional Programming: a Unified Approach. Operations Research 1976, Vol. 24:452-461.
409. Schaible S Minimization of Ratios. J Optimization Theory and Applications 1976, Vol. 19:347-352.
410. Schaible S A Note on the Sum of a Linear and Linear-Fractional Function. Naval Research Logistics Quarterly 1977, Vol. 24:691-693.
411. Schaible S Fractional Programming: Applications and Algorithms. European J Operational Research 1981, Vol. 7:111-120.
412. Schaible S Bibliography in fractional programming. Zeitschrift für Operations Research 1982, Vol. 26:211-241.
413. Schaible S Bieriteria Quasi-Concave Programs. Cahiers du centre d'Etudes de Recherche Operationnelle 1983, Vol. 25:93-101.
414. Schaible S Fractional programming. Zeitschrift für Operations Research 1983, Vol. 27:39-54.
415. Schaible S Fractional Programming: Some Recent Developments. J Information and Optimization Sciences 1989, Vol. 10:1-14.
416. Schaible S, Ibraki T Fractional Programming. European J Operational Research 1983, Vol. 12:325-338.
417. Schaible S, Shi J Fractional programming: the Sum-of-Ratios Case. Management Science 2002, Vol. 48:1-15.
418. Schniederjans MJ Linear Goal Programming 1984, Petrocelli Books, Princeton, NJ.
419. Schniederjans MJ Goal Programming Methodology and Applications 1995, Kluwer Publishers, Boston.
420. Schroeder RG Linear Programming Solutions to Ratio Games. Operations Research 1970, Vol. 18:300-305.
421. Sengupta JK Stochastic Linear Programming with Chance-Constraints. Internat Econom Rev 1970, Vol. 11:287-304.
422. Sengupta JK Stochastic Programming: Methods and Applications 1972, North- Holland, Amsterdam.
423. Sengupta JK, Tintner G A Review of Stochastic Linear Programming. Rev Int Statist Inst 1971, Vol. 39:197-233.
424. Sharma IC, Swarup K On Duality in Linear Fractional Functionals Programming. Zeitschrift für Operations Research 1972, Vol. 16:91-100.
425. Shetty CM Solving Linear Programming Problems with Variable Parameters. J Industrial Engineering 1959, Vol. 10(6).
426. Shor NZ Cut-off Method with Space Extension in Convex Programming Problems. Kibernetika 1977, Vol. 1:94-95.
427. Cybernetics 1977, Vol. 13:94-96.
428. Simmonard M Linear Programming 1966, (translated by WS Jewell), Prentice- Hall, Englewood Cliffs, NJ.
429. Simon HA Dynamic Programming under Uncertainly with a Quadratic Function. Econometrica 1956, Vol. 24:74-81.
430. Simmons DM Nonlinear Programming for Operations Research 1975, Prentice- Hall, Englewood Cliffs, NJ.
431. Simmons GF Introduction to Topology and Modern Analysis 1963, McGraw- Hill Book Co, New York.
432. Singh C Nondifferentiable Fractional Programming with Hanson-Mond Classes of Functions. J Optimization Theory and Applications 1986, Vol. 49:431-447.
433. Singh C A Class of Multiple-Criteria Fractional Programming Problems. J Mathematical Analysis and Applications 1986, Vol. 115.
434. Sinha SM Stochastic Programming. PhD Thesis, Universiy of California, Berkley, Calif, January, 1963 1963, 121-122. McGraw- Hill Book Co. R.L. Graves, P. Wolfe (Eds.).
435. Sinha SM Stochastic Programming. Research Report, ORC 63-22 1963, August, Operations Research Center, University of California, Berkeley, Calif.
436. Sinha SM An Extension of a Theorem on Support of a Convex Function. Management Science 1966, Vol. 12:380-384.
437. Sinha SM A Duality Theorem for Nonlinear Programming. Management Science 1966, Vol. 12:385-390.
438. Sinha SM, Aylawadi DR Optimality Criteria for a Class of Nondifferentiable Mathematical Programs. Zamm 1982, Vol. 62.
439. Sinha SM, Aylawadi DR Optimality Conditions for a Class of Nondifferentiable Mathematical Programming Problems. Opsearch 1982, Vol. 19:225-237.
440. Sinha SM, Aylawadi DR Optimality Conditions for a Class of Nondifferentiable Fractional Programming Problems. Indian J Pure and Applied Mathematics 1983, Vol. 14:167-174.
441. Sinha SM, Bajaj CP The Maximum Capacity Route Through a Set of Specified Nodes. Cahiers du centre d'Etudes de Recherche Operationnelle 1969, Vol. 11:133-138.
442. Sinha SM, Bajaj CP The Maximum Capacity Route Through sets of Specified Nodes. Opsearch 1970, Vol. 7:96-114.
443. Sinha SM, Jain OP On Indefinite Programming Problems. Zeitschrift für Operations Research 1974, Band 18:41-45.
444. Sinha SM, Jha PC Interactive Goal Programming. Int J Management and Systems 1990, Vol. 6:129-138.
445. Sinha SM, Lal SS On Indefinite Quadratic Programming. J Mathematical Sciences 1968, Vol. 3:71-75.
446. Sinha SM, Swarup K Mathematical Programming: A Survey. J Mathematical Sciences 1967, Vol. 2:125-146.
447. Sinha SM, Tuteja GC On Fractional Programming. Opsearch 1999, Vol. 36:418-424.
448. Sinha SM, Wadhwa V Programming with a Special Class of Nonlinear Functionals. Unternehmensforchung 1970, Band 14:215-219.
449. Slater M Lagrange Multipliers Revisted: A Contribution to Nonlinear Programming. Mathematics 1950, 403.
450. Steuer RE Multiple Objective Linear Programming with Interval Criterion Weights. Management Science 1976, Vol. 23:305-316.
451. Steuer RE An Interactive Multiple Objective Linear Programming Procedure. TIMS Studies in the Management Sciences 1977, Vol. 6:225-239.
452. Steuer RE Goal Programming Sensitivity Analysis Using Interval Penalty Weights. Mathematical Programming 1979, Vol. 17:16-31.
453. Steuer RE Multiple Criteria Optimization: Theory, Computation and Application 1985, John Wiley & Sons, New York.
454. Steuer RE, Choo EU An Interactive Weighted Techebycheff Procedure for Multiple Objective Programming. Mathematical Programming 1983, Vol. 26:326-344.
455. Stiemke E Uber positive losungen homogener linearer Gleichungen. Mathematische Annalen 1915, Vol. 76:340-342.
456. Stigler GJ The Cost of Subsistence. J Farm Econ 1945, Vol. 27:303-314.
457. Stoer J Duality in Nonlinear Programming and the Minimax Theorem. Numerische Mathematik 1963, Vol. 5:371-379.
458. Swarup K Linear Fractional Functionals Programming. Operations Research 1965, Vol. 13:1029-1036.
459. Swarup K Programming with Quadratic Fractional Functionals. Opsearch 1965, Vol. 2:23-30.
460. Swarup K Some Aspects of Linear Fractional Functionals Programming. Australian Journal of Statistics 1965, Vol. 7:90-104.
461. Swarup K Contributions Pertaining to Indefinite Quadratic Programming. Opsearch 1966, Vol. 3:207-211.
462. Swarup K Programming with Indefinite Quadratic Function with Linear Constraints. Cahiers du Centre d'Etudes de Recherche Operationnelle 1966, Vol. 8:132-136.
463. Swarup K Indefinite Quadratic Programming. Cahiers du Centre d'Etudes de Recherche Operationnelle 1966, Vol. 8:217-222.
464. Swarup K Quadratic Programming. Cahiers du Centre d'Etudes de Recherche Operationnelle 1966, Vol. 8:223-233.
465. Swarup K Transportation Technique in Linear Fractional Programming. J Royal Naval Sci Ser 1966, Vol. 21:256-260.
466. Swarup K Indefinite Quadratic Programming with a Quadratic Constraint. Economick-Mathematicky Obzor 1968, Vol. 4:69-75.
467. Swarup K Duality in Fractional Programming. Unternehmensforschung 1968, Vol. 12:106-112.
468. Symonds GH Linear Programming: The Solution of Refinery Problems 1955, Esso Standard Oil Company, New York.
469. Taha HA Concave Minimization over a Convex Polyhedron. Naval Research Logistics Quarterly 1973, Vol. 20:533-548.
470. Tamiz M, Jones DF, El-Darzi A Review of Goal Programming and its Applications. Annals of Operations Research 1993, Vol. 58:39-53.
471. Tanabe K An Algorithm for the Constrained Maximization in Nonlinear Programming. J Operations Research Society of Japan 1974, Vol. 17:184-201.
472. Tardos E A Strongly Polynominal Algorithm to Solve Combinational Linear Programs. Operations Research 1986, Vol. 34:250-256.
473. Teterev AG On a Generalisation of Linear and Piecewise-Linear Programming. Matekon 1970, Vol. 6:246-259.
474. Theil H A Note on Certainty Equivalence in Dynamic Planning. Econometrica 1957, Vol. 25:346-349.
475. Theil H Some Reflections on Static Programming Under Uncertainty. Weltwirtschaftliches 1961, Vol. 87:124-138.
476. Theil H, Panne C van de Quadratic Programming as an Extension of Conventional Quadratic Maximization. Management Science 1961, Vol. 7:1-20.
477. Tintner G Stochastic Linear Programming with Applications to Agricultural Economics. Proceed Second Symposium in Linear Programming 1955, Washington. H.A. Antosiewicz (Ed.).
478. Tintner G A Note on Stochastic Linear Programming. Econometrica 1960, Vol. 28:490-495.
479. Tintner G, Millham C, Sengupta JK A Weak Duality Theorem for Stochastic Linear Programming. Unternechmensforschung 1963, Vol. 7:1-8.
480. Todd MJ Exploiting Special Structure in Karmarkar's Linear Programming Algorithm. Mathematical Programming 1988, Vol. 41:97-114.
481. Todd MJ, Burrell BP An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables. Algorithmica 1986, Vol. 1:409-424.
482. Tomlin JA An Experimental Approach to Karmarkar's Projective Method for Linear Programming 1985, Ketron Inc, Mountain View, CA 94040.
483. Topkis DM, Veinott AF On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming. SIAM J Control 1967, Vol. 5:268-279.
484. Tucker AW Linear and Nonlinear Programming. Operations Research 1957, Vol. 5:244-257.
485. Tucker AW Dual Systems of Homogenous Linear Relations 1956, (292).
486. Tuteja GC A Note on Programming with a Nonlinear Fractional Program. J Decision and Mathematika Sciences 1999, Vol. 4:77-82.
487. Tuteja GC Programming With the Sum of a Linear and Quotient Objective Function. Opsearch 2000, Vol. 37:177-180.
488. Tuteja GC on Mathematical Programming. PhD Thesis 2003, February, University of Delhi, Delhi.
489. Uzawa H The Kuhn-Tucker Theorem in Concave Programming 1958, [16].
490. Uzawa H The Gradient Method for Concave Programming, II, Global results 1958, [16].
491. Uzawa H Iterative Methods for Concave Programming 1958, [16].
492. Vajda S Mathematical Programming 1961, Addison-Wesley, Reading, Mass.
493. Vajda S Nonlinear Programming and Duality 1967, [1].
494. Vajda S Stochastic Programming 1970, [3].
495. Vajda S Probablistic Programming 1972, Academic Press, New York.
496. Vajda S Theory of Linear and Nonlinear Programming 1974, Longman, London.
497. Vajda S Tests of Optimality in Constrained Optimization. J Institute of Mathematics and its Applications 1974, Vol. 13:187-200.
498. Veinott AF The Supporting Hyperplane Method for Unimodal Programming. Operations Research 1967, Vol. 15:147-152.
499. vön Neumann J Zur Theoric der Gesellshaftspiele. Mathematische Annalen 1928, Vol. 100:295-320.
500. vön Neumann J Uber ein okonomisches Gleichungssystem und ein Verallgemeinerung des Brouwerschen Fixpunktsatzes. Ergebnisse eines Mathematischen Kolloquiums 1937, (8).
501. vön Neumann J A Model of General Economic Equilibrium. Rev Econ Studies 1945, Vol. 13:1-9. English translation, 1946.
502. vön Neumann J, Morgenstern O Theory of Games and Economic Behavior 1953, Princeton University Press, Princeton, NJ. 3rd ed.
503. Wadhwa V Programming with Separable Fractional Functionals. J Mathematical Sciences 1969, Vol. 4:51-60.
504. Wadhwa V On Some Specialized Problems in Mathematical Programming. Ph D Thesis 1972, January, Unversity of Delhi, Delhi.
505. Wadhwa V Linear Fractional Programs with Variable Coefficients. Cahiers du centre d' Etudes de Recherche Operationnelle 1972, Vol. 14:223-232.
506. Wadhwa V Parametric Linear Fractional Programming. SCIMA; Journal of Management Sciences and Applied Cybernetics 1974, Vol. 3:21-29.
507. Wagner HM The Dual Simplex Algorithms for Bounded Variables. Naval Research Logistics Quarterly 1958, Vol. 5:257-261.
508. Wagner HM On the Distribution of Solutions in Linear Programming Problems. J American Statistical Association 1958, Vol. 53:161-163.
509. Wagner HM On a Class of Capaciated Transportation Problems. Management Science 1959, Vol. 5:304-318.
510. Wagner HM Principles of Operations Research with Applications to Managerial Decisions 1969, Prentice Hall, Englewood Cliffs, NJ.
511. Wagner HM, Yuan JSC Algorithmic Equivalence in Linear Fractional Programming. Management Science 1968, Vol. 14:301-306.
512. Walras L Elements of Pure Economics or the Theory of Social Wealth 1954, Translated by W. Jaffe, Allen and Unwin, London.
513. Wegner P A Nonlinear Extension of the Simplex Method. Management Science 1960, Vol. 7:43-55.
514. Wets RJB Programming Under Uncertainty: The Equivalent Convex Program. SIAM J Applied Mathematics 1966, Vol. 14:89-105.
515. Wets RJB Programming Under Uncertainty: The Complete Problem. Z Wahrswcheinlichkeits Theorie und Verwandte, Gebiete 1966, 4:316-339.
516. Wets RJB Characterisation Theorems for Stochastic Programs. Mathematical Programming 1972, Vol. 2:166-175.
517. Wets RJB Stochastic Programs with Recourse: A Basic Theorem for Multistage Problems. Z Wahrswcheinlichkeits Theorie und Verwandte Gebiete 1972, 21:201-206.
518. Wets RJB Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Problem. SIAM Review 1974, Vol. 16:309-339.
519. Wets RJB Solving Stochastic Programs with Simple Recourse II. Proceed John Hopkins Symposium on System and Information Science 1975, John Hopkins University, Baltimore.
520. Wets RJB Duality Relations in Stochastic Programming. Symposia Mathe. Atica 1976, 19. Academic Press, New York.
521. Wets RJB Stochastic Programs with Chance Constraints: Generalized Convexity and Approximation Issues. Generalized Convexity, Generalized Monotonicity: Recent Results 1998, Kluwer, Dordrecht. J.P. Crouzeix, J.E. Martinez-Legaz, M. Voile (Eds.).
522. Whinston A A Dual Decomposition Algorithm for Quadratic Programming. Cahiers du Centre d'Etudes de Recherche Operationnelle 1964, Vol. 6:188-201.
523. Whinston A Conjugate Functions and Dual Programs. Naval Research Logistics Quarterly 1965, Vol. 12:315-322.
524. Whinston A Some Applications of the Conjugate Function Theory to Duality 1967, [1].
525. White DJ Dynamic Programming 1969, Oliver & Boyd, London.
526. White DJ A Linear Programming Analogue, a Duality Theorem and a Dynamic Algorithm. Management Science 1974, Vol. 21:47-59.
527. White WB, Johnson SM, Dantzig GB Chemical Equilibrium in Complex Mixtures. J. Chem Physics 1958, Vol. 28:751-755.
528. Wilde DJ Optimum Seeking Methods 1964, Prentice-Hall, Englewood Chiffs, New Jersey.
529. Williams AC A Treatment of Transportation Problems by Decomposition. SIAM J 1962, Vol. 10:35-48.
530. Williams AC A Stochastic Transportation Problems. Operations Research 1963, Vol. II:759-770.
531. Williams AC On Stochastic Linear Programming. SIAM J Applied Mathematics 1965, Vol. 13:927-940.
532. Williams AC Approximation Formulas for Stochastic Linear Programming. SIAM J Applied Mathematics 1966, Vol. 14:668-677.
533. Williams AC Complementary Theorems for Linear Programming. SIAM Review 1970, Vol. 12:135-137.
534. Williams AC Nonlinear Activity Analysis. Management Science 1970, Vol. 17:127-139.
535. Wilson R On Programming Under Uncertainty. Operations Research 1966, Vol 14:652-657.
536. Optimization Methods for Large Scale Systems 1971, McGraw- Hill Book Co, New York. D.A. Wismer (Ed.).
537. Wolfe P The Simplex Method for Quadratic Programming. Econometrica 1959, Vol. 27:382-398.
538. Wolfe P A Duality Theorem for Nonlinear Programming. Quarterly of Applied Mathematics 1961, Vol. 19:239-244.
539. Wolfe P Some Simplex-like Nonlinear Programming Procedures. Operations Research 1962, Vol 10:438-447.
540. Wolfe P Methods of Nonlinear Programming 1963, [211].
541. Wolfe P A Technique for Resolving Degeneracy in Linear Programming. SIAM J 1963, Vol. 11:205-211.
542. Wolfe P The Composite Simplex Algorithm. SIAM Review 1965, Vol. 7.
543. Wolfe P Methods of Nonlinear Programming 1967, [1].
544. Wolfe P Convergence, Theory in Nonlinear Programming 1970, [3].
545. Wolfe P On the Convergence of Gradient Methods Under Constraint. IBMJ Research and Development 1972, Vol. 16:407-411.
546. Wolfe P A Method of Conjugate Subgradients for Minimizing Nondifferentiable functions 1975, [25].
547. Wright SJ An Infeasible-Interior-Point Algorithm for Linear Complementarity Problems. Mathematical Programming 1994, Vol. 67:29-51.
548. Wright SJ Primal-Dual-Interior-Point Methods 1997, SIAM, Philadelphia.
549. Ye Y Karmarkar's Algorithm and the Ellipsoid Method. Operations Research Letters 1987, 6:177-182.
550. Ye Y A Class of Projective Transformations for Linear Programming. SIAM J Computing 1990, Vol. 19:457-466.
551. Ye Y On an Affine Scaling Algorithm for Nonconvex Quadratic Programming. Mathematical Programming 1992, Vol. 52:285-300.
552. Ye Y A Potential Reduction Algorithm Allowing Column Generation. SIAM J Optimization 1992, Vol. 2:7-20.
553. Ye Y Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming. Mathematics of Operations Research 1994, Vol. 19:38-52.
554. Ye Y Interior Point Algorithms: Theory and Analysis 1997, John Wiley & Sons, New York.
555. Ye Y, Kojima M Recovering Optimal Dual Solutions in Karmarkar's Polynomial Algorithm for Linear Programming. Mathematical Programming 1987, Vol. 39:305-317.
556. Ye Y, Tse E An Extension of Karmarkar's Projective Algorithm for Convex Quadratic Programming. Mathematical Programming 1989, Vol. 44:157-179.
557. Yu PL, Zeleny M The Set of all Nondominated Solutions in Linear Cases and a Multicriteria simplex method. J Math Analysis and Applications 1975, Vol 49:430-468.
558. Zangwill WI The Convex Simplex Method. Management Science 1967, Vol. 14:221-283.
559. Zangwill WI Minimising a Function without Calculating Derivatives. Computer Journal 1967, Vol. 10:293-296.
560. Zangwill WI Nonlinear Programming via Penalty Functions. Management Science 1967, Vol. 13:344-358.
561. Zangwill WI The Piecewise Concave Function. Management Science 1967, Vol. 13:900-912.
562. Zangwill WI A Decomposable Nonlinear Programming Approach. Operations Research 1967, Vol. 15:1068-1087.
563. Zangwill WI Nonlinear Programming: A Unified Approach 1969, Prentice-Hall, Englewood Cliffs, NJ.
564. Zeleny M Linear Multi-Objective Programming. Lecture Notes in Economics and Mathematical Systems No 95 1974, Springer-Verlag, Berlin.
565. Multiple Criteria Decision Making: Kyoto 1975. Lecture Notes in Economics and Mathematical systems No 123 1976, Springer-Verlag, Berlin. M. Zelleny (Ed.).
566. Zeleny M Multiple Criteria Decision Making 1982, McGraw-Hill Book Co, New York.
567. Zellner A Linear Regression with Inequality Constraints on the Coefficients: An Application of Quadratic Programming and Linear Decision Rules. Report No 6109 1961, Econ Inst Netherlands School of Economics, Rotterdam.
568. Ziemba WT Computational Algorithms for Convex Stochastic Programs with Simple Recourse. Operations Research 1970, Vol. 18:414-431.
569. Ziemba WT Transforming Stochastic Dynamic Programming Problems into Nonlinear Programs. Management Science 1971, Vol. 17:450-462.
570. Ziemba WT Duality Relations, Certainty Equivalents and Bounds for Convex Stochastic Programs with Simple Recourse. Cahiers du Centre d' Etudes de Recherche Operationnelle 1971, Vol. 13:85-97.
571. Ziemba WT Stochastic Programs with Simple Recourse. Mathematical Programming in Theory and Practice 1974, North-Holland, Amsterdam. P.L. Hammer, G. Zoutendijk (Eds.).
572. Ziemba WT, Parkan C, Brooks-Hill R Calculation of Investment Portfolios with Risk Free Borrowing and Lending. Management Science 1974, Vol. 21:209-222.
573. Zimmerman HJ Fuzzy Programming and Linear Programming with Several Objective Functions. Fuzzy Sets and Systems 1978, Vol. 1:45-56.
574. Zionts S Programming with Linear Fractional Functions. Naval Research Logistics Quarterly 1968, Vol. 15:449-452.
575. Zionts S A Survey of Multiple Criteria Integer Programming Methods. Annals of Discrete Mathematics 1979, Vol. 5:389-398.
576. Zoutendijk G Methods of Feasible Directions 1960, Elsevier, Amsterdam.
577. Zoutendijk G Nonlinear Programming: A Numerical Survey. SIAM J Control 1966, Vol. 4:194-210.
578. Zoutendijk G Mathematical Programming Methods 1976, North Holland, Amsterdam.
579. Zwart PB Nonlinear Programming: Global Use of the Lagrangian. J Optimization Theory and Applications 1970, Vol. 6:150-160.
580. Zwart PB Nonlinear Programming - The Choice of Direction by Gradient Projection. Naval Research Logistics Quarterly 1970, Vol. 17:431-438.
581. Zwart PB Global Maximization of a Convex Function with Linear Inequality Constraints. Operations Research 1974, Vol. 22:602-609.