Abstract

An interactive multiple goal programming method employing the ellipsoidal algorithm is described. As is the case for single objective programming, the ellipsoidal method improves the worst case behavior but not the average case behavior of multiple objective programming methods. However, the ellipsoidal method offers a simple and straightforward approach to calculate upper and lower bounds on any goal variable that is considered to be relevant by the decision-maker. Furthermore, under some mild assumptions, the described method can be shown to be polynomially bounded. This quite naturally raises the question of the performance of multiple objective programming methods in terms of theoretical complexity.

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 call

Disclaimer: 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.