Discrepancy method for the lexicographic linear programming problem

DOI10.1007/BF01128154MaRDI QIDQ5965183zbMATH OpenOpenAlexFDO

Authors F. P. Vasil'ev, M. D. Yachimovich

Publication date 2 March 2016

Published in Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01128154

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Linear programming (90C05) Minimax problems in mathematical programming (90C47)

Recommendations

• scientific article; zbMATH DE number 4185391
• scientific article; zbMATH DE number 2049022
• A stabilization method for solving lexicographic problems
• The stabilization method for the lexicographical linear programming problem
• scientific article; zbMATH DE number 622080

Cites work

• Approximation conditions for the lexicographic problem
• Convex lexicographic problems
• scientific article; zbMATH DE number 4063603 (Why is no real title available?)
• scientific article; zbMATH DE number 194343 (Why is no real title available?)
• Problems in sequential programming
• Stability and regularization of optimality principles
• The stability of lexicographic optimization problems

Cited in

(2)

• scientific article; zbMATH DE number 520088 (Why is no real title available?)
• scientific article; zbMATH DE number 2049022 (Why is no real title available?)

This page was built for publication: Discrepancy method for the lexicographic linear programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5965183)