The following pages link to (Q4184579):
Displaying 3 items.
- 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)
- On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin (Q1243258) (← links)
