This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 25 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 25 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. David is running a concession stand at a soccer game. He sells nachos and sodas. Nachos cost $ 1.50 each and sodas cost $ 0.50 each. At the end of the game, David made a total of $ 78.50 and sold a total of 87 nachos and sodas combined. Which system of equations represents this situation? A) 1.5x+0.5y=78.5x+y=87. B) 1.5x+0.5y=78.51.5x+0.5y=87. C) X+y=78.51.5x+0.5y=87. D) X+y=78.5x+y=87. Show Answer Correct Answer: A) 1.5x+0.5y=78.5x+y=87. 2. The feasible region for an LPP is always a ..... polygon. A) CONCAVE. B) CONVEX. C) All the above. D) None of the above. Show Answer Correct Answer: B) CONVEX. 3. In forest management planning, what is the goal of linear programming? A) Minimize species diversity. B) Maximize land area for harvesting. C) Minimize timber yield. D) Maximize timber yield considering constraints. Show Answer Correct Answer: D) Maximize timber yield considering constraints. 4. The type of constraints which specifies maximum capacity of a resource is ..... constraints. A) Less than. B) Less than or equal. C) Greater than. D) Greater than or equal. Show Answer Correct Answer: B) Less than or equal. 5. Y exceeds x at most k(y melebihi x selebih-lebihnya k) A) $y-x>k$. B) $y-x\le k$. C) $y-x\ge k$. D) $y-x Show Answer Correct Answer: B) $y-x\le k$. 6. Define Corner Points A) Vertices where the lines intersect. B) A mathematical way of finding the maximum profit with given constraints. C) Limits put on possible outcomes. D) What you are selling. Show Answer Correct Answer: A) Vertices where the lines intersect. 7. How can the graphical method be used to solve linear programming problems? A) The graphical method can be used to solve linear programming problems by visually representing constraints and the objective function on a graph to find the optimal solution. B) The graphical method involves solving equations algebraically. C) The graphical method cannot be used for linear programming. D) The graphical method only works for non-linear problems. Show Answer Correct Answer: A) The graphical method can be used to solve linear programming problems by visually representing constraints and the objective function on a graph to find the optimal solution. 8. What is the purpose of conducting sensitivity analysis in LP problems? A) To Avoid Optimization. B) To Hide Solutions. C) To Understand the Impact of Changes. D) To Create Confusion. Show Answer Correct Answer: C) To Understand the Impact of Changes. 9. In the graphical method, how many variables can be handled? A) One. B) Two. C) Three. D) Unlimited. Show Answer Correct Answer: B) Two. 10. How can you convert a maximization problem into a minimization problem? A) Add a constant to the objective function. B) Use a different optimization algorithm. C) Change the constraints to be less strict. D) Negate the objective function. Show Answer Correct Answer: D) Negate the objective function. 11. What is a constraint in linear programming? A) A condition that must be satisfied by the solution, typically expressed as a linear inequality or equation. B) A method to optimize the objective function without any limitations. C) A variable that can take any value in the solution space. D) A graphical representation of the feasible region. Show Answer Correct Answer: A) A condition that must be satisfied by the solution, typically expressed as a linear inequality or equation. 12. How can graphical solutions to systems of linear inequalities be applied in real-life scenarios? A) Optimizing crop rotations in agriculture. B) Managing investment portfolios in finance. C) Planning transportation routes. D) Allocating resources in hospitals. Show Answer Correct Answer: A) Optimizing crop rotations in agriculture. 13. Which of the following is true about the feasible region? A) It may not exist. B) It is always unbounded. C) It is not influenced by constraints. D) It lies outside the origin. Show Answer Correct Answer: A) It may not exist. 14. The solution space in LPP is called: A) Inequality space. B) Feasible region. C) Vertex domain. D) Range space. Show Answer Correct Answer: B) Feasible region. 15. Given the relation T on the set D = \{1, 2, 3\} defined by T = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)\}, is T an equivalence relation? Why or why not? A) T is an equivalence relation because it is symmetric and transitive. B) Yes, T is an equivalence relation because it is reflexive. C) No, T is not an equivalence relation. D) T is an equivalence relation because it contains all pairs of elements. Show Answer Correct Answer: C) No, T is not an equivalence relation. 16. Tentukan x dari $2x+5=11$ A) 2. B) 3. C) 4. D) 5. Show Answer Correct Answer: B) 3. 17. LPP stands for: A) Logical Programming Problem. B) Linear Programming Process. C) Linear Programming Problem. D) Line Problem in Programming. Show Answer Correct Answer: C) Linear Programming Problem. 18. A redundant constraint cannot be removed from the problem without affecting the feasible region.9. True or False? A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 19. In dual simplex method, the starting solution satisfies the ..... condition A) Feasible. B) Optimal. C) All the above. D) None of the above. Show Answer Correct Answer: B) Optimal. 20. What is the key concept behind solving LP problems using the graphical method? A) Ignoring constraints. B) Guessing solutions. C) Plotting constraints to visually represent the feasible region. D) Avoiding graphs. Show Answer Correct Answer: C) Plotting constraints to visually represent the feasible region. 21. What does the term 'redundancy' refer to in linear programming? A) A constraint that does not affect the feasible region. B) A model with multiple optimal solutions. C) A variable that is not used. D) A solution that is not feasible. Show Answer Correct Answer: A) A constraint that does not affect the feasible region. 22. What does the term 'shadow price' indicate in Linear Programming? A) The cost of producing one more unit. B) The minimum cost of production. C) The maximum profit achievable. D) The value of one additional unit of a resource. Show Answer Correct Answer: D) The value of one additional unit of a resource. 23. For questions 3-6, use the following scenario:Suppose you can spend no more than 15 hours a week at your two jobs. Mowing lawns pays $ 3 an hour and babysitting pays $ 5 an hour. You need to earn at least $ 60 a week.Let x = # of hours mowingLet y = # of hours babysittingWhich system of inequalities represents the scenario? A) $3x+5y\le60$ $x+y\ge15$. B) $3x+5y\ge60$ $x+y\le15$. C) $x+y\le60$ $3x+5y\ge15$. D) $x+y\ge60$ $3x+5y\le15$. Show Answer Correct Answer: B) $3x+5y\ge60$ $x+y\le15$. 24. What is the role of the graphical method in linear programming? A) It provides a numerical solution to linear programming problems. B) It is a visual approach to solving linear programming problems, allowing for the identification of feasible regions and evaluation of objective functions at vertices. C) It simplifies complex linear equations into single-variable equations. D) It is used to create 3D models of linear programming problems. Show Answer Correct Answer: B) It is a visual approach to solving linear programming problems, allowing for the identification of feasible regions and evaluation of objective functions at vertices. 25. What is the purpose of conducting sensitivity analysis in linear programming models? A) To visualize the feasible region. B) To understand how changes in parameters impact the optimal solution. C) To ignore constraints and focus on the objective function. D) To add more constraints to the problem. Show Answer Correct Answer: B) To understand how changes in parameters impact the optimal solution. ← 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