Linear programming examples

Let us now learn about Linear programming examples,solve the following linear programming problem graphically. Minimize z = 200x +500 y

subject to the constraints given as x + 2y ≥ 50

3x + 4y ≤ 90

x ≥ 0, y ≥ 0

Solution:

In the figure, the feasible region OABC is bounded. It is indicated as the shaded region in the following figure. This is the feasible region which is determined by the system of constraints given. Therefore, to find out the maximum value of z, we can use corner point method.

The corner point coordinates of O, A, B and C are (0, 5), (4, 3) and (0, 6) respectively. The next step is to calculate z value at each corner point.The standard form of the linear programming problem is used to develop the procedure for solving a general linear programming problems.

A general LPP is of the form
Max (or min) Z = c₁x₁ + c₂x₂ + … +c_nx_n
x₁, x₂, ....x_n are called decision variable.In the next blog we will learn about statistics,hope you like the above example of Linear programming examples,please leave your comments if you have any doubts.