LINEAR PROGRAMMING PROBLEMS

Maximize Z = 5x + 3y Maximize Z = 9x + 3y
Subject to Subject to

x, y 0 x, y 0
Minimize Z = 18x + 10y Maximize Z = 50x + 30y.
Subject to Subject to
4x + y 20 2x + y 18
2x + 3y 30
x, y 0 x, y 0
Maximize Z = 4x + 3y Maximize Z = 15x + 10y
Subject to Subject to

x, y 0

x, y 0
Maximize Z = 10x + 6y Maximize Z = 3x + 4y
Subject to Subject to

x, y 0 x, y 0
Maximize Z = 7x + 10y Minimize Z= 2x + 4y
Subject to Subject to
x+y 8
x + 4y 12
x 6000 x 3, y 2
x y
x, y 0
Minimize Z = 5x + 3y Minimize Z = 30x + 20y
Subject to Subject to
2x + y 10
x + 3y 15 x + 4y 12
5x + 8y = 20
x, y 0
x, y 0
Maximize Z = 4x + 3y Minimize Z = x-5y + 20
Subject to Subject to
x-y 0
- x + 2y 2
x 3

x, y 0 x, y 0
Study Centre : 59 MLB Colony, Padav, Gwalior
78
 Maximize Z = 3x + 5y Minimize Z = 3x1 + 5x2
Subject to Subject to
x1 + 3x2 3
x1 + x2 2
x1, x2 0
x, y 0

Maximize Z = 2x + 3y Maximize Z = -x1 + 2x2

Subject to Subject to
x+y 1 - x1 + 3x2
10x + y 5 x1 + x2
x + 10 y 1 x1 - x2
x, y 0 x1, x2 0

Maximize Z = x + y Maximize Z = 3x1 + 4x2, if possible,

Subject to Subject to the constraints
- x1 - x2 - 1
- x1 + x2
x1, x2 0
x, y 0

Maximize Z = 3x + 3y, if possible, Subject to the constraints

x-
x+y 3
x, y 0

Show the solution zone of the following inequalities on a graph paper:

5x + y 10
x+y 6
x + 4y 12
x 0, y 0.
Find x and y for which 3x + 2y is minimum subject to these inequalities. Use a graphical method.

Find the maximum and minimum value of 2x + y subject to the constraints:

x + 3y 6, x - - 5, x, y 0.

Find the minimum value of 3x + 5y subject to the constraints - 3, x -

0.

. Solved the following linear programming problem graphically: Maximize Z = 60x + 15y
Subject to constraints

x, y 0

Study Centre : 59 MLB Colony, Padav, Gwalior

79
 20 45 235
x y Z . x = 2/7,y = 29/7,Z = 15 . x = 3,y = 8, Min. Z = 134
19 19 19

24 27
x = 10, y = 2, Z = 560 x ,y , Z 24
7 7

80 4
x , y 0, Z 400 or x = 5,y = , Z = 24 x = 20, y = 10, Z = 400
3 3

x = 1, y = 6, Z = 56 x = 20, y = 20, Z = 140 x = 18000, y = 12000, Z = 246000

4 15
. x = 4,y = 2,Z = 16 x = 3,y = 4,Z = 27 x ,y , Z 60
7 7

24 24 4
. x ,y , Z 24 x = 4,y = 4, Z = 4; x = 5, y = , Z = 24.
7 7 3

20
. x = 10, y = 5, Z = 55 7 17. 2 18. .3 20. Does not exist
3

. Max value is infinity i.e. the solution is unbounded 22. x = 1, y = 5, Z = 13

43 84 15
. Max. = x atx ,y x = 20,y = 30, Z = 1650
3 13 3

Study Centre : 59 MLB Colony, Padav, Gwalior

80
The solution set of the inequation 2 x + y > 5 is
(a) half plane that contains the origin (b) open half plane not containing the origin
(c) whole xy-plane except the points lying on the line 2 x + y = 5.
(d) none of these
Objective function of a LPP is
(a) a constraint (b) a function to be optimized
(c) a relation between the variables (d) none of these

Which of the following sets are convex?

(a) {(x, y): x2 + y2 1} (b) {(x, y): y2 x)
(c) {(x, y): 3 x2 + 4y2 5} (d) {(x, y) :y
Let X1 and X2 are optimal solutions of a LPP, then
(a) X = X1 + (1 - ) X2, R is also an optimal solution
(b) X = X1 + (1 - X) X2
(c) X = X1 + (1 + ) X2
(d) X = X1 + (1 + ) X2 , R gives an optimal solution
The maximum valu 10; x, y 0 is
(a) 36 (b) 40 (c) 20 (d) none of these
The optimal value of the objective function is attained at the points
(a) given by intersection of inequations with the axes only
(b) given by intersection of inequations with x-axis only
(c) given by corner points of the feasible region
(d) none of these
The maximum value of Z = 4x + 3y subjected to the constraints 3x + 2y 160, 5 x + 2 y 200, x + 2
y 80; x, y 0 is
(a) 320 (d) 300 (c) 230 (d) none of these
Consider a LPP given by Min Z = 6x + 10 y
Subjected to x 6; y 2; 2 x + y 10; x, y 0
Redundant constraints in this LPP are
(a) x 0, y 0 (b) x 6, 2x + y 10 (c) 2 x + y 10 (d) none of these

0
(a) at only one point (b) at two points only
(c) at an infinite number of points (d) none of these
If the constraints in a linear programming problem are changed
(a) the problem is to be re-evaluated (b) solution is not defined
(c) the objective function has to be modified (d) the change in constraints is ignored
Which of the following statements is correct?
(a) Every LPP admits an optimal solution (b) A LPP admits unique optimal solution
(c) If a LPP admits two optimal solutions it has an infinite number of optimal solutions
(d) The set of all feasible solutions of a LPP is not a converse set

Study Centre : 59 MLB Colony, Padav, Gwalior

81
Which of the following is not a convex set?
(a) {(x, y): 2x + 5y < 7} (b) {(x, y): x2 + y2
(c) {x : | x| = 5} (d) {(x, y): 3x2 + 2y2

By graphical method, the solution of linear programming problem Maximize Z = 3x 1 + 5x2

Subject to 3x1 + 2x2 1 2 1 0, x2 0, is
(a) x1 = 2, x2 = 0, Z = 6 (b) x1 = 2, x2 = 6, Z = 36
(c) x1 = 4, x2 = 3, Z = 27 (d) x1 = 4, x2 = 6, Z = 42

The region represented by the inequation system x, y

(a) unbounded in first quadrant (b) unbounded in first and second quadrants
(c) bounded in first quadrant (d) none of these

x, y 0 is obtained, is
(a) (30, 25) (b) (20, 35) (c) (35, 20) (d) (40, 15)

The value of objective function is maximum under linear constraints

(a) at the centre of feasible region (b) at (0,0)
(c) at any vertex of feasible region (d) the vertex which is maximum distance from (0, 0)

The corner points of the feasible region determined by the following system of linear inequalities:
0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p,q 0.
Condition on p and q so that the maximukm of Z occurs at both (3, 4) and (0, 5) is
(a) p = q (b) p = 2q (c) p = 3q (d) q = 3p

Study Centre : 59 MLB Colony, Padav, Gwalior

82