Abstract
For a linear-programming problem with q (⩾2) objective functions (that is, a multiobjective linear-programming problem), we propose a method for ranking the full set or a subset of efficient extreme-point solutions. The idea is to enclose the given efficient solutions, as represented by q-dimensional points in objective space, within an annulus of minimum width, where the width is determined by a hypersphere that minimizes the maximum deviation of the points from the surface of the hypersphere. We argue that the hypersphere represents a surface of compromise and that the point closest to its surface should be considered as the “best” compromise efficient solution. Also, given a ranked (sub)set of efficient solutions, a procedure is given that associates to each efficient solution a set of q positive weights that causes the efficient solution to be optimal with respect to the given set of efficient solutions.
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.
