Multiple-objective programming with polynomial objectives and constraints

DOI10.1016/0377-2217(92)90350-IMaRDI QIDQ1197675zbMATH OpenOpenAlexFDO

Authors Michael M. Kostreva, Thomas J. Ordoyne, Malgorzata M. Wiecek

Publication date 16 January 1993

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(92)90350-i

zbMATH Keywords

polynomial multi-objective optimizationhomotopy approach

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A constraint shifting homotopy method for convex multi-objective programming
• Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
• A homotopy method for multiobjective programming problems
• scientific article; zbMATH DE number 1778421
• Publication:4206580

Cites work

• 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?)
• 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
• 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 Vector Maximization Problem: Proper Efficiency and Stability
• The set of all nondominated solutions in linear cases and a multicriteria simplex method

Cited in

(12)

• Multi-objective design based on symbolic computation and its application to hard disk slider design
• Two methods for the maximization of homogeneous polynomials over the simplex
• On the use of polynomial models in multiobjective directional direct search
• Generalized polarity and weakest constraint qualifications in multiobjective optimization
• Linear complementarity problems and multiple objective programming
• Some algebraic methods for solving multiobjective polynomial integer programs
• Multiple-objective approximation of feasible but unsolvable linear complementarity problems
• scientific article; zbMATH DE number 5823944 (Why is no real title available?)
• Vector optimization and generalized Lagrangian duality
• scientific article; zbMATH DE number 4127024 (Why is no real title available?)
• Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
• Retrieval and use of the balance set in multiobjective global optimization

Describes a project that uses

Uses Software

• HOMPACK

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)