Weak duality theorem and complementary slackness theorem for linear matrix programming problems

DOI10.1016/0167-6377(92)90032-XzbMath0767.90075OpenAlexW2073382249MaRDI QIDQ1197914

Yong Shi, Ferenc Gyetvàn

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90032-x

zbMATH Keywords

efficient solutionsmultiobjective linear programmingweak duality theoremcomplementary slackness theoremlinear matrix programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items

An interior-point approach for solving MC\(^2\) linear programming problems, A transportation model with multiple criteria and multiple constraint levels, An \(\text{MC}^2\) linear programming approach to combined forecasting, Fuzzy potential solutions in multi-criteria and multi-constraint level linear programming problems, Duality in fuzzy multi-criteria and multi-constraint level linear programming: A parametric approach

Cites Work

• Unnamed Item
• Unnamed Item
• Potential solutions of linear systems: the multi-criteria multiple constraint levels program
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Technical Note—Complementary Slackness Theorem in Multiple Objective Linear Programming
• Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
• On some relations between a dual pair of multiple objective linear programs
• Algorithms for the vector maximization problem