Uncertainty and method choice in discrete multiobjective programming problems
The authors examine discrete multiobjective programming problems under uncertain knowledge of the payoff values. Two types of distributions are considered: triangular and uniform probability density functions. A discrete forestry management problem is used as a case study to illustrate the methodology and the dependence of the best alternative on the type and weights of the distances selected and on the type of distributions modelling the uncertainty of the objective function values. Finally, numerical results are compared and analyzed.
- Decision uncertainty in multiobjective optimization
- scientific article; zbMATH DE number 2208716
- An algorithmic approach to multiobjective optimization with decision uncertainty
- Comparing solutions under uncertainty in multiobjective optimization
- Multi-method based algorithm for multi-objective problems under uncertainty
- scientific article; zbMATH DE number 49086
- A new approach to multicriteria problems under uncertainty
- A robust-solution-based methodology to solve multiple-objective problems with uncertainty
- Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality
- On some multicriterial problem under uncertainty
- Opportunity losses due to uncertainty in multiobjective decision problems
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Decision uncertainty in multiobjective optimization
- Relations among efficient solutions in uncertain multiobjective programming
- Uncertain multiobjective traveling salesman problem
- scientific article; zbMATH DE number 175967 (Why is no real title available?)
- 基于P EV 准则的不确定随机多目标规划问题求解
This page was built for publication: Uncertainty and method choice in discrete multiobjective programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892086)
