Solvability and Primal-dual Partitions of the Space of Continuous Linear Semi-infinite Optimization Problems



Document title: Solvability and Primal-dual Partitions of the Space of Continuous Linear Semi-infinite Optimization Problems
Journal: Computación y sistemas
Database:
System number: 000560150
ISSN: 1405-5546
Authors: 1
1
2
Institutions: 1Benemérita Universidad Autónoma de Puebla, Puebla. México
2Universidad de las Américas Puebla, Cholula, Puebla. México
Year:
Season: Abr-Jun
Volumen: 22
Number: 2
Pages: 315-329
Country: México
Language: Inglés
Document type: Artículo
English abstract Different partitions of the parameter space of all linear semi-infinite programming problems with a fixed compact set of indices and continuous right and left hand side coefficients have been considered in this paper. The optimization problems are classified in a different manner, e.g., consistent and inconsistent, solvable (with bounded optimal value and nonempty optimal set), unsolvable (with bounded optimal value and empty optimal set) and unbounded (with infinite optimal value). The classification we propose generates a partition of the parameter space, called second general primal-dual partition. We characterize each cell of the partition by means of necessary and sufficient, and in some cases only necessary or sufficient conditions, assuring that the pair of problems (primal and dual), belongs to that cell. In addition, we show non emptiness of each cell of the partition and with plenty of examples we demonstrate that some of the conditions are only necessary or sufficient. Finally, we investigate various questions of stability of the presented partition.
Disciplines: Ciencias de la computación
Keyword: Programación
Keyword: Linear semi-infinite programming,
Parameter space of continuous problems,
Primal-dual partition,
Stability properties,
Programming
Full text: Texto completo (Ver HTML) Texto completo (Ver PDF)