Abstract
The main purpose of this paper is to introduce a solution method for multi-criteria linear programming (MCLP) problems. The method offers a practical solution to MCLP problems by combining judgements with an automatic optimization technique in decision making. This is realised by using the ideas underlying the method of compromise programming and the maximum entropy principle (MEP) in an iterative way. The "nearly equal" optimal weights of objective functions in an MCLP problem are established by using the MEP. The solutions in terms of deviation measurement from an ideal point are presented to the decisionmaker, and he has only to specify the amount by which specific alternatives should exceed the “optimal” ones. In general, a nearly-equal weights procedure may incorporate additional constraints for eliciting weights. Such interactive method for solving MCLP allows re-adjustment of optimal weights, displacement of the ideal point and new pre-decision conflict formation, and leads to a decision in a finite number of iterations. A numerical example is included to illustrate the proposed technique.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
