Abstract
Most of the decision making problems have multiple objectives, which cannot be optimized simultaneously due to the conflicting nature of the objectives. Such problems can be solved by various methods to obtain the “best-compromise” solutions. Sequential Linear Goal Programming (SLGP) method can be used to solve Multiple Objective Decision Making (MODM) problems, which involve the trade-off decisions. This paper proposes some modifications in traditional SLGP methods for MODM problems. It uses existing single objective Linear Programming (LP) techniques. The information required in each iteration is taken from the previous iteration. The proposed method is illustrated by some numerical examples. The method provides “best-compromise” solution.
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.
