Efficient approximate representation of bi-objective tradeoff sets

DOI10.1016/0016-0032(93)90073-4MaRDI QIDQ1338659zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338659)