Solveeit Logo

Question

Mathematics Question on Linear Programmig Problem

Match List I with List II

| LIST I| | LIST II
---|---|---|---
A.| The common region determined by all the constraints of LPP is called| I.| objective function
B.| Minimize z = C₁x1+C2x2+.....+Cnxn 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:

A

(A)-(I), (B)-(III), (C)-(IV), (D)-(II)

B

(A)-(II), (B)-(IV), (C)-(I), (D)-(III)

C

(A)-(III), (B)-(I), (C)-(IV), (D)-(II)

D

(A)-(IV), (B)-(III), (C)-(II), (D)-(I)

Answer

(A)-(III), (B)-(I), (C)-(IV), (D)-(II)

Explanation

Solution

The correct option is (C):(A)-(III), (B)-(I), (C)-(IV), (D)-(II)