Computing compromise sets in polyhedral framework

DOI10.1016/S0893-9659(00)00039-2MaRDI QIDQ1585508zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 16 November 2000

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0893-9659(00)00039-2

zbMATH Keywords

monotonicitycompromise programmingconvexity\(p\)-normsmulticriteria problemscompromise set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production theory, theory of the firm (91B38)

Recommendations

• On the monotonicity of the compromise set in multicriteria problems
• Computing compromise solutions: On the connections between compromise programming and composite programming
• Generating well-behaved utility functions for compromise programming
• On compromise solutions in multiple objective programming
• The power of compromise. Reference point methods and approximation in multicriteria optimization

Cites work

• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• On the monotonicity of the compromise set in multicriteria problems
• Some New Results on Compromise Solutions for Group Decision Problems

Cited in

(3)

• Portfolio selection on the Madrid Exchange: a compromise programming model
• Interactive compromise hypersphere method and its applications
• Axiomatizations of the Euclidean compromise solution

This page was built for publication: Computing compromise sets in polyhedral framework

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