12.

Graphical Method

Theory at a Glance (For IES, GATE, PSU)

What is LPP (Q-ESE)

Linear programming is a technique which allocates scare available resources under
conditions of certainty in an optimum manner, (i.e. maximum or minimum) to achieve the
company objectives which may be maximum overall profit or minimum overall cost.
Linear programming deals with the optimization (maximization or minimization) of linear
functions subjects to linear constraints.

One L.P.P
Maximize (z) = 3x1 + 4x2 (i)
Subject to 4x1 + 2x2 ≥ 80 (ii)
2x1 + 5x2 ≤ 180 (iii)
x1, x2 ≥ 0 (iv)

1. The variables that enter into the problem are called decision variables. e.g., x1, x2.
2. The expression showing the relationship between the manufacture's goal and the
decision variables is called the objective function. e.g. z = 3x1 + 4x2 (maximize).
3. The inequalities (ii); (iii); (iv) are called constraints being all linear, it is a linear
programming problem (L.P.P).This is an example of a real situation from industry.

Graphical Method
Working Procedure:
Step-1: Formulate the given problem as a linear programming problem.
Step-2: Plot the given constraints as equalities on x1.x2 co-ordinate plane and determine
the convex region formed by them.
[A region or a set of points is said to be convex if the line joining any two of its
points lies completely in the region (or the set)]
Step-3: Determine the vertices of the convex region and find the value of the objective
function and find the value of the objective function at each vertex. The vertex
which gives the optimal value of the objective function gives the desired optimal
solution the problem.

Otherwise:
Draw a dotted line through the origin representing the objective function with z = 0. As z is
increased from zero, this line moves to the right remaining parallel to itself. We go on
sliding this line (parallel to itself), till it is farthest away from the origin and passes
through only one vertex on the convex region. This is the vertex where the maximum value
of z is attained.
When it is required to minimize zn value z is increased till the dotted line passes through
the nearest vertex of the convex region.
Example: Maximize z = 3x1 + 4x2

Page 210 of 318

 Graphical Method
S K Mondal Chapter 12
Subject to 4x1 + 2x2 ≥ 80
2x1 + 5x2 ≤ 180
x1, x2 ≥ 0
1.

D
> Unique optimal Sol..h
B

2X2+5X2=180

L AX1+2X =80
2

A C

M
Here farthest point B(2.5, 35) therefore it is the solution
x1 = 2.5, x2 = 35 and zmax = 147.5

2. Note: dotted line parallel to the line LM is called the iso-cost line since it
represents all possible combinations of x1, x2 which produce the same total cost.

3. A minimization problem

(II) Redundant Constraint

is present
B

B is solution but this is redundant Constraint as it dominated by another two

constraints.

Page 211 of 318

 Graphical Method
S K Mondal Chapter 12
4.

LMIIAB So infinite
number of sol..”

5.

It is a maximization problem:
but region is not bounded so
Here Unbounded Sol..”

6.

Here the constraints were incompatible. So, there is no solution.

Page 212 of 318

 Graphical Method
S K Mondal Chapter 12

OBJECTIVE QUESTIONS (GATE, IES, IAS)

Previous 20-Years GATE Questions

GATE-1. The first algorithm for Linear Programming was given by:
[GATE-1999]
(a) Bellman (b) Dantzig (c) Kulm (d) Van Neumann

GATE-2. If at the optimum in a linear programming problem, a dual variable

corresponding to a particular primal constraint is zero, then it
means that [GATE-1996]
(a) Right hand side of the primal constraint can be altered without affecting
the optimum solution
(b) Changing the right hand side of the primal constraint will disturb the
optimum solution
(c) The objective function is unbounded
(d) The problem is degenerate

GATE-3. Consider the following Linear Programming Problem (LPP):

Maximize z = 3x1 + 2x2 [GATE -2009]
Subject to x1 ≤ 4
x2 ≤ 6
3x1 + x2 ≤ 18
x2 ≥ 0, x2 ≥ 0
(a) The LPP has a unique optimal solution
(b) The LPP is infeasible
(c) The LPP is unbounded
(d) The LPP has multiple optimal solutions.

Graphical Method
GATE-4. A manufacturer produces two types of products, 1 and 2, at
production levels of x1 and x2 respectively. The profit is given is
2x1 + 5x2. The production constraints are: [GATE-2003]
x1 + 3x2 ≤ 40 3x1 + x2 ≤ 24
x1 + x2 ≤ 10 x1 > 0, x2 > 0
The maximum profit which can meet the constraints is:
(a) 29 (b) 38 (c) 44 (d) 75

Statement for Linked Answer Questions Q5 and Q6:

Consider a linear programming problem with two variables and two constraints.
The objective function is: Maximize X1+ X2. The corner points of the feasible
region are (0, 0), (0, 2) (2, 0) and (4/3, 4/3) [GATE-2005]

GATE-5. If an additional constraint X1 + X2 ≤ 5 is added, the optimal solution

is:

Page 213 of 318

 Graphical Method
