Linear Programming Test

Result

Linear Programming Test - 10

Score
-
out of -
Rank
-
out of -

TIME Taken - -

SHARING IS CARING

If our Website helped you a little, then kindly spread our voice using Social Networks. Spread our word to your readers, friends, teachers, students & all those close ones who deserve to know what you know now.

Weekly Quiz Competition

Question 1
1 / -0

The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is Z = 4x + 3y

Compare the quantity in Column A and Column B

Column A Column B

Maximum of Z 325

A
The quantity in column A is greater

B
The quantity in column B is greater

C
The two quantities are equal

D
The relationship can not be determined on the basis of the information supplied

Solution

Corner Points Corresponding value of Z = 4x + 3y

(0,0)

(0.40)

(20,40)

(60,20)

(60,0)

0

120

200

300 (maximum)

240

Hence, maximum value of Z = 300 < 325.

So, the quantity in column B is greater.

Question 2

1 / -0

Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. The Minimum value of F occurs at

(0, 2) only

(3, 0) only

The mid point of the line sgment joining the points (0, 2) and (3, 0) only

Any point on the line segment joining the points (0, 2) and (3, 0)

Solution

Corner Points

Corresponding value of F = 4x + 6y

(0,2)

(3,0)

(6,0)

(6,8)

(0,5)

12 (minimum)

72 (maximum)

Hence, minimum value of F occurs at any points on the line segment joining the points (0, 2) and (3, 0).

Question 3