Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems

摘要

This paper deals with solving a multiple objective linear programming problem. A (preferred) weights-vector from a restricted set of weights, incorporating the case that the weighted problem may have unbounded solution, is used for generating a (preferred) efficient (extreme) point. The final solution can be found by changing (interactively) weights-restrictions or comparing weights-restricted efficient extreme points. Also, the results can be used in vector maximum and interactive methods.