Advertisement

Theorems of the alternative and optimality conditions

  • F. Giannessi
Contributed Papers

Abstract

A theorem of the alternative is stated for generalized systems. It is shown how to deduce, from such a theorem, known optimality conditions like saddle-point conditions, regularity conditions, known theorems of the alternative, and new ones. Exterior and interior penalty approaches, weak and strong duality are viewed as weak and strong alternative, respectively.

Key Words

Theorems of the alternative optimality conditions regularity conditions constraints qualification separation theorems Lagrangian functions penalty functions duality 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dubovitskii, A. Y., andMilyutin, A. A.,The Extremum Problem in the Presence of Constraints, Doklady Akademii Nauk SSSR, Vol. 149, pp. 759–762, 1963.Google Scholar
  2. 2.
    Bair, J., Sur la Séparation de Familles Fines d'Ensembles Convexes, Bulletin de la Societé Royal des Sciences, Liège, Vol. 41, pp. 281–291, 1972.Google Scholar
  3. 3.
    Tind, J., andWolsey, L. A.,An Elementary Survey of General Duality Theory, Mathematical Programming, Vol. 21, pp. 241–261, 1981.Google Scholar
  4. 4.
    Giannessi, F.,Theorems of Alternative, Quadratic Programs, and Complementarity Problems, Variational Inequalities and Complementarity Problems, Edited by R. W. Cottle, F. Giannessi, and J. L. Lions, John Wiley and Sons, New York, New York, pp. 151–186, 1980.Google Scholar
  5. 5.
    Bazaraa, M. S.,A Theorem of the Alternative with Applications to Convex Programming: Optimality, Duality, and Stability, Journal of Mathematical Analysis and Applications, Vol. 41, pp. 701–715, 1973.Google Scholar
  6. 6.
    Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill, New York, New York, 1969.Google Scholar
  7. 7.
    Eisenberg, E.,On Cone Functions, Recent Advances in Mathematical Programming, Edited by P. Wolfe and R. L. Graves, McGraw-Hill, New York, New York, pp. 27–33, 1963.Google Scholar
  8. 8.
    Ben-Israel, A., Ben-Tal, A., andZlobec, S.,Optimality in Nonlinear Programming. A Feasible Directions Approach, John Wiley and Sons, New York, New York, 1981.Google Scholar
  9. 9.
    Gould, F. J.,Nonlinear Pricing: Applications to Concave Programming, Operations Research, Vol. 19, pp. 1026–1035, 1971.Google Scholar
  10. 10.
    Gould, F. J.,Extensions of Lagrange Multipliers in Nonlinear Programming, SIAM Journal on Applied Mathematics, Vol. 17, pp. 1280–1297, 1969.Google Scholar
  11. 11.
    Rockafellar, R. T.,Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming, SIAM Journal on Control, Vol. 12, pp. 268–283, 1974.Google Scholar
  12. 12.
    Rockafellar, R. T.,Penalty Methods and Augmented Lagrangians in Nonlinear Programming, Proceedings of the 5th Conference on Optimization Techniques, Springer-Verlag, Berlin, Germany, pp. 418–425, 1973.Google Scholar
  13. 13.
    Han, S. P., andMangasarian, O. L.,Exact Penalty Functions in Nonlinear Programming, Mathematical Programming, Vol. 17, pp. 251–269, 1979.Google Scholar
  14. 14.
    Fiacco, A. V., andMcCormick, G. P.,Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.Google Scholar
  15. 15.
    McLinden, L.,Duality Theorems and Theorems of the Alternative, Proceedings of Annals of Mathematical Society, Vol. 53, pp. 172–175, 1975.Google Scholar
  16. 16.
    Everett, H.,Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources, Operations Research, Vol. 11, pp. 399–417, 1963.Google Scholar
  17. 17.
    Ben-Israel, A., Charnes, A. andKortanek, K. O.,Asymptotic Duality over Closed Convex Sets, Journal of Mathematical Analysis and Applications, Vol. 35, pp. 677–691, 1981.Google Scholar
  18. 18.
    Magnanti, T. L.,Fenchel and Lagrange Duality Are Equivalent, MathematicalGoogle Scholar

Copyright information

© Plenum Publishing Corporation 1984

Authors and Affiliations

  • F. Giannessi
    • 1
  1. 1.Department of Mathematics, Faculty of SciencesUniversity of PisaPisaItaly

Personalised recommendations