Fundamental Theorem of Linear Programming
Steps to Solve LP Problems
- Define variables
- Write the objective function
- Write constraints
- Graph the feasible region
- Find corner points
- Evaluate objective function at each corner point
- Compare values to find optimum
Example: Formulate LP Problem
A furniture maker produces tables and chairs. Each table requires 2 hours of carpentry and 1 hour of finishing. Each chair requires 1 hour of carpentry and 1 hour of finishing. There are 100 hours of carpentry and 80 hours of finishing available. Profit per table is βΉ500 and per chair is βΉ300. Formulate as LP problem.
Types of Solutions
Example: Check Feasibility
Check if the following constraints define a non-empty feasible region: , ,