A Note on Solvability Conditions for Multiple Objectives Linear Programming(MOLP) Problems

摘要

This paper investigates the advantages of using a simple linear programming problem with one unknown to show that whether the given multiple objectives linear programming (MOLP) problems is solvable or not. This kind of investigation is based mainly on both of feasibility and efficiency characterization of the (MOLP) problem. Our goal of this investigation is to help the analyst of better understanding of the nature and the theory of the given problem under consideration. Some illustrative examples is given to clarify this investigation study.