Linear Programming by the Corner-Point Method, Quiz

According to the corner-point theorem, if an optimal value of a linear objective exists, it occurs

A at a corner point of the feasible region

B at the centre of the feasible region

C at the origin

D anywhere on the

x

-axis

Maximise

Z = 3x + 4y

subject to

x + y \le 6

,

x \le 4

,

x, y \ge 0

.

A

28

at

(4, 4)

B

20

at

(4, 2)

C

12

at

(4, 0)

D

24

at

(0, 6)

Minimise

Z = 2x + y

subject to

x + y \ge 5

,

x + 2y \ge 6

,

x, y \ge 0

.

A

12

at

(6, 0)

B

0

at

(0, 0)

C

5

at

(0, 5)

D

9

at

(4, 1)

The feasible region of a linear programming problem is

A the point where

Z

is largest

B the region where

Z > 0

C the set of corner points only

D the set of points satisfying all the constraints

A workshop makes

x

toys of type A (profit ₹

20

each) and

y

toys of type B (profit ₹

30

each). The objective function for total profit is

A

Z = 20x + 30y

B

Z = 20x \cdot 30y

C

Z = 50(x + y)

D

Z = 30x + 20y

Menu

Linear Programming by the Corner-Point Method, Quiz

More practice