Interactive algorithms for multiple criteria nonlinear programming problems

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.