An algorithm for separable nonlinear minimax problems (Q1093547): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-6377(87)90013-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2007484144 / rank | |||
Normal rank |
Revision as of 21:09, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for separable nonlinear minimax problems |
scientific article |
Statements
An algorithm for separable nonlinear minimax problems (English)
0 references
1987
0 references
We consider a minimax resource allocation problem in which each term of the objective function is a strictly decreasing, invertible function of a single decision variable. The objective is to minimize the maximum term subject to non-negativity constraints and a set of linear constraints with only non-negative parameters. We develop an algorithm that finds an optimal solution by repeatedly solving a relaxed minimax problem. In general, each relaxed problem is solved by simple search methods; however, for certain nonlinear functions the algorithm employs closed form expressions.
0 references
large-scale systems
0 references
production scheduling
0 references
minimax resource allocation
0 references
set of linear constraints
0 references
non-negative parameters
0 references