برنامهسازی ِ خطی barnâme-sâzi-ye xatti (#)
*Fr.: programmation linéaire*
A procedure for finding the maximum or minimum of a → *linear function*
where the → *argument*s are subject to linear
→ *constraint*s. For problems involving more than two
variables or problems involving a large number of constraints, solution
methods used are those that are adaptable to computers. A well-known such
→ *algorithm* is the → *simplex method*. → *linear*; → *programmings*. |