Interactive compromise hypersphere method and its applications

DOI10.1051/RO/2012017MaRDI QIDQ3168431zbMATH OpenOpenAlexFDO

Authors Sebastian Sitarz

Publication date 31 October 2012

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8c629881a3903a1b151f9fc2b4f6db75a3ab7d75

zbMATH Keywords

compromise programmingdecision makingmulti-criteria problemsmultiple objective linear programmingsensitivity analysis

Mathematics Subject Classification ID

Sensitivity analysis for optimization problems on manifolds (49Q12) Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29)

Recommendations

• Interactive Compromise Programming
• Computing compromise sets in polyhedral framework
• The compromise hypersphere for multiobjective linear programming
• Some Difficulties in Applying Interactive Compromise Programming Illustrated by a Recent Method and a Case Study
• Secure multiparty computation of solid geometric problems and their applications
• A secure multi-party computation solution to intersection problems of sets and rectangles
• Verifiable secret sharing based on hyperplane geometry with its applications to optimal resilient proactive cryptosystems
• scientific article; zbMATH DE number 5283568

Cited in

(1)

• The compromise hypersphere for multiobjective linear programming

This page was built for publication: Interactive compromise hypersphere method and its applications

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