|
This article is cited in 1 scientific paper (total in 1 paper)
The set of target vectors in a problem of semi-infinite linear programming with a duality gap
N. N. Astaf'eva, A. V. Ivanovb, S. P. Trofimovb a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
b Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
Abstract:
We propose a geometric method for the analysis of duality relations in a pair of semi-infinite linear programming (SILP) problems. The method is based on the use of the conical hull of the coefficients in the constraint system. A relation between the presence of a duality gap and the nonclosedness of the boundary of the conical hull of points in a multidimensional space is established. The geometric approach is used to construct an opposite pair of dual problems and to explore the duality relation for this pair. We construct a nontrivial example of a SILP problem in which the duality gap occurs for noncollinear target vectors.
Keywords:
semi-infinite linear programming, duality gap, geometric approach, convex nonclosed cone, set of target vectors.
Received: 20.06.2016
Citation:
N. N. Astaf'ev, A. V. Ivanov, S. P. Trofimov, “The set of target vectors in a problem of semi-infinite linear programming with a duality gap”, Trudy Inst. Mat. i Mekh. UrO RAN, 22, no. 4, 2016, 43–52; Proc. Steklov Inst. Math. (Suppl.), 304, suppl. 1 (2019), S14–S22
Linking options:
https://www.mathnet.ru/eng/timm1352 https://www.mathnet.ru/eng/timm/v22/i4/p43
|
Statistics & downloads: |
Abstract page: | 292 | Full-text PDF : | 86 | References: | 41 | First page: | 8 |
|