Multiple-objective programming with polynomial objectives and constraints
From MaRDI portal
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.
Recommendations
Cites work
- A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
- A homotopy for solving polynomial systems
- Algorithm 652
- An approach to nonlinear programming
- Application of multiobjective optimization in aircraft control systems design
- Efficiency in multiple objective optimization problems
- Existence and characterization of efficient decisions with respect to cones
- Existence of efficient solutions for vector maximization problems
- Finding all efficient extreme points for multiple objective linear programs
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- scientific article; zbMATH DE number 3809326 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3679573 (Why is no real title available?)
- Non-convexity in noncooperative game theory
- Nonlinear multiple objective optimization: An algorithm and some theory
- On efficient sets in vector maximum problems - A brief survey
- On local Pareto Optima
- On the Number of Solutions to Polynomial Systems of Equations
- Proper efficiency and the theory of vector maximization
- Proper efficiency with respect to cones
- Solving polynomial systems
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- The Vector Maximization Problem: Proper Efficiency and Stability
Cited in
(12)- Vector optimization and generalized Lagrangian duality
- Multiple-objective approximation of feasible but unsolvable linear complementarity problems
- Retrieval and use of the balance set in multiobjective global optimization
- On the use of polynomial models in multiobjective directional direct search
- Two methods for the maximization of homogeneous polynomials over the simplex
- scientific article; zbMATH DE number 5823944 (Why is no real title available?)
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
- scientific article; zbMATH DE number 4127024 (Why is no real title available?)
- Multi-objective design based on symbolic computation and its application to hard disk slider design
- Generalized polarity and weakest constraint qualifications in multiobjective optimization
- Some algebraic methods for solving multiobjective polynomial integer programs
- Linear complementarity problems and multiple objective programming
This page was built for publication: Multiple-objective programming with polynomial objectives and constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197675)
