Izvorni znanstveni članak
One-step behaviour of a method for finding a maximal solution of a system of linear inequalities
H. Späth
G. A. Watson
Sažetak
It has been observed empirically that a simple linearization method applied to the problem of finding maximal solutions to systems of linear inequalities frequently terminates in one step.
This is normally a Kuhn-Tucker point, and depending on the starting point, can be a global solution.
An explanation of this phenomenon is given, and this is illustrated by examples.
Ključne riječi
sequential linear programming; one-step behaviour; maximal solution of linear inequalities
Hrčak ID:
821
URI
Datum izdavanja:
20.12.2001.
Posjeta: 1.213 *