Using Duality Theory for Identification of Primal Efficient Points and for Sensitivity Analysis in Multiple Objective Linear Programming

The dual of the multiple objective linear programming problem is defined as a multiparametric LP problem for the right-hand sides. The resulting dual variables are multidimensional and are related to the indifference regions in the primal problem. The formulation of the dual is shown to be preferable to the vector minimization formulation in terms of (a) identifying primal efficient points and indifference regions, and (b) sensitivity analysis.