Constrained optimization problems under uncertainty with coherent lower previsions
From MaRDI portal
Publication:690890
Recommendations
- Maximin and maximal solutions for linear programming problems with possibilistic uncertainty
- Distributionally robust possibilistic optimization problems
- scientific article; zbMATH DE number 4101080
- Uncertain convex programs: randomized solutions and confidence levels
- scientific article; zbMATH DE number 4199974
Cites work
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 53912 (Why is no real title available?)
- scientific article; zbMATH DE number 3514748 (Why is no real title available?)
- A behavioral model for linguistic uncertainty
- A behavioural model for vague probability assessments
- A survey of the theory of coherent lower previsions
- Coherence of rules for defining conditional possibility
- DESCRIPTION AND OPTIMIZATION OF FUZZY SYSTEMS
- Decision making under uncertainty using imprecise probabilities
- Decision-Making in a Fuzzy Environment
- Epistemic independence in numerical possibility theory.
- Fuzzy linear programming and applications
- Fuzzy linear programming using a penalty method.
- Integration and conditioning in numerical possibility theory
- Linear Optimization Problems with Inexact Data
- Maximin and maximal solutions for linear programming problems with possibilistic uncertainty
- Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem
- Robust optimization-methodology and applications
- Solving large-scale fuzzy and possibilistic optimization problems
- Supremum preserving upper probabilities
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The robust shortest path problem with interval data via Benders decomposition
- Weighted constraint aggregation in fuzzy optimization
Cited in
(10)- Robust optimization with scenarios using belief functions
- Distributionally robust possibilistic optimization problems
- Handling Mixture Optimisation Problem Using Cautious Predictions and Belief Functions
- On the enumeration of non-dominated matroids with imprecise weights
- Optimization problems with evidential linear objective
- Maximin and maximal solutions for linear programming problems with possibilistic uncertainty
- Robust Solutions in Unstable Optimization Problems
- The capacitated vehicle routing problem with evidential demands
- The CONEstrip algorithm
- On the enumeration of non-dominated spanning trees with imprecise weights
This page was built for publication: Constrained optimization problems under uncertainty with coherent lower previsions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690890)