Convex programming and the lexicographic multicriteria problem

References

• Bazaraa , M.S. , Goode , J.J. and Nashed , M.Z. 1974 . On the Cones of Tangents With Applications to Mathematical Programming . J. Optimization Theory Appl , 13 : 389 – 426 .
   Web of Science ®Google Scholar
• Ben-Tal , A. , Ben-Israel , A. and Zlobec , S. 1974 . Characterization of Optimaiity m Convex Programming Without a Constraint Qualification . J. Optimization Theory App , 13 to appear
   Google Scholar
• Ben-Tal , A. February . “ A New Class of Feasible Direction Methods ” . In Center for Cybernetic Studies , February , Austin, Texas : The University of Texas . report No. 216
   Google Scholar
• Ben-Tal , A. and Charnes , A. February 1975 . “ Primal and Dual Optimality Criteria in Convex Programming ” . In Center for Cybernetic Studies , February , Austin, Texas : The University of Texas . report No. 221
   Google Scholar
• Charnes , A. and Kortanek , K.O. On Classes of Convex Preemptive Nuclei for Y-Person Game . Proceddings of the Princeton Symp. On Math Programming . pp. 377 – 390 . Princeton, N.J : Princeton University Press .
   Google Scholar
• Duffin , R.J. 1956 . “ Infite Programs In: Linear Inequalities and Relaterst Systems ” . In Annals of Math , Edited by: Kuhn , H.W. and Tucker , A.W. 157 – 170 . Princeton, N.J : Princeton University Press . Stud. No. 38
   Google Scholar
• Facco , A.V. and McCormick , G.P. 1968 . Nonlinear Programming: Sequential Uncon-strained Minimization Techniques , New York : John Wiley and Sons .
   Google Scholar
• Girsanov , I.V. 1972 . “ Lectures on Mathematical Theory of Extremum Problems ” . In Lecture Notes in Economics and Mathematical Systems , Vol. 67 , New York : Springer-Verlag .
   Google Scholar
• Lebedev , B. , Podinovskii , V.V. and Styrikovic , R.S. 1971 . An Optimization Problem with Respect to the Ordered Totality of Criteria . Ekonom. i Mat. Metody , 7 : 612 – 616 .
   Google Scholar
• Magasabian , O.L. 1969 . Nonlinear Programming , New York : McGraw-Hill .
   Google Scholar
• Podinovskii , V.V. 1972 . Lexicographic Problems of Linear Programming . Vycislit Z. Mat. i Mat. Fiz , 12 : 1568 – 1571 .
   Google Scholar
• Slater , M. 1950 . Lagrange Multipliers Revisited A Contribution to Nonlinear Pro-gramming . Cowles Commission Discussion Paper, Mathematics , 403
   Google Scholar
• Rockafellar , R.T. 1971 . Ordinary Convex Programs Without a Duality Gap . J. Opti-mization Theorem Appl , 7 ( 3 ) : 143 – 148 .
   Google Scholar
• Yu , P.L. Domination Structures and Nondominated Solutions . Proceedings of the International Seminar On Multiple Criteria Decision Making held at CISM . Berlin, Italy. June , Springer-Yerlag .
   Google Scholar
• Zangwill , W.I. 1969 . Nonlinear Programming A Unified Approach , Englewood Cliffs, N.J : Prentice Hall .
   Google Scholar
• Zoutendijk , G. 1960 . “ Methods of Feasible Directions ” . In a Study in Linear and Non-Linear Programming , New York : Elsevier .
   Google Scholar