By the fundamental theorem of linear programming, when the feasible region is bounded, the optimal value of a linear objective function is attained at one of the corner (vertex) points of the feasible region.
In linear programming, the optimal value of the objective function is attained at the points given by
CUET UG 2022 — Mathematics Algebra
2022mcqeasy
In linear programming, the optimal value of the objective function is attained at the points given by
Official previous-year question
Held on 30 Aug 2022 · Verified 13 Jul 2026.
Options
- A
intersection of the inequalities with the x-axis only
- B
intersection of the inequalities with the axes only
- C
corner points of the feasible region
- D
intersection of the inequalities with the y-axis only
Did you get this right?
Sign in to track your attempts and accuracy.
Your note
Sign in to keep a private note on this question. Nothing you write is ever public.
CUET UG Algebra in other years
More CUET UG Algebra questions
If f(x) = 2x + 3, then f⁻¹(x) is:
2026easy
A relation R in the set A = {1, 2,3, 4} is given by R = {(1,1), (2,2), (1,2), (2,3), (3,4), (4,4), (1,3), (2,4), (1,4)} is
2025medium
If $P(A) = \frac{3}{5}$, $P(B) = \frac{1}{2}$ and $P(A \cap B) = \frac{1}{4}$, then $P(\overline{A} | \overline{B})$ is
2025medium
The maximum value of a LPP $z = 3x + 4y$ subject to the constraints: $x + y \leq 6$, $x \geq 0$, $y \geq 0$ is:
2025medium
Match List-I with List-II | List-I | List-II | |---|---| | (A) The number of possible matrices of order 3x3 with each entry 1 or 0 | (I) $2^4$ | | (B) The number of possible matrices of order 2x3 with each entry 1 or 0 | (II) $2^9$ | | (C) The number of possible matrices of order 2x3 with each entry 0,1,2 | (III) $2^6$ | | (D) The number of possible matrices of order 2x2 with each entry 1 or 0 | (IV) $3^6$ | Choose the correct answer from the options given below:
2025medium
Other Mathematics topics for CUET UG
Keep practicing Algebra
Work through every CUET UG Algebra PYQ, year by year.