A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
From MaRDI portal
Publication:1971990
Recommendations
- On optimization over the efficient set of a multiple objective linear programming problem
- On optimization over the efficient set in linear multicriteria programming
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Efficient solutions of a class of multiobjective programs
- Efficiency and duality for nonlinear multiobjective programs involving \(n\)-set functions
- scientific article; zbMATH DE number 3934797
- Optimization over the efficient set of a bicriteria convex programming problem
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems
- Optimizing over the properly efficient set of convex multi-objective optimization problems
- Optimality conditions for a class of nonsmooth multi-objective programming problems
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 592648 (Why is no real title available?)
- A global optimization approach for solving the convex multiplicative programming problem
- Algorithms for the vector maximization problem
- Careful usage of pessimistic values is needed in multiple objectives optimization
- Introduction to global optimization
- Maximizing a concave function over the efficient or weakly-efficient set
- Minimization of a quasi-concave function over an efficient set
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On-line and off-line vertex enumeration by adjacency lists
- Optimization over the efficient set
- Optimization over the efficient set
- Optimization over the efficient set: Four special cases
- Outer approximation by polyhedral convex sets
- The Cutting-Plane Method for Solving Convex Programs
- Utility function programs and optimization over the efficient set in multiple-objective decision making
Cited in
(11)- Optimizing over the properly efficient set of convex multi-objective optimization problems
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- Decomposition branch and bound algorithm for optimization problems over efficient sets
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- Combination between global and local methods for solving an optimization problem over the efficient set
- Maximizing a concave function over the efficient or weakly-efficient set
- On optimization over the efficient set in linear multicriteria programming
- On optimization over the efficient set of a multiple objective linear programming problem
- Optimization over the efficient set of a bicriteria convex programming problem
- scientific article; zbMATH DE number 3887462 (Why is no real title available?)
- Analytic efficient solution set for multi-criteria quadratic programs
This page was built for publication: A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971990)
