OBSERVATIONS AND TABULATIONS Lab 42

Linear Programming Problem

Aim
• To explore the geometrical solution of
linear programming problem
• To understand the difference between
feasible region, infeasible region, bounded
and un- bounded regions.

Concepts
• Corner point method for solving linear
programming problem
• Solution of LPP having unbounded
feasible region
Activity 42.2 Corner points and solution
of a linear programming problem
Consider the Linear Programming Problem
Maximise z = x + 2y subject to the
constraints:
y-x≤1

x + 6y ≤ 15

4x - y ≤ 10

x ≥ 0, y ≥ 0

procedure

• We can construct the feasible region using

the input command :
y - x <=1&& x + 6y <= 15&&4x - y <= 10&& x >= 0&& y >= 0

A region named a is created.

• In the input bar type the command

Corner (a) to get the corner points.
Q. Identify the corner points which are part
of the feasible region.
Ans: A(1.29,2.29), B(0,1), C(3,2), D(2.5,0)
and E(0,0)
Q. Fill the following table :

Corner x y z = x + 2y
Point coordinate coordinate
A 1.29 2.29 5.86
B 0 1 2
C 3 2 7
D 2.5 0 2.5
E 0 0 0

Q. Which corner point of the polygon has

the largest value of z = x + 2y
Ans: C(3,2)
Q. Which corner point has the minimum
value of z = x + 2y
Ans: E(0,0) Is there any other point inside the feasible
region which can have a greater value of z
than that at the corner points. To check this
we do the following steps.

• Create a slider c with Min: -1, Max: 10 and

Increment: 0.1

• Draw the line x + 2y = c

• Set the value of c at 1 and observe whether

there is any points in the feasible region
satisfying the condition x + 2y = c

• Gradually increase the value of c until

there exist atleast one point of the feasible
region is on the line x + 2y = c .
Q. Identify that point and find the value of c
Ans: Point – C. Slider value = 7
Q. What is the maximum value of z in the
feasible region.
Ans: 7
 Activity 42.2 Infinite Solutions
In this activity we discuss a linear
programming problem having an infinite
number of solutions.
Consider the Linear Programming Problem
Maximise z = 3x + 9y subject to the
constraints :
x+3y ≤ 60
x + y ≥ 10
x≤y
x ≥ 0, y ≥ 0
Procedure
• Construct the feasible region using the
input command :
x+3y<=60&&x + y >=10&&x <= y&&
x >=0&&y >= 0.

• Find the corner points using the input

Q. Identify the corner points of the feasible command Corner(a)
region
Ans : (0,10) ,(0,20), (5,5) and (15,15)
Q. Find the values of z at the corner points
Corner x y z = 3x+9y
Point coordinate coordinate
(0,10) 0 10 90
(0,20) 0 20 180
(5,5) 5 5 60
(15,15) 15 15 180

Q. Note down the maximum value and the

points where this maximum value appears.
Ans : Maximum value = 180 occurs at
(0,20) and (15,15)
Q. Does the maximum occur at a single
point or multiple points?
Ans: At multiple points
 Is there any other point inside the feasible
region at which z is maximum?

To check this we do the following steps:

• Create a slider c with Min: 0, Max 200 and

Increment: 0.1

• Draw the line 3x +9y = c

• Increase the value of c until there is at least

one point of the feasible region is on line.
Q. What is the maximum value of c and
what happens to the line at this stage?
Ans: Maximum value of c = 180, the line
coincides with BC
Q. What does it infer about the points at
which z is maximum?
Ans: z is maximum at all points on the line
segment BC.
Q. Is there any relation between the slope of
the objective function with the slope of any
of the lines obtained from the constrains
Ans: Yes, slope of the objective function is
equal to slope of one of the constraint lines.
Activity 42.3 Unbounded feasible regions
Consider the linear programming problem :
Determine graphically the minimum and
maximum values of the objective function
z = 5x - 2y subject to the constraints:

procedure
Construct the feasible region.
Plot the corner points of the feasible region.
Q. Find the values of the objective function
at the corner points.
Ans:
Corner x y z = 5x-2y
Point coordinate coordinate
(0,5) 0 5 -10
(0,3) 0 3 -6
(1,0) 1 0 5
(6,0) 6 0 30

Q. Identify the corner points at which z is

maximum or minimum and find the values.
Ans: Minimum value = -10 at (0,5)
Maximum value = 30 at (6,0)
• Is there any other point inside the feasible
region at which z is maximum or minimum?
We can check this as follows.
• Create a slider c with Min: -15,
Max:100 and Increment: 0.5
• Draw the line 5x - 2y = c
• Change the value of c such that the line
passes through the corner point which gives
the maximum value.
• Increase the value of c further and observe
the portion of the line inside the feasible
region.
Q. Is there exists any higher value of c for
which the line lies completely outside the
feasible region.
Ans: No.
Q. What does it infer about the maximum
value of the objective function in the
feasible region.
Ans: We will not get a maximum value of
the objective function in the feasible region.
Q. What about the minimum value of the
objective function in the feasible region?
Ans: Minimum value = -10 at (0,5)