Weak duality theorem and complementary slackness theorem for linear matrix programming problems
type: Item
instance of: scholarly article
title: Weak duality theorem and complementary slackness theorem for linear matrix programming problems
zbMATH Open document ID: 0767.90075
DOI: 10.1016/0167-6377(92)90032-X
author: Ferenc Gyetvàn
author: Yong Shi
published in: Operations Research Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 92024
zbMATH Keywords: linear matrix programming
zbMATH Keywords: multiobjective linear programming
zbMATH Keywords: efficient solutions
zbMATH Keywords: weak duality theorem
zbMATH Keywords: complementary slackness theorem
MaRDI profile type: Publication
cites work: Q5808750
cites work: On some relations between a dual pair of multiple objective linear programs
cites work: Q4177360
cites work: Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
cites work: Technical Note—Complementary Slackness Theorem in Multiple Objective Linear Programming
cites work: Algorithms for the vector maximization problem
cites work: Potential solutions of linear systems: the multi-criteria multiple constraint levels program
cites work: Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
full work available at URL: 0167-6377(92)90032-x
OpenAlex ID: W2073382249
description: scientific article; zbMATH DE number 92024