ExamBro
ExamBro
CUET · MATHS · PYQ PAPER 2023

Match List - I with List - II.
List - IList - II
(A) The common region determined by all the constraints of LPP is called(I) objective function
(B) Minimize \(z=c_1 x_1+c_2 x_2+\cdots+c_n x_n\) is(II) convex set
(C) A solution that also satisfies the non-negative restrictions of a LPP is called(III) feasible region
(D) The set of all feasible solutions of a LPP is a(IV) feasible solution
Choose the correct answer from the options given below :

  1. A \((A)-(I),(B)-(I I I),(C)-(I V),(D)-(I I)\)
  2. B \((A)-(I I),(B)-(I V),(C)-(I),(D)-(I I I)\)
  3. C \((A)-(I I I),(B)-(I),(C)-(I V),(D)-(I I)\)
  4. D \((A)-(I V),(B)-(I I I),(C)-(I I),(D)-(I)\)
Verified Solution

Answer & Solution

Correct Answer

(C) \((A)-(I I I),(B)-(I),(C)-(I V),(D)-(I I)\)

Step-by-step Solution

Detailed explanation

(A) → (III): The common region determined by all constraints is the feasible region. (B) → (I): The linear function \(z=c_1 x_1+c_2 x_2+\cdots+c_n x_n\) to be optimized is the objective function. (C) → (IV): Any point satisfying all constraints and non-negativity restrictions is…
From CUET
Explore more questions on app