References
- Abrams , R. and Kerzner , L. A simplified test for optimality . J. Optimiz. Th. Appl. , forthcoming
- Ben-Israel , A. , Ben-Tal , A. and Charnes , A. 1977 . Necessary and sufficient conditions for a Pareto-optimum in convex programming . Econometrica , 45 : 811 – 820 .
- Ben-Tal , A. , Ben-Israel , A. and Zlobec , S. 1976 . Characterization of optimality in convex programming without a constraint qualification . J. Optimiz. Th. Appl. , 20 : 417 – 437 .
- Dubovitskii , A. Ya. and Milyutin , A. A. 1963 . The extremum problems in the presence of constraints . Dokl. Akad. Nank SSSR 149 , 4 : 759 – 762 .
- Fiacco , A. V. and McCormick , G. P. 1968 . Nonlinear Programming: Sequential Unconstrained Minimization Techniques , New York : J. Wiley .
- Geoffrion , A. M. 1971 . Duality in nonlinear programming: A simplified applications-oriented development . SIAM Review , 13 : 1 – 37 .
- Girsanov , I. V. 1972 . Lectures on Mathematical Theory of Extremum Problems , 136 Springer-Verlag .
- Hestenes , M. R. 1975 . “ Optimization Theory: The Finite Dimensional Case ” . New York : Wiley-Interscience .
- Holmes , R. B. 1975 . Geometric Functional Analysis and its Applications , New York : Springer-Verlag .
- Kuhn , H. W. and Tucker , A. W. 1951 . “ Nonlinear programming ” . In Proceedings of the Second Berkley Symposium on Mathematical Statistics and Probability , Edited by: Neyman , J. 481 – 492 . Berkeley : University of California Press .
- Mangasarian , O. L. 1969 . Nonlinear Programming , New York : McGraw-Hill .
- Pshenichny , B. N. 1971 . Necessary Conditions for an Extremum , Vol. 18 , 230 New York : Marcel Dekker .
- Rockafellar , R. T. 1970 . Convex Analysis , Vol. 18 , 451 Princeton, New Jersey : Princeton University Press .
- Rockafellar , R. T. 1970 . “ Some convex programs whose duals are linearly constrained ” . In Nonlinear Programming , Edited by: Rosen , J. B. , Mangasarian , O. L. and Ritter , K. New York : Academic Press .
- Zoutendijk , G. 1960 . Methods of Feasible Directions , Amsterdam : Elsevier .