A nonlinear minimax allocation problem with multiple knapsack constraints (Q1178726)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A nonlinear minimax allocation problem with multiple knapsack constraints |
scientific article; zbMATH DE number 22305
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A nonlinear minimax allocation problem with multiple knapsack constraints |
scientific article; zbMATH DE number 22305 |
Statements
A nonlinear minimax allocation problem with multiple knapsack constraints (English)
0 references
26 June 1992
0 references
A nonlinear allocation problem is considered. The minimax objective is described by \(\min\max_ j f_ j(x_ j)\) (\(f_ j\) are strictly decreasing, continuous functions) and the feasible domain is given by linear inequalities with only nonnegative coefficients. The presented new algorithm determines the optimal set of activities without having to solve nonlinear equations.
0 references
nonlinear allocation
0 references
minimax objective
0 references
0 references
