Pages that link to "Item:Q1243258"
From MaRDI portal
The following pages link to On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin (Q1243258):
Displaying 5 items.
- Conjoint axiomatization of Min, DiscriMin and LexiMin (Q703385) (← links)
- A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions (Q752006) (← links)
- A simplex based algorithm for the lexicographically extended linear maxmin problem (Q1150307) (← links)
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems (Q1307812) (← links)
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints (Q1885750) (← links)
