Feasible direction methods in the absence of slater's condition

References

• Abrams , R.A. and Kerzner , L. A simplified test for optimality . J. OptimizationTheory Appl , forthcoming
   Google Scholar
• Ben-Israel , A. , Ben-Tal , A. and Charnes , A. 1977 . Necessary and sufficient conditions for a Pareto-optimum in convex programming . Econometrics , 45 : 811 – 820 .
   Google Scholar
• Ben-Israel , A. , Ben-Tal , A. and Zlobec , S. 1976 . Optimality conditions in convex programming . Proceedings of the IX International Symposium on Mathematical Programming . 1976 , Budapest, Hungary. forthcoming
   Google Scholar
• Ben-Tal , A. , Ben-Israel , A. and Zlobec , S. 1976 . Characterization of optimality in convex programming without a constraint qualification . J. Optimization Theory Appl , 20 : 417 – 437 .
   Google Scholar
• Ben-Tal , A. and Zlobec , S. 1977 . Convex programming and lexicographic multicriteria problems . Math. Operationsforsch. Statist., Series Optimization , 8 ( 1 ) : 61 – 73 .
   Google Scholar
• Ben-Tal A. Zlobev S. A new class of feasible direction methods. Center for Cybernetic Studies The University of Texas Austin, Texas Report CCS 216 (February 1975, recised September 1977).
   Google Scholar
• Dempster , M.A.H. and Wets , R.J.-B . June 1975 . “ On regularity condition in constrained optimization ” . June , Stanford, California : Center for Advanced Study in the Behavioral Sciences .
   Google Scholar
• Gass , S.L. 1975 . Linear Programming: Methods and Applications , New York : McGraw-Hill .
   Google Scholar
• Gehner , K.R. 1975 . Characterization theorems for constrained approximation problems via optimization theory . J. Approximation Theory , 14 : 51 – 76 .
   Web of Science ®Google Scholar
•  Google Scholar
•  Google Scholar
• Kuhn , W.H. and Tucker , A.W. Nonlinear programming . Proceedings of the econd Berkeley Symposium on Mathematical Statistics and Probability . Edited by: Neyman , J. California : University of California Berkeley .
   Google Scholar
• Kuhn , W.H. 1976 . “ Nonlinear programming: a historical view ” . In Nonlinear Programming , Edited by: Cottle , R.W. and Lemke , C.E. Providence, , Rhode Island : American Mathematical Society .
   Google Scholar
• Luenberger , D.G. 1973 . Introduction to Linear and Nonlinear Programming , Reading, Massachusetts : Addison- Wesley .
   Google Scholar
• Mangasarian , O. 1969 . Nonlinear Programming , New York : McGraw-Hill .
   Google Scholar
•  Google Scholar
• Rockafellar , R.T. 1970 . Convex Analysis , Princeton, New Jersey : Princeton University Press .
   Google Scholar
• Zangwill , W.I. 1969 . Nonlinear Programming: A Unified Approach , Englewood Cliffs, N. J : Prentice-Hall .
   Google Scholar
• Zoutendijk , G. 1960 . Method of Feasible Directions , Amsterdam : Elsevier .
   Google Scholar
• Zoutendijk , G. 1976 . Mathematical Programming Methods , Amsterdam : North-Holland .
   Google Scholar
•  Google Scholar