Mathematics Crash Course MHT-CET>Chapter 12 - Linear Programming Problems>Exercise 1>Q 58

MEDIUM

MHT-CET

IMPORTANT

Earn 100

The point at which the maximum value of $Z = 3 x + 2 y$ subject to the constraints $x + y \leq 2, x \geq 0, y \geq 0$ obtained is

100% studentsanswered this correctly

Important Questions on Linear Programming Problems

EASY

MHT-CET

IMPORTANT

Mathematics Crash Course MHT-CET>Chapter 12 - Linear Programming Problems>Exercise 1>Q 59

The objective function

Z = 30 x + 20 y

, subject to constraints

x + y \leq 8, x + 2 y \geq 4, 6 x + 4 y \geq 12, x \geq 0, y \geq 0

, has

HARD

MHT-CET

IMPORTANT

Mathematics Crash Course MHT-CET>Chapter 12 - Linear Programming Problems>Exercise 1>Q 60

The minimum value of the objective function

z = 2 x + 10 y

for linear constraints

x \geq 0, y \geq 0, x - y \geq 0, x - 5 y \leq - 5

is

EASY

MHT-CET

IMPORTANT

Mathematics Crash Course MHT-CET>Chapter 12 - Linear Programming Problems>Exercise 1>Q 61

The corner points of the feasible region are

A (50, 50), B (10, 50), C (60, 0)

and

D (60, 40)

. The objective function is

P = \frac{5}{2} x + \frac{3}{2} y + 410 .

The minimum value of

P

is at point

EASY

MHT-CET

IMPORTANT

Mathematics Crash Course MHT-CET>Chapter 12 - Linear Programming Problems>Exercise 1>Q 62

Maximize $z = 2 x + 5 y$ subject to constraints $x + y \leq 4, 3 x + 3 y \geq 18 x, y \geq 0$ . The feasible region is shaded in the following graph. Find the point at which maximum value of $z$ occurs

Question Image

EASY

MHT-CET

IMPORTANT

Mathematics Crash Course MHT-CET>Chapter 12 - Linear Programming Problems>Exercise 1>Q 63

The feasible region for an $LPP$ is shown shaded in the figure. Find the minimum value of the objective function $z = 11 x + 7 y$ .

Question Image