This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 19 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 19 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. When no solution to the linear programming problem satisfies all the constraints, including the nonnegativity conditions, it is considered12. A. optimal.B. feasible.C. infeasible.D. semifeasible. A) A. B) B. C) C. D) D. Show Answer Correct Answer: C) C. 2. What is the value of the objective function at the point (6, 0)? A) 12. B) 18. C) 15. D) 24. Show Answer Correct Answer: D) 24. 3. Formulate a linear inequality for the following situation:You need to produce at least 100 units of product A and 50 units of product B. A) X > 100, y > 50. B) X = 100, y = 50. C) X <= 100, y <= 50. D) X >= 100, y >= 50. Show Answer Correct Answer: D) X >= 100, y >= 50. 4. Sarah makes $ 30 for each small purse and $ 50 for each big purse. What is the objective function? A) P = 50x + 30y. B) P = 30x + 50y. C) P > 30x + 50y. D) P > 50x + 30y. Show Answer Correct Answer: B) P = 30x + 50y. 5. Which of the following is true about the feasible region in a linear programming problem? A) It is always a line. B) It is the intersection of all constraints. C) It is the union of all constraints. D) It is always unbounded. Show Answer Correct Answer: B) It is the intersection of all constraints. 6. If an LPP has no solution, it is called: A) Feasible. B) Infeasible. C) Degenerate. D) Redundant. Show Answer Correct Answer: B) Infeasible. 7. In the context of Linear Programming, what does 'redundant constraint' mean? A) A constraint that is always satisfied. B) A constraint that is contradictory. C) A constraint that does not affect the solution. D) A constraint that limits the solution space. Show Answer Correct Answer: C) A constraint that does not affect the solution. 8. Which of the following statements is correct about a redundant constraint?16. A. A redundant constraint affects the optimal solution.B. A redundant constraint affects the feasible region.C. Recognizing a redundant constraint is not possible with the graphical solution.D. At the optimal solution, a redundant constraint will have zero slack. A) A. B) B. C) C. D) D. Show Answer Correct Answer: D) D. 9. In LP, what do constraints represent? A) Resources to be optimized. B) Objectives to be achieved. C) Limitations on decision variables. D) Environmental impact. Show Answer Correct Answer: C) Limitations on decision variables. 10. Identify each of the following system of linear equations as having no solution, one solution, or infinitely many solutions. $12x+9y=8$ $4x+3y=5$ A) One solution. B) No solutions. C) Infinitely many solutions. D) Two solutions. Show Answer Correct Answer: B) No solutions. 11. Which of the following statements is true about matrix multiplication? A) Matrix multiplication is commutative. B) Matrix multiplication is associative. C) Matrix multiplication is neither commutative nor associative. D) Matrix multiplication is commutative and associative. Show Answer Correct Answer: B) Matrix multiplication is associative. 12. What is the purpose of introducing slack variables in the simplex method? A) To convert inequalities into equations. B) To improve the initial feasible solution. C) To identify the entry variable. D) To determine the leaving variable. Show Answer Correct Answer: A) To convert inequalities into equations. 13. Second step in formulating Linear Programming A) Identify the objective and constraints. B) Define the decision variables. C) Completely understand the managerial problem being faced. D) Use the decision variables to write mathematical expressions for the objective function and the constraints. Show Answer Correct Answer: A) Identify the objective and constraints. 14. Solve the linear programming problem:Minimize z = 2x + 3y subject to 3x + 4y $\geq$ 12, x $\geq$ 0, y $\geq$ 0. A) 5. B) 10. C) 12. D) 8. Show Answer Correct Answer: D) 8. 15. What does a feasible solution in linear programming imply? A) It violates at least one constraint. B) It satisfies all constraints. C) It is not possible to determine. D) It is the optimal solution. Show Answer Correct Answer: B) It satisfies all constraints. 16. Graph the linear equation 2x + 3y = 12. A) Y = (3/2)x-6. B) Y = (-3/2)x + 6. C) Y = (2/3)x-4. D) Y = (-2/3)x + 4. Show Answer Correct Answer: D) Y = (-2/3)x + 4. 17. Graph the linear equation 5x-y = 10. A) Y =-5x-10. B) Y = 5x-10. C) Y = 5x + 10. D) Y = 10-5x. Show Answer Correct Answer: B) Y = 5x-10. 18. An ..... solution violates "at least one" constraint. A) Good. B) Bad. C) Infeasible. D) Feasible. Show Answer Correct Answer: C) Infeasible. 19. What is the main focus of linear programming? A) Integrating rational functions. B) Optimizing a linear function. C) Differentiating polynomials. D) Solving trigonometric equations. Show Answer Correct Answer: B) Optimizing a linear function. 20. In the context of financial planning for a startup, what is meant by non-negative restrictions? A) Constraints that require all budget items to be greater than a certain positive value. B) Constraints that prevent the financial balance from taking negative values. C) Constraints that require all budgetary decision variables to be non-negative. D) Constraints that limit the number of budget items that can take positive values. Show Answer Correct Answer: C) Constraints that require all budgetary decision variables to be non-negative. 21. A special case which happens only on minimization problems A) Alternate solutions. B) Infeasibility. C) Unboundedness. D) Redundancy. Show Answer Correct Answer: C) Unboundedness. 22. What is the first step in developing a linear programming model? A) Identification of the problem. B) Solution of the model. C) Formulation of the mathematical model. D) Interpretation of results. Show Answer Correct Answer: A) Identification of the problem. 23. It uses formula and expressions to represent a problem. A) Imitation. B) Linear. C) Symbolic. D) None of the above. Show Answer Correct Answer: C) Symbolic. 24. How does GeoGebra help in teaching the graphical method of solving linear programming problems? A) By providing interactive visualization capabilities. B) By solving problems automatically. C) By printing out solutions. D) By generating random graphs. Show Answer Correct Answer: A) By providing interactive visualization capabilities. 25. What is the significance of corner points in the graphical method? A) Corner points only represent infeasible solutions. B) Corner points are significant as they represent potential optimal solutions in linear programming. C) Corner points are irrelevant in linear programming. D) Corner points are used to determine the slope of the graph. Show Answer Correct Answer: B) Corner points are significant as they represent potential optimal solutions in linear programming. ← 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