In a LPP, let R be the feasible region. A. If R is unbounded then a max./min. value of objective function may not exist. B. If R is bounded then a max. and min. value of objective function will always exist. C. If a solution exists, it must occur at a corner point. D. If R is bounded then max. will exist but min. may or may not exist for an objective function. Choose the correct answer from the options given below:

Question

Option 1: A, B, C only

Option 2: B only

Option 3: A, C only

Option 4: D, C only

AfterBoards · Accepted Answer

The answer is 'A, B, C only'. View full solution:

List - I	List - II
(A) The common region determined by all the constraints of LPP is called	(I) objective function
(B) Minimize $z = c_1x_1 + c_2x_2 + ..... + c_nx_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

CUET Mathematics 2023 23 May Shift 3 PYQs

Keyboard Shortcuts