Year: 1985
Type: article
Abstract: The following documented algorithm solves the standard linear programming problem of optimizing a linear form subject to linear inequality or equality constraints and nonnegativity conditions. The solution procedure incorporates the standard simplex method with no embellishments. There is only one loop corresponding to the basic simplex iteration.
Source: ACM SIGAPL APL Quote Quad
Author: Robert A. Agnew
Institution: FMC (United States)
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1981456418