(application) A procedure for finding the maximum or minimum of a linear function where the arguments are subject to linear constraints. The simplex method is one well known algorithm.
Last updated: 1995-04-06
Updated: Sat Feb 25 19:20:35 2017
No longer supported by Imperial
College Department of Computing
Copyright Denis Howe 1985