Strictly feasible solutions and strict complementarity in multiple objective linear optimization

Strictly feasible solutions and strict complementarity in multiple objective linear optimization

0.00 Avg rating0 Votes
Article ID: iaor20174338
Volume: 15
Issue: 3
Start Page Number: 303
End Page Number: 326
Publication Date: Sep 2017
Journal: 4OR
Authors: ,
Keywords: programming: multiple criteria, programming: linear, heuristics
Abstract:

Recently, Luc defined a dual program for a multiple objective linear program. The dual problem is also a multiple objective linear problem and the weak duality and strong duality theorems for these primal and dual problems have been established. Here, we use these results to prove some relationships between multiple objective linear primal and dual problems. We extend the available results on single objective linear primal and dual problems to multiple objective linear primal and dual problems. Complementary slackness conditions for efficient solutions, and conditions for the existence of weakly efficient solution sets and existence of strictly primal and dual feasible points are established. We show that primal‐dual (weakly) efficient solutions satisfying strictly complementary conditions exist. Furthermore, we consider Isermann’s and Kolumban’s dual problems and establish conditions for the existence of strictly primal and dual feasible points. We show the existence of primal‐dual feasible points satisfying strictly complementary conditions for Isermann’s dual problem. Also, we give an alternative proof to establish necessary conditions for weakly efficient solutions of multiple objective programs, assuming the Kuhn–Tucker (KT) constraint qualification. We also provide a new condition to ensure the KT constraint qualification.

Reviews

Required fields are marked *. Your email address will not be published.