Abstract
The problem to optimize multiple conflicting linear objective functions simultaneously under the given linear constraints is called the multiobjective linear programming problem. This chapter begins with a discussion of fundamental notions and methods of multiobjective linear programming. After introducing the notion of Pareto optimality, several methods for characterizing Pareto optimal solutions including the weighting method, the constraint method, and the weighted minimax method are explained, and goal programming and compromise programming are also introduced. Extensive discussions of interactive multiobjective linear programming conclude this chapter.
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.
