About Disjunctive Optimization

  • Ivan I. Eremin
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 57)


In this paper we investigate the problems of disjunctive programming with an infinite array of components forming a feasible set (as their union). The investigation continues a theme of the author’s article [7] and describes original conceptual approach to a) analysis of a saddle point problem for disjunctive Lagrangian functions, b) analysis of dual relations for disjunctive programming problems, and c) technique of equivalent (with respect to argument) reduction of such problems to the problems of unconstrained optimization.


Saddle Point Dual Relation Saddle Point Problem Exact Penalty Function Disjunctive Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Balas. A note on duality in disjunctive programming, Journal of Opti mization Theory and Applications, 21:523–528, 1977.MathSciNetzbMATHCrossRefGoogle Scholar
  2. [2]
    E. Balas. Disjunctive programming, Annals of Discrete Mathematics, 5:3–51, 1979.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    E. Balas. Disjunctive programming: properties of the convex hull of feasible points, MSSR, N 348, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1974.Google Scholar
  4. [4]
    E. Balas, J. M. Tama, and J. Tind. Sequential convexification in reverse con vex and disjunctive programming, Mathematical Programming, 44A:337–350, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    J. M. Borwein. A strong duality theorem for the minimum of a family of convex programs, Journal of Optimization Theory and Applications, 31:453–472, 1980.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    I. I. Eremin. About penalty method in convex programming, Kibernetika, 4:63–67, 1967.MathSciNetGoogle Scholar
  7. [7]
    I. I. Eremin. About some problems of disjunctive programming, Yugoslav Journal of Operations Research, 8:25–43, 1998.MathSciNetzbMATHGoogle Scholar
  8. [8]
    I. I. Eremin. Theory of Linear Optimization, Eketerinburg publisher, Russia, 1999.Google Scholar
  9. [9]
    S. Helbig. Optimality criteria in disjunctive optimization and some appli cations, Methods of Operations Research, 62:67–78, 1990.MathSciNetGoogle Scholar
  10. [10]
    S. Helbig. Stability in disjunctive programming I: continuity of the feasible set, Optimization, 21:855–869, 1990.MathSciNetzbMATHCrossRefGoogle Scholar
  11. [11]
    S. Helbig. Duality in disjunctive programming via vector optimization, Mathematical Programming, 65A:21–41, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  12. [12]
    S. Helbig. Stability in disjunctive programming II: continuity of the fea sible and optimal set, Optimization, 31:63–93, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  13. [13]
    H.Th. Jongen, J.-J. Rückmann, and O. Stein. Disjunctive optimization: critical point theory, Journal of Optimization Theory and Applications, 93:321–336, 1997.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14]
    V. Patcar, and Stancu-Minasian, I. M.. Duality in disjunctive linear frac tional programming, European Journal of Operations Research, 21:101–105, 1985.CrossRefGoogle Scholar
  15. [15]
    H.D. Sherali, and C. M. Shetty. Optimization with Disjunctive Constraints, Springer-Verlag, 1980.zbMATHCrossRefGoogle Scholar
  16. [16]
    F. Zafiridou. Parametrische disjunctive lineare Optimierung, Diplom-The-sis, Frankfurt/Main, 1988.Google Scholar
  17. [17]
    W.I. Zangwill. Non-linear programming via penalty functions, Management Science, 13A:344–358, 1967.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Ivan I. Eremin
    • 1
  1. 1.Department of Mathematical ProgrammingInstitute of Mathematics and MechanicsEkaterinburgRussia

Personalised recommendations