# MGOC10H3 Lecture Notes - Lecture 2: Feasible Region, Sensitivity Analysis

## Document Summary

Chapter 2 solving lp model graphical method & sensitivity analysis of constraints. Any specification of values for variables is called a solution eg. x1 = 60, x2 = 10. Feasible solution is a solution that satisfies all constraints and sign restrictions eg. [x1 = 40, x2 = 20] or [x1 = 30. 5, x2 = 20. 001] or . The feasible region is set of all feasible solutions. Given many feasible solutions, goal is to find the best or optimal solution. For max problem, optimal (best) solution is one which maximizes value of objective. For min problem, it is one which minimizes objective. Solutions which are intersection of 2 or more constraints are called corner feasible solutions (at corner of feasible region). The optimal solution for an lp must be a corner feasible solution. Lps can have one optimal solution, multiple optimal solutions, or problem can be infeasible (no feasible solution) or unbounded ( z = or z = - )