Corner Point Methods
To solve the problem using the corner point method you need to follow the following steps:
Step 1: Create mathematical formulation from the given problem. If not given.
Step 2: Now plot the graph using the given constraints and find the feasible region.
Step 3: Find the coordinates of the feasible region(vertices) that we get from step 2.
Step 4: Now evaluate the objective function at each corner point of the feasible region. Assume N and n denotes the largest and smallest values of these points.
Step 5: If the feasible region is bounded then N and n are the maximum and minimum value of the objective function. Or if the feasible region is unbounded then:
- N is the maximum value of the objective function if the open half plan is got by the ax + by > N has no common point to the feasible region. Otherwise, the objective function has no solution.
- n is the minimum value of the objective function if the open half plan is got by the ax + by < n has no common point to the feasible region. Otherwise, the objective function has no solution.
Graphical Solution of Linear Programming Problems
Linear programming is the simplest way of optimizing a problem. Through this method, we can formulate a real-world problem into a mathematical model. There are various methods for solving Linear Programming Problems and one of the easiest and most important methods for solving LPP is the graphical method. In Graphical Solution of Linear Programming, we use graphs to solve LPP.
We can solve a wide variety of problems using Linear programming in different sectors, but it is generally used for problems in which we have to maximize profit, minimize cost, or minimize the use of resources. In this article, we will learn about Solutions of Graphical solutions of linear programming problems, their types, examples, and others in detail.
Table of Content
- Linear Programming
- Graphical Solution of a Linear Programming Problems
- Corner Point Methods
- Iso-Cost Methods
- Solved Examples