Multiple-objective programming with polynomial objectives and constraints
The authors describe a method for the numerical solution of polynomial multi-objective optimization problems. With the aid of a known scalarization result and by relaxation of constraints a solution is determined by using a homotopy approach. Examples with two objectives and one inequality constraint are discussed.
scientific article; zbMATH DE number 91835
scientific article