Technical Note—Complementary Slackness Theorem in Multiple Objective Linear Programming

Soondal Park
Additional contact information
Soondal Park: Seoul National University, Seoul, Korea

Operations Research, 1982, vol. 30, issue 2, 410-412

Abstract: A complementary slackness theorem in multiple objective linear programming (MOLP) is proved. MOLP problems may have many efficient solutions, and the objective values of the solutions may not be equal to those of efficient solutions of their dual problems. We show that the necessary and sufficient condition for existence of a pair of primal and dual efficient solutions with equal objective values is as follows if a variable in the primal problem is positive, then the corresponding relation in the dual is equality, and if a relation in the dual problem is not equality, then the corresponding variable in the primal must be zero.

Keywords: 640 complementary slackness theorem; 641 multiple objective linear programming (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.2.410 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:30:y:1982:i:2:p:410-412

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().