This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 20 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 20 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. What is the minimum value of the objective function in the given linear programming problem? A) 24. B) 18. C) 15. D) 12. Show Answer Correct Answer: C) 15. 2. If a function has no maximum value, the shaded regions of the constraints are ..... since they do not form a closed figure. A) Linear. B) Objective. C) Unbounded. D) Feasible. Show Answer Correct Answer: C) Unbounded. 3. What do the vertices of the feasible region represent? A) Graphing Errors. B) Irrelevant Information. C) Random Data Points. D) Key Points for Sensitivity Analysis. Show Answer Correct Answer: D) Key Points for Sensitivity Analysis. 4. What are restrictions in a Linear Programming Problem called? A) Variable. B) Profit. C) Constraints. D) As if I can be bothered with this. Show Answer Correct Answer: C) Constraints. 5. Which key characteristic of an NLP problem makes finding the absolute best solution difficult? A) Continuous Variables. B) Non-Linearity in Objective Function. C) Multiple Local Optima. D) Use of the Lagrange Multipliers method. Show Answer Correct Answer: C) Multiple Local Optima. 6. Which of the following is a constraint in a linear programming problem? A) Variable definition. B) Resource limitation. C) Profit maximization. D) Objective function. Show Answer Correct Answer: B) Resource limitation. 7. A transportation problem can always be represented by balanced model. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 8. In the graphical method, the optimal solution lies: A) At the origin. B) Inside the feasible region. C) At a corner (vertex) of the feasible region. D) Outside the feasible region. Show Answer Correct Answer: C) At a corner (vertex) of the feasible region. 9. Calculate the determinant of the matrix [[3, 2], [1, 4]]. A) 10. B) 8. C) 5. D) 12. Show Answer Correct Answer: A) 10. 10. Solve by matrices. $4x + 9y = 28$ $-4x-y =-28$ A) (-7, 0). B) (6, 0). C) (-6, 0). D) (7, 0). Show Answer Correct Answer: D) (7, 0). 11. The first step in formulating an LP problem is A) Graph the problem. B) Perform a sensitivity analysis. C) Identify the objective and the constraints. D) Understand the managerial problem being faced. E) Define the decision variables. Show Answer Correct Answer: D) Understand the managerial problem being faced. 12. How is the optimal solution determined in linear programming? A) By maximizing or minimizing the objective function while satisfying all constraints. B) By ignoring the constraints and focusing only on the objective function. C) By randomly selecting values for the decision variables. D) By choosing the most complex solution. Show Answer Correct Answer: A) By maximizing or minimizing the objective function while satisfying all constraints. 13. Which method for solving NLP problems follows the steepest descent of the objective function to find a local optimum? A) Interior-Point Method. B) Gradient Descent. C) Lagrange Multipliers. D) Simplex Method. Show Answer Correct Answer: B) Gradient Descent. 14. In linear programming the constraints can be linear, quadratic, or cubic. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 15. What happens if the feasible region in the graphical method is unbounded? A) The method is invalid. B) There is no optimal solution. C) The solution is unique. D) The problem is unsolvable. Show Answer Correct Answer: B) There is no optimal solution. 16. How do you determine which side of the line to shade when graphing an inequality? A) Pick a test point not on the line and substitute its coordinates into the inequality. If the inequality is true, shade the side where the test point lies; if false, shade the other side. B) Shade both sides of the line. C) Always shade the left side of the line. D) Choose the side with the higher numbers. Show Answer Correct Answer: A) Pick a test point not on the line and substitute its coordinates into the inequality. If the inequality is true, shade the side where the test point lies; if false, shade the other side. 17. What role do decision variables play in linear programming? A) Decision variables represent the constraints of the problem. B) Decision variables are the unknowns that the model seeks to determine for optimization. C) Decision variables are the constants used in the model. D) Decision variables are the final results of the optimization process. Show Answer Correct Answer: B) Decision variables are the unknowns that the model seeks to determine for optimization. 18. $5x+y\le120$ A) (24, 0) and (0, 120). B) (120, 0) and (0, 24). C) (20, 5) and (120, 5). D) (5, 120) and (20, 4). Show Answer Correct Answer: A) (24, 0) and (0, 120). 19. And four destinations will have seven decision variables. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 20. What does the graphical method of solving linear programming problems involve? A) Plotting constraints on a graph. B) Solving equations algebraically. C) Drawing random lines. D) Using trial and error method. Show Answer Correct Answer: A) Plotting constraints on a graph. 21. The ratio of y to x is at least 2:5.(Nisbah y kepada x sekurang-kurangnya 2:5) A) $5y\ge2x$. B) $5y>2x$. C) $5y<2x$. D) $5y\le2x$. Show Answer Correct Answer: A) $5y\ge2x$. 22. What role do constraints play in linear programming? A) Constraints define the feasible region and ensure solutions meet specific requirements. B) Constraints are used to maximize the objective function. C) Constraints are optional and can be ignored in linear programming. D) Constraints limit the number of variables in the model. Show Answer Correct Answer: A) Constraints define the feasible region and ensure solutions meet specific requirements. 23. Which of the following methods is commonly used to solve linear programming problems? A) Graphical method. B) Trial and error. C) None of the above. D) Random search. Show Answer Correct Answer: A) Graphical method. 24. Which method is used for solving LPP with more than two variables? A) Graphical method. B) Simplex method. C) Trial and error. D) None. Show Answer Correct Answer: B) Simplex method. 25. Which method is useful for problems with two variables in linear programming? A) Simplex Method. B) Graphical Method. C) Diet Problems. D) Resource Allocation. Show Answer Correct Answer: B) Graphical Method. ← PreviousNext →Related QuizzesClass 12 Mathematics Chapter 12 Linear Programming Quiz 1Class 12 Mathematics Chapter 12 Linear Programming Quiz 2Class 12 Mathematics Chapter 12 Linear Programming Quiz 3Class 12 Mathematics Chapter 12 Linear Programming Quiz 4Class 12 Mathematics Chapter 12 Linear Programming Quiz 5Class 12 Mathematics Chapter 12 Linear Programming Quiz 6Class 12 Mathematics Chapter 12 Linear Programming Quiz 7Class 12 Mathematics Chapter 12 Linear Programming Quiz 8Class 12 Mathematics Chapter 12 Linear Programming Quiz 9Class 12 Mathematics Chapter 12 Linear Programming Quiz 10 🏠 Back to Homepage 📘 Download PDF Books 📕 Premium PDF Books