Lexicographic regularization and duality for improper linear programming problems

DOI10.1134/S0081543816090145zbMath1395.90180MaRDI QIDQ2396379

V. D. Skarin, Leonid Denisovich Popov

Publication date: 8 June 2017

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

generalized solutionslinear programmingregularizationdualitypenalty methodsimproper problems

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)

Related Items (1)

The method of quasi-solutions based on barrier functions in the analysis of improper convex programs

Cites Work

• On the regularization method for conflicting problems of convex programming
• Problems in sequential programming
• Duality in quadratic programming
• An approach to the analysis of improper problems of linear programming
• Stability in convex quadratic parametric programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lexicographic regularization and duality for improper linear programming problems