Efficient approximate representation of bi-objective tradeoff sets

DOI10.1016/0016-0032(93)90073-4zbMath0825.49055OpenAlexW2012276582MaRDI QIDQ1338659

Anthony N. Payne

Publication date: 28 November 1995

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(93)90073-4

Mathematics Subject Classification ID

Differential games and control (49N70) Pursuit and evasion games (49N75)

Related Items (4)

An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making ⋮ Piecewise quadratic approximation of the non-dominated set for bi-criteria programs ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ Approximation methods in multiobjective programming

Cites Work

• Vector maximization with two objective functions
• An interactive rectangle elimination method for biobjective decision making
• An algorithm for bicriteria optimization based on the sensitivity function
• Solving Bicriterion Mathematical Programs

This page was built for publication: Efficient approximate representation of bi-objective tradeoff sets