About Disjunctive Optimization
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  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.
KeywordsSaddle Point Dual Relation Saddle Point Problem Exact Penalty Function Disjunctive Programming
Unable to display preview. Download preview PDF.
- E. Balas. Disjunctive programming: properties of the convex hull of feasible points, MSSR, N 348, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1974.Google Scholar
- I. I. Eremin. Theory of Linear Optimization, Eketerinburg publisher, Russia, 1999.Google Scholar
- F. Zafiridou. Parametrische disjunctive lineare Optimierung, Diplom-The-sis, Frankfurt/Main, 1988.Google Scholar