Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap
irt.Org

linear programming

You are here: irt.org | FOLDOC | linear programming

<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.

(1995-04-06)

Nearby terms: Linear Graph Notation « linear logic « linear map « linear programming » linear space » linear topology » linear transformation

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb