Piecewise quadratic approximation of the non-dominated set for bi-criteria programs

DOI10.1002/mcda.287zbMath0985.90082OpenAlexW2142065929MaRDI QIDQ2720018

Wei Chen, Margaret M. Wiecek, JinHuan Zhang

Publication date: 2 June 2002

Published in: Journal of Multi-Criteria Decision Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mcda.287

zbMATH Keywords

approximationnon-dominated setbi-criteria programs

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items (2)

Saddle points and Pareto points in multiple objective programming ⋮ Approximation methods in multiobjective programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of admissible points with respect to cone dominance
• A method for convex curve approximation
• Augmented Lagrangian and Tchebycheff approaches in multiple objective programming
• Reference point approximation method for the solution of bicriterial nonlinear optimization problems
• Nonscalarized multiobjective global optimization
• On a constructive approximation of the efficient outcomes in bicriterion vector optimization
• Efficient approximate representation of bi-objective tradeoff sets
• Retrieval and use of the balance set in multiobjective global optimization
• Proper efficiency and the theory of vector maximization
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• On the Structure of the Non-dominated Set for Bicriteria Programmes

This page was built for publication: Piecewise quadratic approximation of the non-dominated set for bi-criteria programs