Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
From MaRDI portal
Publication:1885750
DOI10.1016/j.ejor.2003.10.002zbMath1061.90113OpenAlexW2014956566MaRDI QIDQ1885750
Philippe Fortemps, Dubois, Didier
Publication date: 12 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.002
Related Items (3)
A decision-theoretic approach to robust optimization in multivalued graphs ⋮ Qualitative capacities: basic notions and potential applications ⋮ Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interactive fuzzy programming system
- Multiset theory
- A simplex based algorithm for the lexicographically extended linear maxmin problem
- On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- Fuzzy dynamic programming: Main developments and applications
- Refinements of the maximum approach to decision-making in a fuzzy environment
- Towards qualitative approaches to multi-stage decision making
- Dioïds and semirings: Links to fuzzy sets and other applications
- Tchebycheff approximation in a compact metric space
- Rational Behavior under Complete Ignorance
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Approximations in $L^p $ and Chebyshev Approximations
- Scheduling to Minimize Interaction Cost
- Decision-Making in a Fuzzy Environment
- Leximin optimality and fuzzy set-theoretic operations.
This page was built for publication: Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
