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.
ChinneckJ.W. (1997) Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS Journal on Computing, Vol. 9, pp. 164–174.
2.
EckerJ.G. and KaudaI.A. (1978) Finding all efficient extreme points for multiple objective linear programming, Mathematical Programming, Vol. 14, pp. 249–261.
3.
EckerJ.G.HegrenH.S. and KaudaI.A. (1980) Generating maximal efficient faces for multiple objective linear programs, Journal of Optimization Theory and Applications, Vol. 30, pp. 353–361.
4.
EvansJ.P. and SteuerR.F. (1973) Generating efficient extreme points in linear multiple objective programming two algorithms and computing experience in Cochran and Zeleny, multiple criteria decision making, university of South Carolina press.
5.
GalT. (1977). A general method for determining the set of all efficient solution to a linear vector maximum problem, European Journal of Operational Research, Vol. 1, pp. 307–322.
6.
IsermannH. (1977) Enumeration of the set of all efficient solution for a linear multiple objective program, Oper. Res. Quart., Vol. 28, pp. 711–725.
7.
MurtyK.G.KabadiS.N. and ChandrasekaranR. (2000) Infeasibility analysis for linear systems, a survey. Arabian Journal of Science and Technology, Vol. 25, pp. 3–18.
8.
RoodmanG.M. (1979) Post-infeasibility analysis in linear programming. Management Science; Vol. 25, pp. 916–922.
9.
SalukvadzeM. E. and TopchishviliA.L. (1989) Insoluble multicriteria linear programming problems, Optimization theory and applicationsVol. 61 pp. 487–491.
10.
SteuerR.E. and PiercyC.A. (2005). A Regression study of the number of efficient extreme points in multiple objective linear programming, European Journal of Operational Research, Vol.162, pp. 484–49.
11.
SchechterM. and SteuerR.E. (2005). A correction to the connectedness of the Evans-Steuer Algorithm of multiple objective linear programming, Foundations of Computing, Vol. 30, pp. 351–359.
12.
TantawyS.F. and SallamR.H. (2009), Multiple objective linear programming (MOLP) problems with the same objective space, Journal of Algorithms & Computational Technology, Vol. 3, pp. 573–581.
13.
TamuraK and MuraS. (1977) On linear vector maximization problems, Journal of Operational Research Society of Japan, Vol. 5, pp. 139–149.
14.
WangJ.G. and ZiontsS. (2006) The Aspiration Level Interactive Method (AIM) Reconsidered: Robustness of Solutions to Multiple Criteria Problems. European Journal of Operational Research, Vol. 17, pp. 948–958.
15.
YangJ. (2008) Infeasibility resolution based on goal programming. Computers & Operations ResearchVol. 35, pp. 1483–1493.
16.
ZelenyM. (1974) linear Multi objective Programming, Springer-Verlag, New York.
