Correct option is C
Let R be the feasible region for a Linear Programming problem and let z=zx+by be the objective function. If R is bounded, then the objective function z has both maximum and minimum values on R.
All Courses
Question
Let R be the feasible region for a Linear Programming problem and let z=zx+by be the objective function. If R is bounded, then the objective function z has :
Free Tests
Free
Must Attempt
CUET 2025 English Language Mock 01
English
50 Questions
200 Marks
45 Mins
EnglishSimilar Questions
- 1)A dealer wishes to purchase a number of fans and sewing machines. He has only ₹ 5,760.00 to invest and has space for at most 20 items. A fan costs ₹ 360.00 and a sewing machine ₹ 240.00. His expectation is that he can sell a fan at a profit of ₹ 22.00 and a sewing machine at a profit of ₹ 18.00. Assuming that he can sell all the items that he can buy, how should be invest his money in order to maximise the profit? If x denotes the number of fans and y the number of sewing machines. Then which of the following are correct constituents of the associated LPP.
- 2)Consider the LPP, Minimise Z=3x+2y subject to constraints:
then which of the following is correct? - 3)Consider the LPP, Min Z=2x-3y subject to the conditions
then the minimum value of the objective function is at the point - 4)The feasible region for the constrains x≥0, x+y≤1 and x-y≤1, is situated in :
(A) I and II Quadrant
(B) I Quadrant
(C) II and IV Quadrant
(D) IV Quadrant
(E) I, II, III and IV Quadrant
Choose the correct answer from the options given below: - 5)Which constraint correctly represents the situation “Mixture of x and y must be at least 8 units”?
- 6)Corner points of the feasible region for a linear programming problem are (0,2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. Then the minimum value of F occurs at:
- 7)Let R be the feasible region for a Linear Programming problem and let z=zx+by be the objective function. If R is bounded, then the objective function z has :
- 8)The corner points of the feasible region determined by the system of Linear Constraints are (0, 3), (1, 2) and (3, 0), Let z = px + qy, where p, q > 0, be the objective function. Find the condition on p and q so that the minimum of z occurs at (3, 0) and (1, 2):
- 9)If the corner points of Linear Programming Problem having objective function Max z = 2x + y are O(0, 0), A(30, 0), B(20, 30), C(0, 50), then the optimal value will be at the point:
- 10)The feasible region represented by the constraints of the linear programming problem:
x+y≤6, y≤7, x≥4, x, y≥0
