Duality theory and slackness conditions in multiobjective linear programming

The aim of this paper is to develop a duality theory for linear multiobjective programming verifying similar properties as in the scalar case. We use the so-called “strongly proper optima” and we characterize such optima and its associated dual solutions by means of some complementary slackness conditions. Moreover, the dual solutions can measure the sensitivity of the primal optima.