Achieve CUET (UG) Mathematics Practice Book>Chapter 12 - Linear Programming>Exercise>Q 66

HARD

CUET (UG)

IMPORTANT

Earn 100

The feasible region for a $L P P$ is shown in Figure. Find the minimum value of $Z = 11 x + 7 y .$

50% studentsanswered this correctly

Important Questions on Linear Programming

HARD

CUET (UG)

IMPORTANT

Achieve CUET (UG) Mathematics Practice Book>Chapter 12 - Linear Programming>Exercise>Q 67

Find the maximum value of

Z = x + y

subject to

x + 4 y \leq 8, 2 x + 3 y \leq 12, 3 x + y \leq 9, x \geq 0, y \geq 0 .

HARD

CUET (UG)

IMPORTANT

Achieve CUET (UG) Mathematics Practice Book>Chapter 12 - Linear Programming>Exercise>Q 68

Determine the maximum value of

Z = 11 x + 7 y

subject to the constraints:

2 x + y \leq 6, x \leq 2, x \geq 0, y \geq 0

.

HARD

CUET (UG)

IMPORTANT

Achieve CUET (UG) Mathematics Practice Book>Chapter 12 - Linear Programming>Exercise>Q 69

Find the maximum and minimum values of $Z = 2 x + y$ , subject to the constraints

$x + 3 y \geq 6, x - 3 y \leq 3, 3 x + 4 y \leq 24,$

$- 3 x + 2 y \leq 6, 5 x + y \geq 5, x \geq 0 and y \geq 0 .$

HARD

CUET (UG)

IMPORTANT

Achieve CUET (UG) Mathematics Practice Book>Chapter 12 - Linear Programming>Exercise>Q 70

Find the Maximum value of the function

Z = 11 x + 7 y,

subject to the constraints:

x \leq 3, y \leq 2, x \geq 0, y \geq 0

.