A bird's eye-view of min-max and max-min functionals
β Scribed by M.J. Kaiser
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 878 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment pro
## Abstract An algorithm designed to solve a large class of nonconvex maxβmin problems is described. Its usefulness and applicability is demonstrated by solving an extension of a recently introduced model which optimally allocates strategic weapon systems. The extended model is shown to be equivale