Skip to content

Linear Programming

High School

Definition

Method for optimizing linear objective function subject to linear constraints

Formulas

max cᵀ x
s.t. Ax ≤ b
x ≥ 0
Simplex Method

Examples

Example 1

Production planning

Example 2

Transportation problem

Example 3

Resource allocation

Applications

Manufacturing

Logistics

Finance

Related Documents

Was this page helpful?