Linear Programming Test

Result

Linear Programming Test - 9

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

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. Maximum of F – Minimum of F =

18

48

60

42 Solution

Here the objective function is given by : F = 4x +6y .

Corner points	Z = 4x +6 y
(0, 2 )	12………………..(Min.)
(3,0)	12………………….(Min.)
(6,0 )	24
(6 , 8 )	72
(0 , 5 )	30

Maximum of F – Minimum of F = 72 – 12 = 30 .

Question 2
1 / -0

Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px+qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is

A
p = q

B
p = q/2

C
p = 3q

D
p = 2q

Solution

We have Z = px + qy , At ( 3, 0 ) Z = 3p ……………………………….(1)

At ( 1 , 1) Z = p + q …………………………(2) Therefore , from (1) and (2) : We have : p = q/2 .
Question 3
1 / -0

In a LPP, the linear inequalities or restrictions on the variables are called

A
Inequalities

B
Limits

C
Constraints

D
Linear constraints

Solution

In a LPP, the linear inequalities or restrictions on the variables are called Linear constraints.