Math
Linear programming.
Definition
A method of finding the maximum or minimum value of a linear objective function subject to a set of linear inequality constraints. Solutions occur at the vertices (corner points) of the feasible region.
How it works · 6 phases
Step by step.
- Define the variables and write the objective function to maximize or minimize.
- Write the constraint inequalities.
- Graph the constraints to find the feasible region.
- Identify the vertices (corner points) of the feasible region.
- Evaluate the objective function at each vertex.
- Select the vertex that gives the optimal (max or min) value.
Examples
Real-world.
- 1 Maximizing profit when producing two products with limited resources
- 2 Minimizing cost of a diet that must meet certain nutritional requirements
- 3 Optimizing shipping routes with capacity constraints