โ Operations Research learning pathOperations Research ยท Module 3 of 10
Graphical method and simplex
Solving LP problems.
๐ Key ideas
- For two variables, plot constraints; the feasible region is where all constraints hold.
- The optimal solution lies at a corner point (vertex) of the feasible region.
- Evaluate the objective at each corner and pick the best.
- The simplex method moves from vertex to vertex improving the objective; used for many variables.
- Special cases: unbounded, infeasible, and multiple optimal solutions.
๐ก Real-life example: Like checking every corner of a fenced field to find the spot with the best view.
Feasible regionArea satisfying all constraints
Corner pointVertex of the feasible region
Simplex methodAlgorithm moving between vertices
Infeasible problemNo point satisfies all constraints