An algorithm for separable non-linear minimax problems
- 30 September 1987
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 6 (4) , 159-162
- https://doi.org/10.1016/0167-6377(87)90013-7
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Resource allocation among competing activities: a lexicographic minimax approachOperations Research Letters, 1986
- Continuous maximin knapsack problems with GLB constraintsMathematical Programming, 1986
- A graphical method to solve a maximin allocation problemEuropean Journal of Operational Research, 1986
- Max-min resource allocationBIT Numerical Mathematics, 1983
- An algorithm for solving linearly constrained minimax problemsEuropean Journal of Operational Research, 1982
- Linearly constrained minimax optimizationMathematical Programming, 1978
- New algorithms for constrained minimax optimizationMathematical Programming, 1977
- Technical Note—Allocation of Effort Resources among Competing ActivitiesOperations Research, 1975
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource AllocationOperations Research, 1974
- Allocation of Total Sample Size When Only the Stratum Means Are of InterestTechnometrics, 1971