Class 12 Mathematics Chapter 12 Linear Programming Quiz 18 (25 MCQs)

Quiz Instructions

Select an option to see the correct answer instantly.

1. Question 7:How do you determine if a point is within the feasible region in linear programming?
2. The closed plain region obtained by the intersection of planes determined by a set of the constraints in the LP problem
3. Data processed to reveal meaning
4. What is a feasible solution?
5. Maximum value of the objective function Z = ax + by in a LPP always occurs atonly one corner point of the feasible region.
6. What is the main benefit of linear programming?
7. What is the objective of sensitivity analysis in linear programming?
8. Why is it important to connect classroom learning to everyday scenarios in linear programming?
9. How do you determine the maximum or minimum value of the objective function?
10. Which of the following is true of rounding the optimized solution of a linear program to an integer?
11. Which ordered pair will maximize P = 3x + y with the following constraints:$x+y\\le300$ $y\\ge100$ $x\\le150$
12. Which of the following is a common application of Linear Programming?
13. Luka and Dana are making cookies for the Westland Pantry. They only have up to 6 hours to bake! They can bake 32 chocolate chip cookies in an hour (x), and 20 snickerdoodle cookies in an hour (y). They need to make at least 150 cookies. Which one of these is a valid solution?
14. What is the purpose of the objective function in LP?
15. Explain how to determine if a solution is optimal in a linear programming problem.
16. Graph the inequality x-2y < 4 and identify the feasible region.
17. Solve. |-x-10| + 4 <-8
18. A constraint that does NOT affect the feasible region of the solution is a15. A. nonnegativity constraint.B. redundant constraint.C. standard constraint.D. slack constraint.
19. A special case when the objection function can be made infinitely large without violating any of the constraints
20. Define Optimal
21. If x1 + x2 is less than or equal to 500y1 and y1 is 0-1, then x1 and x2 will be ..... if y1 is 0.
22. In a Linear Programming model, what do constraints represent?
23. Which of the following variable is not considered in LPP?
24. What is the key idea behind finding the optimal solution in LP problems?
25. In a pasture are horses and chickens if there are a total of 28 animals and 80 legs how many chickens and horses?