When a goal and its limits are linear, the best choice lies at a corner. This course formulates and solves linear programming problems graphically.
The course follows the NCERT Class 12 Mathematics chapter Linear Programming and has 1 lesson. It explains the ideas with worked examples and ends with practice questions and full answers. The numbers in every example and question are our own, so the lessons can be used alongside the textbook exercises.
- Linear Programming by the Corner-Point Method, Formulating linear programming problems, feasible regions, the corner-point method, unbounded regions, and manufacturing and diet problems.
By the end you will be able to:
- Formulate a linear programming problem.
- Draw the feasible region.
- Solve by the corner-point method.
- Handle unbounded regions correctly.