Abstract
In this paper, several interactive procedures for solving multiple criteria nonlinear programming problems have been developed. These are based on the generalized reduced gradient method for solving single objective nonlinear programming problems. They can handle maximization problems with nonlinear concave objectives, nonlinear convex constraints and an implicit quasi-concave preference function of the decision maker. The interactive procedures work with information of varying degrees of accuracy from the decision maker, thereby extending and strengthening a number of existing methods.
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 callSimilar Papers
More From: European Journal of Operational Research
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.
