01 Linear Programming
Linear Programming¶
Objective/constraint will be in linear form
Solution Properties¶
| Property | Meaning | How to obtain |
|---|---|---|
| Feasibility | All constraints satisfied | Substitute var values in constraints |
| Optimality | Max/min value of obj() | Substitute var values in obj() |
Graphical Method¶
- Define obj()
- Draw all constraints
- Draw line for LHS=RHS
- Draw appropriate arrows show the direction of inequality
- Find vertices of soln space (feasible region)
- Find the value of obj() at these vertices
- Pick the min/max value