Operation research Assignment 1

Submitted by Vibhor Jain Student Id:- 200084160

Answer: - True

Answer: - False

Answer: - False

Solution:- For the given linear programming problem, Let us consider farmer Jane allots x1 acres of land for
growing wheat and x2 acres of land for growing corn.
Objective function is to maximize the profit.
Total profit for wheat with x1 acres of land is = 200* X1
Total profit for corn with x2 acres of land is = 300* X2
Objective function Z is to Maximize profit P = 200* x1+ 300*x2
Applying constraints:1. Total land available: - x1+x2 <=45
eq (1)
2. Total Labour available per acre is 3 workers for wheat and 2 workers for corn
Hence 3*x1+ 2* x2 <= 100
eq(2)
3. Total fertilizer available is 120 tons and fertilizer available per acre for wheat and corn is 2 and 4 tons
respectively.
Hence equating quantity of fertilizer we get 2*x1+4*x2 < = 120 eq (3)

Plotting equations on graph:-

As per graph plotted the coordinate (20,20) fulfills all the three parameters and satisfies conditions of all
constraints. The region is shaded with dashed lines and we get following boundary points
A(0,30), B(20,20), C (33.33,0)
Putting these values in maximization function we get:Z (0,30)=$ 9000 , Z (20,20) =$10000 , Z (33.33,0) = $6666.6

Hence Maximum profit possible under given constraints is 200*20+300*20 = $10,000.

Let number of beers produced be X barrels and number of ale produced being Y barrels. Objective function is to
maximize profit hence the objective function equation is
Profit per barrel of beer is $5, Hence total profit for X barrels of beer is $ 5X.
Profit per barrel of beer is $2, Hence total profit for Y barrels of beer is $ 2Y.
Objective function is to Maximize 5X+2Y
Now to find out constraints we can consider following conditions provided:Since no of barrels cant be negative our first constraint equation is X>=0,Y>=0 ..eq 1
Total corn required to produce X barrels of beer (5lbs/barrel) and Y barrels of ale(2lbs/barrel) is 5X+2Y<= 60 Eq.2
Total hops required to produce X barrels of beer (2lbs/barrel) and Y barrels of ale(1lbs/barrel) is 2X + Y<=25Eq.3
To maximize profit, we shall take maximum possible production of beer and ale in available resources and
provide put inequalities as
X>0, Y>0
5X+2Y<= 60 ...equation 1
2X + Y<=25 equation 2
And our objective function is to Maximize 5X+2Y
Using graphical method to solve the linear problems, we plot equation 1 and 2 on graph:-

As per graph the feasible region for maximum profit lies under common area of X=0,Y=0, 5X+2Y- 60=0 and 2X + Y-25=0.
The common boundary points from feasible region from graph comes out to be(0,25), (10,5),(12,0). Putting them in
maximum objective function we get :-

Z (0, 25) = 50
Z (10, 5) = 60
Z (12, 0) = 60
Since X and Y >0, our optimal solution is X=10,Y= 5
Hence Maximum profit or revenue available is = 5X+2Y = 5*10+2*5= $ 60.

Case 1:-

Plotting constraints on the graph and Putting X1= x and X2 = y :-

In case we check any other values from feasible region they provide higher values of objective function which
cannot be determined as there is no upper limit for the function in feasible area.
The region is Unbounded as there here is no upper limit for maximizing the region.

Case 2

Plotting constraints on the graph and Putting X1= x and X2 = y :-

In this graph we have 3 points which satisfy the equation (0,6), (3,1.5), (4,1). Putting these values in minimization
function we get values
Min Z(0,6) =6*0+2*6= 12 ,
Min Z(3,1.5)= 6*3+2*1.5=21 ,
Min Z(4,1)= 6*4+2*1= 26.
In case we check any other values from feasible region they provide higher values of objective function which is
undesirable.
Hence Minimum value is Min Z(0,6) =12.
Hence the linear programming problem has Unique Solution.

Case 3:-

Plotting constraints on the graph and Putting X1= x and X2 = y :-

Here we have 2 points (0, 12) and (2.5, 2) which satisfy the constraints for minimization objective as plotted on
the graph. Using both values in the minimization function we get:
Zmin (0, 12 ) = 4*0+12=12
Zmin(2.5, 2 )= 4*2.5+2 =12
Since both points give minimum value of function. In case we check any other values from feasible region they
provide higher values of objective function which is undesirable.
We have 2 solutions hence his linear programming has MANY Solutions.

Case 4:-

Plotting constraints on the graph and Putting X1= x and X2 = y :-

Here we have 2 points (4,4 ) and (7,1) which satisfy the constraints for minimization objective as plotted on the
graph. Using both values in the minimization function we get:
Zmin(4,4) = 4- 2*4 = -4
Zmin(7,1) = 7- 2*1 = 5
In case we check any other values from feasible region they provide further values of objective function which is
desirable. The function X1 - 2*X2 values keep on decreasing with higher values of X2. Hence the feasible region is
unbounded and minimum value of objective function cannot be realized.
Hence this L.P is Unbounded.