Lexicographic regularization and duality for improper linear programming problems

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 bas...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the Steklov Institute of Mathematics Jg. 295; H. Suppl 1; S. 131 - 144
Hauptverfasser: Popov, L. D., Skarin, V. D.
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: Moscow Pleiades Publishing 01.12.2016
Springer Nature B.V
Schlagworte:
Linear programming
Mathematics
Mathematics and Statistics
Numerical stability
Regularization
generalized solutions
linear programming
improper problems
penalty methods
duality
regularization
ISSN:0081-5438, 1531-8605
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
ObjectType-Feature-2
SourceType-Conference Papers & Proceedings-1
content type line 22
ISSN:0081-5438
1531-8605
DOI:10.1134/S0081543816090145