MCQs of Linear Programming

Linear Programming MCQs

MCQs of Linear Programming

Showing 1 to 10 out of 32 Questions

Objective function of an LP problem is

(a)	a constant
(b)	a function to be optimized
(c)	an inequality
(d)	a quadratic equation

The optimal value of the objective function is attained at the points

(a)	given by intersection of lines representing inequations with axes only
(b)	given by intersection of lines representing inequations with X-axis only
(c)	given by corner points of the feasible region
(d)	at the origin

Which of the following statements is correct ?

(a)	Every LP problem has at least one optimal solution.
(b)	Every LP problem has a unique solution.
(c)	If an LP problem has two optimal solutions, then it has infinitely many solutions.
(d)	If a feasible region is unbounded then LP problem has no solution

A feasible solution to an LP problem,

(a)	must satisfy all of the problem’s constraints simultaneously.
(b)	need not satisfy all of the constraints, only some of them.
(c)	must be a corner point of the feasible region.
(d)	must optimize the value of the objective function.

For the LP problem Minimize z = 2x + 3y the coordinates of the corner points of the bounded feasible region are A(3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z is

(a)	49
(b)	15
(c)	10
(d)	05

For the LP problem maximize z = 2x + 3y The coordinates of the corner points of the bounded feasible region are A(3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z is

(a)	72
(b)	80
(c)	82
(d)	70

Corner points of the bounded feasible region for an LP problem are (0, 4), (6, 0), (12, 0), (12, 16) and (0, 10). Let z=8x + 12y be the objective function.Match the following: (i) Minimum value of z occurs at _____ (ii) Maximum value of z occurs at _____ (iii) Maximum of z is _____ (iv) Minimum of z is _____

(a)	(i) (6, 0) (ii) (12, 0) (iii) 288 (iv) 48
(b)	(i) (0, 4) (ii) (12, 16) (iii) 288 (iv) 48
(c)	(i) (0, 4) (ii) (12, 16) (iii) 288 (iv) 96
(d)	(i) (6, 0) (ii) (12, 0) (iii) 288 (iv) 96

The corners points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5) (15, 15), (0, 20). Let z= px + qy, where p, q > 0.Condition on p and q so that the maximum of z occurs at both the points (15, 15) and (0, 20) is _____

(a)	p = q
(b)	p =2q
(c)	q = 2p
(d)	q = 3p

Solution of following LP problem Maximize z = 2 x + 6 y subject to - x + y \leq 1, 2 x + y \leq 2 and x \geq 0, y \geq 0 is

(a)	$\frac{4}{3}$
(b)	$\frac{1}{3}$
(c)	$\frac{26}{3}$
(d)	no feasible region

10.

Solution of following LP problem Minimize z = - 3 x + 2 y subject to 0 \leq x \leq 4, 1 \leq y \leq 6, x + y \leq 5 is

(a)	-10
(b)	0
(c)	2
(d)	10

Showing 1 to 10 out of 32 Questions