Compromise programming with Tchebycheff norm for discrete stochastic orders

DOI10.1007/s10479-013-1493-2zbMath1286.90140OpenAlexW2028532061WikidataQ59303561 ScholiaQ59303561MaRDI QIDQ2449367

Sebastian Sitarz

Publication date: 8 May 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1493-2

zbMATH Keywords

multi-objective programmingstochastic dominancecompromise programmingTchebycheff norm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (1)

Photovoltaic power plants: a multicriteria approach to investment decisions and a case study in western Spain

Cites Work

• Unnamed Item
• Mean value and volume-based sensitivity analysis for Olympic rankings
• Dynamic programming with ordered structures: Theory, examples and applications
• Discrete dynamic programming with outcomes in random variable structures
• Aspiration level approach in stochastic MCDM problems
• Postoptimal analysis in multicriteria linear programming
• Stability achievement scalarization function for multiobjective nonlinear programming problems
• Selecting the CP metric: A risk aversion approach
• Weighting in compromise programming: A theorem on shadow prices
• The compromise hypersphere for multiobjective linear programming
• Standard sensitivity analysis and additive tolerance approach in MOLP
• Inverse stochastic dominance constraints and rank dependent expected utility theory
• Portfolio construction based on stochastic dominance and target return distributions
• METRIZATION OF STOCHASTIC DOMINANCE RULES
• Stochastic Dominance and Expected Utility: Survey and Analysis
• An interactive weighted Tchebycheff procedure for multiple objective programming
• On Choosing and Bounding Probability Metrics

This page was built for publication: Compromise programming with Tchebycheff norm for discrete stochastic orders