Abstract (EN)

The paper presents a methodology for Multi-Objective Linear Programming (MOLP) problems. It relies on three steps: (1) Generation of a subset of feasible efficient solutions (from 10 to 50) as representative as possible of the efficient set. (2) Assessment of an additive utility function using an interactive method (Prefcalc). (3) Optimization of the additive utility function on the original set of feasible alternatives. Following this methodology enables the user to find compromise solutions which can be different from the vertices. It is particularly adapted for large scale linear programs where traditional multiobjective methods would be too costly to use, since the interactive phase is limited to step 2, using Prefcalc on a micro-computer. A micro-computer version of the method (Prefchat) is available.