📈
Linear Programming
★★★☆☆High School
📖Definition
Linear programming optimizes a linear objective function under linear constraints. The simplex algorithm solves it efficiently.
📐Formulas
max cᵀ x s.t. Ax ≤ b, x ≥ 0
Standard form linear program
✏️Examples
예제 1
Solve max 3x + 2y, s.t. x + y ≤ 4, 2x + y ≤ 6, x,y ≥ 0.
📜History
Discovered by: George Dantzig (1947)
Dantzig developed the simplex algorithm, making linear programming practical.
⚡Applications
Operations Research
Resource allocation, scheduling
Logistics
Transportation optimization
Finance
Portfolio optimization
🔗Related Documents
→Prerequisites
←Next Topics
↔Related
#선형계획#심플렉스#linear programming#LP