|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2015, Volume 21, Number 3, Pages 279–291
(Mi timm1219)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Lexicographic regularization and duality for improper linear programming problems
L. D. Popovab, V. D. Skarinab a Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg
b Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
Abstract:
A new approach to the optimal lexicographic correction of improper linear programming problems is proposed. The approach is based on the multistep regularization of the classical Lagrange function with respect to primal and dual variables simultaneously. The regularized function can be used as a basis for generating new duality schemes for problems of this kind. Theorems on the convergence and numerical stability of the method are presented, and an informal interpretation of the obtained generalized solution is given.
Keywords:
linear programming, duality, improper problems, generalized solutions, regularization, penalty methods.
Received: 11.03.2015
Citation:
L. D. Popov, V. D. Skarin, “Lexicographic regularization and duality for improper linear programming problems”, Trudy Inst. Mat. i Mekh. UrO RAN, 21, no. 3, 2015, 279–291; Proc. Steklov Inst. Math. (Suppl.), 295, suppl. 1 (2016), 131–144
Linking options:
https://www.mathnet.ru/eng/timm1219 https://www.mathnet.ru/eng/timm/v21/i3/p279
|
Statistics & downloads: |
Abstract page: | 286 | Full-text PDF : | 76 | References: | 65 | First page: | 15 |
|