Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Balas. A note on duality in disjunctive programming, Journal of Opti mization Theory and Applications, 21:523–528, 1977.
E. Balas. Disjunctive programming, Annals of Discrete Mathematics, 5:3–51, 1979.
E. Balas. Disjunctive programming: properties of the convex hull of feasible points, MSSR, N 348, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1974.
E. Balas, J. M. Tama, and J. Tind. Sequential convexification in reverse con vex and disjunctive programming, Mathematical Programming, 44A:337–350, 1989.
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.
I. I. Eremin. About penalty method in convex programming, Kibernetika, 4:63–67, 1967.
I. I. Eremin. About some problems of disjunctive programming, Yugoslav Journal of Operations Research, 8:25–43, 1998.
I. I. Eremin. Theory of Linear Optimization, Eketerinburg publisher, Russia, 1999.
S. Helbig. Optimality criteria in disjunctive optimization and some appli cations, Methods of Operations Research, 62:67–78, 1990.
S. Helbig. Stability in disjunctive programming I: continuity of the feasible set, Optimization, 21:855–869, 1990.
S. Helbig. Duality in disjunctive programming via vector optimization, Mathematical Programming, 65A:21–41, 1994.
S. Helbig. Stability in disjunctive programming II: continuity of the fea sible and optimal set, Optimization, 31:63–93, 1994.
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.
V. Patcar, and Stancu-Minasian, I. M.. Duality in disjunctive linear frac tional programming, European Journal of Operations Research, 21:101–105, 1985.
H.D. Sherali, and C. M. Shetty. Optimization with Disjunctive Constraints, Springer-Verlag, 1980.
F. Zafiridou. Parametrische disjunctive lineare Optimierung, Diplom-The-sis, Frankfurt/Main, 1988.
W.I. Zangwill. Non-linear programming via penalty functions, Management Science, 13A:344–358, 1967.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Eremin, I.I. (2001). About Disjunctive Optimization. In: Goberna, M.Á., López, M.A. (eds) Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3403-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3403-4_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5204-2
Online ISBN: 978-1-4757-3403-4
eBook Packages: Springer Book Archive