Multiple-objective programming with polynomial objectives and constraints

DOI10.1016/0377-2217(92)90350-IzbMATH Open0774.90073OpenAlexW2037415073MaRDI QIDQ1197675FDOQ1197675

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

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

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)

Cites Work

• Algorithm 652
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proper efficiency and the theory of vector maximization
• Finding all efficient extreme points for multiple objective linear programs
• On the Number of Solutions to Polynomial Systems of Equations
• Proper efficiency with respect to cones
• An approach to nonlinear programming
• A homotopy for solving polynomial systems
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonlinear multiple objective optimization: An algorithm and some theory
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Existence of efficient solutions for vector maximization problems
• On local Pareto Optima
• The Vector Maximization Problem: Proper Efficiency and Stability
• Non-convexity in noncooperative game theory
• A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
• Efficiency in multiple objective optimization problems
• On efficient sets in vector maximum problems - A brief survey
• Existence and characterization of efficient decisions with respect to cones
• Application of multiobjective optimization in aircraft control systems design
• Solving polynomial systems

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
• Generalized polarity and weakest constraint qualifications in multiobjective optimization
• On the use of polynomial models in multiobjective directional direct search
• 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
• Title not available (Why is that?)
• Vector optimization and generalized Lagrangian duality
• Title not available (Why is that?)
• Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
• Retrieval and use of the balance set in multiobjective global optimization

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)