Computing compromise sets in polyhedral framework

DOI10.1016/S0893-9659(00)00039-2zbMath0949.90096OpenAlexW1972373058MaRDI QIDQ1585508

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

monotonicityconvexitycompromise programmingmulticriteria problems\(p\)-normscompromise set

Mathematics Subject Classification ID

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

Related Items (1)

Portfolio selection on the Madrid Exchange: a compromise programming model

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

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