The aim of this paper is to develop a duality theory for linear multiobject
ive 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 cond
itions. Moreover, the dual solutions can measure the sensitivity of the pri
mal optima. (C) 1999 Elsevier Science Ltd. All rights reserved.