Abstract
This article demonstrates how the penalty function can efficiently be used for solving multiobjective linear programming problem with interval valued objective functions. In the proposed approach, first the target intervals are obtained for the defined objectives. Then, using interval arithmetic and the concept of interval goal programming (IGP) the interval goals are transformed into crisp goals. In the process of solution, the goal achievement function is constructed as a convex combination of the sum of total penalty and the maximum penalty associated with unwanted deviations of the respective goals. Numerical examples are provided to illustrate the proposed approach.
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.
