Abstract
Whereas in goal programming the under-achievement with respect to (usually) unattainable goals are minimized, we propose the maximization of the over-achievements with respect to feasible goals or required values. An interactive algorithm, in which the over-achievements are maximized via a barrier function, is presented to implement 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.