S K Mondal Chapter 12
⎛5 5⎞ ⎛4 4⎞ ⎛5 5⎞
(a) ⎜ , ⎟ (b) ⎜ , ⎟ (c) ⎜ , ⎟ (d) (5, 0)
⎝3 3⎠ ⎝3 3⎠ ⎝ 2 2⎠

GATE-6. Let Y1 and Y2 be the decision variables of the dual and v1 and v2 be
the slack variables of the dual of the given linear programming
problem. The optimum dual variables are:
(a) Y1 and Y2 (b) Y1 and v1 (c) Y1 and v2 (d) v1 and v2

Previous 20-Years IES Questions

IES-1. Which one of the following is the correct statement? [IES-2007]
In the standard form of a linear programming problem, all
constraints are:
(a) Of less than or equal to, type.
(b) Of greater or equal to, type.
(c) In the form of equations.
(d) Some constraints are of less than equal to, type and some of greater than
equal to, type.

IES-2. Match List-I with List-II and select the correct answer using the
codes given below the lists: [IES-1995]
List-I List-II
A. Linear programming 1. Ritchie
B. Dynamic programming 2. Dantzig
C. 'C' programming 3. Bell
D. Integer programming 4. Gomory
Codes: A B C D A B C D
(a) 2 1 4 3 (b) 1 2 3 4
(c) 2 3 1 4 (d) 2 3 4 1

IES-3. A feasible solution to the linear programming problem should

(a) Satisfy the problem constraints [IES-1994]
(b) Optimize the objective function
(c) Satisfy the problem constraints and non-negativity restrictions
(d) Satisfy the non-negativity restrictions

IES-4. Consider the following statements: [IES-1993]

Linear programming model can be applied to:
1. Line balancing problem 2. Transportation problem
3. Project management
Of these statements:
(a) 1, 2 and 3 are correct (b) 1 and 2 are correct
(c) 2 and 3 are correct (d) 1 and 3 are correct.

IES-5. Solution to Z = 4x1 + 6x2 [IES-1992]

x1 + x2 ≤ 4; 3 x1 + x2 ≤ 12; x1 , x2 ≥ 0 is:
(a) Unique (b) Unbounded (c) Degenerate (d) Infinite
IES-6. The primal of a LP problem is maximization of objective function
with 6 variables and 2 constraints. [IES-2002]
Which of the following correspond to the dual of the problem
stated?

Page 214 of 318

 Graphical Method
S K Mondal Chapter 12
1. It has 2 variables and 6 constraints
2. It has 6 variables and 2 constraints
3. Maximization of objective function
4. Minimization of objective function
Select the correct answer using the codes given below:
(a) 1 and 3 (b) 1 and 4 (c) 2 and 3 (d) 2 and 4

Graphical Method
IES-7. In a linear programming problem, which one of the following is
correct for graphical method? [IES-2009]
(a) A point in the feasible region is not a solution to the problem
(b) One of the corner points of the feasible region is not the optimum
solution
(c) Any point in the positive quadrant does not satisfy the non-negativity
constraint
(d) The lines corresponding to different values of objective functions are
parallel

IES-8. In case of solution of linear programming problem using graphical

method, if the constraint line of one of the non-redundant
constraints is parallel to the objective function line, then it
indicates [IES-2004, 2006]
(a) An infeasible solution (b) A degenerate solution
(c) An unbound solution (d) A multiple number of optimal
solutions

IES-9. Which of the following are correct in respect of graphically solved

linear programming problems? [IES-2005]
1. The region of feasible solution has concavity property.
2. The boundaries of the region are lines or planes.
3. There are corners or extreme points on the boundary
Select the correct answer using the code given below:
(a) 1 and 2 (b) 2 and 3 (c) 1 and 3 (d) 1, 2 and 3

IES-10. Which one of the following statements is NOT correct? [IES-2000]

(a) Assignment model is a special ease of a linear programming problem
(b) In queuing models, Poisson arrivals and exponential services are
assumed
(c) In transportation problems, the non-square matrix is made square by
adding a dummy row or a dummy column
(d) In linear programming problems, dual of a dual is a primal
IES-11. Consider the following statements regarding the characteristics of
the standard form of a linear programming problem: [IES-1999]
1. All the constraints are expressed in the form of equations.
2. The right-hand side of each constraint equation is non-negative.
3. All the decision variables are non-negative.
Which of these statements are correct?
(a) 1, 2 and 3 (b) 1 and 2 (c) 2 and 3 (d) 1 and 3

Page 215 of 318

 Graphical Method
S K Mondal Chapter 12

IES-12. A variable which has no physical meaning, but is used to obtain an

initial basic feasible solution to the linear programming problem is
referred to as: [IES-1998]
(a) Basic variable (b) Non-basic variable
(c) Artificial variable (d) Basis

IES-13. Which of the following conditions are necessary of applying linear

programming? [IES-1992]
1. There must be a well defined objective function
2. The decision variables should be interrelated and non-negative
3. The resources must be in limited supply
(a) 1 and 2 only (b) 1 and 3 only (c) 2 and 3 only (d) 1, 2 and 3

IES-14. If m is the number of constraints in a linear programming with two

