This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 21 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 21 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. What are the key components of a linear programming problem? A) Objective function, decision variables, non-negativity constraints. B) Constraints, objective function, non-negativity constraints. C) Objective function, decision variables, constraints, non-negativity constraints. D) Variables, constraints, objective function. Show Answer Correct Answer: C) Objective function, decision variables, constraints, non-negativity constraints. 2. Redundancy causes major difficulties to an LP problem. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 3. A non degenerated basics feasible solution all m variable are positive and remaining are A) 1. B) Zero. C) 2. D) None of above. Show Answer Correct Answer: B) Zero. 4. These are raw facts, symbols and figures A) DATABASE. B) DATA. C) INFORMATION. D) DATA WAREHOUSE. Show Answer Correct Answer: B) DATA. 5. When graphing a system of linear inequalities, how do you identify the feasible region? A) Select the region with the highest slope. B) Shade the overlapping or intersecting region. C) Color the region outside the feasible area. D) Highlight the area with the smallest y-intercept. Show Answer Correct Answer: B) Shade the overlapping or intersecting region. 6. What is the primary objective of Linear Programming? A) To minimize costs. B) To maximize profits. C) To allocate resources efficiently. D) To analyze market trends. Show Answer Correct Answer: B) To maximize profits. 7. Jika $y=5x+3$ A) 8. B) 10. C) 13. D) 15. Show Answer Correct Answer: C) 13. 8. In a transportation problem with total supply equal to total demand, if there are four origins and seven destinations, and there is a unique optimal solution, the optimal solution will utilize 11 shipping routes. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 9. What does the feasible region represent in a business optimization problem involving linear programming? A) The set of all possible solutions that satisfy the profit maximization function. B) The set of all possible solutions that do not satisfy the budgetary constraints. C) The set of all possible solutions that satisfy the budgetary constraints. D) The optimal solution to the business optimization problem. Show Answer Correct Answer: C) The set of all possible solutions that satisfy the budgetary constraints. 10. In an L.P., the allowed numbers of constraints are: A) Zero. B) Unlimited. C) Ten. D) Two. Show Answer Correct Answer: B) Unlimited. 11. What tool can be used to find the optimal point in GeoGebra? A) Intersect Tool. B) Highlight Tool. C) Erase Tool. D) Zoom Tool. Show Answer Correct Answer: A) Intersect Tool. 12. Where can the coordinates of the optimal point be found using GeoGebra? A) By using the Intersect tool. B) By drawing random shapes. C) By guessing the coordinates. D) By using the Fill tool. Show Answer Correct Answer: A) By using the Intersect tool. 13. For converting a problem in to dual, all RHS of constraints should be A) Non negative in case of minimization primal. B) Non negative in case of maximization primal. C) Both A and B. D) None of these. Show Answer Correct Answer: C) Both A and B. 14. What is the significance of the intersection point of two inequalities in linear programming? A) The intersection point has no relevance in linear programming. B) The intersection point represents the optimal solution directly. C) The intersection point signifies the feasible region. D) The intersection point indicates the infeasible region. Show Answer Correct Answer: C) The intersection point signifies the feasible region. 15. What is the value of x in the constraint 2x + 12y = 26? A) 4. B) 3. C) 2. D) 1. Show Answer Correct Answer: D) 1. 16. What is the max profit? A) $ 126. B) $ 108. C) $ 134. D) $ 72. Show Answer Correct Answer: A) $ 126. 17. In the context of NLP, what is the significance of a Convex Function? A) It guarantees that the problem has no feasible solution. B) It guarantees that the problem has a global optimum. C) It means that any local optimum is also the global optimum. D) It indicates the presence of a concave constraint. Show Answer Correct Answer: C) It means that any local optimum is also the global optimum. 18. What is the primary focus of Session 10.5? A) Teaching Linear Programming. B) Teaching Statistics. C) Teaching Calculus. D) Teaching Algebra. Show Answer Correct Answer: A) Teaching Linear Programming. 19. When was Linear Programming introduced? A) 1893. B) 1989. C) 1939. D) 1938. Show Answer Correct Answer: C) 1939. 20. Solution of primal cannot be read from dual. A) TRUE. B) FALSE. C) All the above. D) None of the above. Show Answer Correct Answer: B) FALSE. 21. What is the feasible region in a linear programming problem? A) The set of all points that satisfy the constraints of the linear programming problem. B) The collection of all possible solutions without any restrictions. C) The single point that maximizes the objective function. D) The area where all constraints are violated. Show Answer Correct Answer: A) The set of all points that satisfy the constraints of the linear programming problem. 22. What is the optimal solution in linear programming? A) The solution that has the least slack. B) The solution that maximizes the objective function. C) The solution that minimizes the constraints. D) The solution that has the most variables. Show Answer Correct Answer: B) The solution that maximizes the objective function. 23. What is the feasible region in the given linear programming problem? A) Third quadrant. B) Second quadrant. C) Fourth quadrant. D) First quadrant. Show Answer Correct Answer: D) First quadrant. 24. How can linear programming be used to optimize transportation routes? A) Focusing only on speed. B) Minimizing costs such as fuel consumption and travel time. C) Maximizing costs without any constraints. D) Ignoring demand and capacity constraints. Show Answer Correct Answer: B) Minimizing costs such as fuel consumption and travel time. 25. Define Product A) What you are making to sell. B) Limits put on possible outcomes. C) What you spend up front. D) What you are using to create your product. Show Answer Correct Answer: A) What you are making to sell. ← 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