In linear programming, the optimal value of the objective function is attained at the points given by Option 1: intersection of the inequalities with the x-axis only Option 2: intersection of the inequalities with the axes only Option 3: corner points of the feasible region Option 4: intersection of the inequalities with the y-axis only

The answer is 'corner points of the feasible region'. View full solution:

CUET Mathematics - In linear programming, the optimal value of the objective function is attained at the points given by | PYQs + Solutions

CUET Mathematics 2022 30 Aug Shift 1

Algebra

Easy

intersection of the inequalities with the x-axis only

intersection of the inequalities with the axes only

corner points of the feasible region

intersection of the inequalities with the y-axis only

✅ Correct Option: 3

Related questions:

21 May Shift 1

Consider a L.P.P, Maximize $Z = 3x + 5y$ subject to constraints $2x + 6y ≤ 6$ , $x - y ≥ 0$ , $x ≥ 0$ , $y ≥ 0$ . Then which of the following are true?

(A) The feasible region of L.P.P is bounded region

(B) The corner points of the feasible region are (0, 0), (2, 2), (0, 1)

(D) Point (1, 3) lies in the feasible region

Choose the correct answer from the options given below:

7 Aug Shift 2

The corner points of the feasible region determined by inequalities of LPP are $(4, 10)$ , $(6, 8)$ and $(6, 5)$ . Let $z = 3x + 4y$ be the objective function. Then the sum of maximum value of z and minimum value of z is :

30 May Shift 1

The corner points of the bounded feasible region associated with the LPP: Maximize $Z=px+qy$ , $p,q>0$ are $(0, 0)$ , $(3.5, 0)$ , $\left(\frac{112}{59}, \frac{135}{59}\right)$ and $(0, 3)$ . If the optimum value of Z occurs at both $\left(\frac{112}{59}, \frac{135}{59}\right)$ and $(0, 3)$ , then

CUET Mathematics 2022 30 Aug Shift 1 PYQs

Keyboard Shortcuts