variables x and y and non-negativity constraints x ≥ 0, y ≥ 0; the
feasible region in the graphical solution will be surrounded by how
many lines? [IES-2007]
(a) m (b) m + 1 (c) m + 2 (d) m + 4

IES-15. Consider the following linear programming problem: [IES-1997]

Max. Z = 2A + 3B, subject to A + B < 10, 4A + 6B < 30, 2A + B < 17,
A, B ≥ 0.
What can one say about the solution?
(a) It may contain alternative optima
(b) The solution will be unbounded
(c) The solution will be degenerate
(d) It cannot be solved by simplex method

Page 216 of 318

 Graphical Method
S K Mondal Chapter 12

Answers with Explanation (Objective)

Previous 20-Years GATE Answers

GATE-1. Ans. (b)
GATE-2. Ans. (c)
GATE-3. Ans. (a)
x1 x2 x1 x2
GATE-4. Ans. (a) Rearranging the above equations + ≤1, + ≤ 1 and
40 ⎛ 40 ⎞ 8 24
⎜ 3 ⎟
⎝ ⎠
x1 + x2 ≤ 1. Draw the lines and get solution.
GATE-5. Ans. (b)
GATE-6. Ans. (d)

Previous 20-Years IES Answers

IES-1. Ans. (c)

IES-2. Ans. (c)
IES-3. Ans. (c) A feasible solution to the linear programming problem should satisfy the
problem constraints.
IES-4. Ans. (b) Linear programming model can be applied to line balancing problem and
transportation problem but not to project management.
IES-5. Ans. (a) X1 + X 2 = 4
3 X1 + X 2 = 12
−2 X1 = −8 ⇒ X1 = 4 and X2 = 0
IES-6. Ans. (b)
IES-7. Ans. (a)
IES-8. Ans. (d) All points on the line is a solution. So there are infinite no of optimal
solutions.
IES-9. Ans. (b)
IES-10. Ans. (c)
IES-11. Ans. (a)
IES-12. Ans. (c)
IES-13. Ans. (d)

Page 217 of 318

 Graphical Method
S K Mondal Chapter 12
IES-14. Ans. (c) Constraints = 3 the
feasible region is
surrounded by more
two lines x-axis and y-
axis.

IES-15. Ans. (a)

Page 218 of 318

 Graphical Method
S K Mondal Chapter 12

Conventional Questions with Answer

Conventional Question [ESE-2007]
Two product A and B are to be machined on three machine tools, P, Q and R.
Product A takes 10 hrs on machine P, 6 hrs on machine Q and 4 hrs on
machine R. The product B takes 7.5 hrs on machine P, 9 hrs on machine Q and
13 hrs on machine R. The machining time available on these machine tools, P,
Q, R are respectively 75 hrs, 54 hrs and 65 hrs per week. The producer
contemplates profit of Rs. 60 per product A, and Rs. 70 per product B.
Formulate LP model for the above problem and show the feasible solutions to
the above problem? Estimate graphically/ geometrically the optimum product
mix for miximizing the profit. Explain why one of the vertics of the feasible
region becomes the optimum solution point.
(Note: Graph sheet need not be used) [15-Marks]

Solution: The given data are tabulated as follows:

Machine No. Time taken for Time taken for Available hours
operation on A operation on B per week
P 10 7.5 75
Q 6 9 54
R 5 13 65
Let x1 = number of A to be machined
x2 = number of B to be machined, for profit maximization.
Problem formulation:
(i) Restriction on availability of machines for operation.
(a) If only A were operated on machine P
Then, x1 ≤ 75 / 10
10x1 ≤ 75
(b) If only B were operated on machine P then, 7.5x2 ≤ 75
Since, both A and B are operated on machine P
∴ 10x1 + 7.5x2 ≤ 75 … (i)
Similarly, 6x1 + 9x2 ≤ 54 … (ii)
And 5x1 + 13x2 ≤ 65 … (iii)
Now, profit equation:
Profit fper product A = Rs.60 and profit per product B = Rs. 70
∴Total profit is 60x1 + 70x2
∴Objective function which is to be maximized is
Z = 60x1 + 70x2

Page 219 of 318

 Graphical Method
S K Mondal Chapter 12
x2

(0,10)

|
|
|
|
|
(0,6)

|
(0,5) A

|
•

|
B

|
•C

|
(13,0)
D | •| •|

|
| | | | | | | | | |
0 (7.5,0) (9,0) x1
(iii)
(ii)

(i)
OABCD in the graph is feasible reagion
On solving equation (ii) and (iii) we get co-ordinates of B
∴ B ≡ ( 3.5454,3.6363 )
On solving equation (i) and (ii) we get co-ordinates of C
∴ C ≡ ( 6, 2 )
And A ≡ ( 0,5 ) ; D ≡ ( 7.5, 0 )
Now,
Z ( A ) = 60 × 0 + 70 × 5 = 350
Z ( B ) = 60 × 3.5454 + 70 × 3.6363 = 467.265
Z ( C ) = 60 × 6 + 70 × 2 = 500
Z ( D ) = 60 × 7.5 + 70 × 0 = 450
Hence optimum solution is A = 6 and B = 2

Page 220 of 318