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
Held on 30 Aug 2022 · Verified 13 Jul 2026.
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
Sign in to track your attempts and accuracy.
Sign in to keep a private note on this question. Nothing you write is ever public.
If f(x) = 2x + 3, then f⁻¹(x) is:
If a random variable $X$ has the following probability distribution: | X | 0 | 1 | 2 | 3 | 4 | |---|---|---|---|---|---| | P(X) | k | 2k | 3k | k² | 6k² | , then Match List-I with List-II | List-I | List-II | |---|---| | (A) k | (I) 3/7 | | (B) $P(X < 2)$ | (II) 6/49 | | (C) $P(X > 3)$ | (III) 1/7 | | (D) $P(2 \leq X \leq 3)$ | (IV) 22/49 | Choose the correct answer from the options given below:
If the roots of the equation x² - 5x + k = 0 are in the ratio 2:3, then the value of k is:
It is known that 3% of plastic bags manufactured in a factory are defective. Using the Poisson distribution on a sample of 100 bags, the probability of at most one defective bag is:
If R and S are two equivalence relations on a set A, then
Work through every CUET UG Algebra PYQ, year by year.