This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 13 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 13 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. Explain how to find the optimal solution using graphical methods. A) Select any point within the feasible region. B) Draw random lines on the graph. C) Plot feasible region, identify corner points, calculate objective function at each corner point, choose highest (or lowest) value. D) Use trial and error method to find the solution. Show Answer Correct Answer: C) Plot feasible region, identify corner points, calculate objective function at each corner point, choose highest (or lowest) value. 2. The K.V. 1 Bathinda Club plans to grow trees as a project. There is a 1200 square foot plot of land available at their school to grow balsam fir and Douglas fir trees. There are only 576 pounds of fertilizer available.The profit for each balsam fir tree is $ 15 and $ 18 for each Douglas fir tree.Which of the following is an Objective Function that relates maximum profit? A) P = x + y. B) P = 576x + 1200y. C) P = 15x + 18y. D) P = 1200x + 576y. Show Answer Correct Answer: C) P = 15x + 18y. 3. What is the relationship between constraints and the feasible region? A) Constraints define the boundaries of the feasible region; the area where all constraints overlap represents the feasible solutions. B) Constraints are irrelevant to the feasible region and do not affect the solutions. C) The feasible region is always larger than the constraints defined. D) Constraints only apply to linear equations and do not relate to the feasible region. Show Answer Correct Answer: A) Constraints define the boundaries of the feasible region; the area where all constraints overlap represents the feasible solutions. 4. What is the inequality for SEWING TIME? A) 2x + 3y < 24. B) 2x + 3y < 36. C) 6x + 3y < 24. D) 6x + 3y < 36. Show Answer Correct Answer: D) 6x + 3y < 36. 5. What is the significance of the corner points in the feasible region? A) The corner points are significant as they represent potential optimal solutions in the feasible region. B) The corner points are always the worst solutions in the feasible region. C) The corner points only indicate the boundaries of the region. D) The corner points are irrelevant to the feasible region. Show Answer Correct Answer: A) The corner points are significant as they represent potential optimal solutions in the feasible region. 6. What is the benefit of using Microsoft Excel for solving linear programming problems? A) Perform statistical analysis only. B) Efficiently analyze complex problems and make data-driven decisions. C) Limited functionality compared to other tools. D) Create artistic graphs and charts. Show Answer Correct Answer: B) Efficiently analyze complex problems and make data-driven decisions. 7. What is the transportation problem? A) Allocating items from sources to destinations at a minimum cost. B) Maximizing profit in transportation. C) Minimizing cost in transportation. D) Balancing supply and demand. Show Answer Correct Answer: A) Allocating items from sources to destinations at a minimum cost. 8. What is the y-intercept of the equation?y =-2x + 3 A) -2. B) 1. C) 3. D) -3. Show Answer Correct Answer: C) 3. 9. How can LP be used in healthcare administration? A) Allocating resources in hospitals. B) Managing investment portfolios. C) Planning crop rotations. D) Optimizing transportation routes. Show Answer Correct Answer: A) Allocating resources in hospitals. 10. Explain the concept of constraints in linear programming. A) Constraints are suggestions in linear programming that can be ignored. B) Constraints are only applicable to the objective function in linear programming. C) Constraints in linear programming are limitations or restrictions on decision variables that must be satisfied to optimize the objective function. D) Constraints are not necessary for solving linear programming problems. Show Answer Correct Answer: C) Constraints in linear programming are limitations or restrictions on decision variables that must be satisfied to optimize the objective function. 11. What is the optimal solution in LP typically found at? A) At one of the corner points of the feasible region. B) At random points. C) At the center of the feasible region. D) At the edges of the feasible region. Show Answer Correct Answer: A) At one of the corner points of the feasible region. 12. How can graphical solutions methods be applied in manufacturing companies? A) Optimizing production planning. B) Managing customer service. C) Handling financial transactions. D) Analyzing market trends. Show Answer Correct Answer: A) Optimizing production planning. 13. A major challenge in solving real-world NLP problems is that non-convex functions are common. Why are these functions particularly difficult to handle? A) They only apply to discrete variables. B) Local optimization techniques may not find the global optimum. C) They do not have any constraints. D) They cannot be solved by any known algorithm. Show Answer Correct Answer: B) Local optimization techniques may not find the global optimum. 14. Lexie is making apple cobblers and apple pies for a bake sale. A cobbler needs 6 cups of apples and a pie needs 2 cups of apples. She also needs to use 4 cups of flour for a cobbler and 2 cups of flour for a pie. Lexie has 18 cups of apples and 16 cups of flour. x= # of cobblers and y is # of pieswrite the inequality for the amount of apples A) $2x+6y\le18$. B) $6x+2y\le18$. C) $4x+2y\le16$. D) $2x+4y\le16$. Show Answer Correct Answer: B) $6x+2y\le18$. 15. Solve using elimination:6x-4y = 28 2x + 2y = 6, A) X = 1, y = 2. B) X = 2, y = 1. C) X =-4, y = 1. D) X = 4, y =-1. Show Answer Correct Answer: D) X = 4, y =-1. 16. What is the main focus of Session 10.2? A) Teaching Linear Programming. B) Teaching Calculus. C) Teaching Algebra. D) Teaching Geometry. Show Answer Correct Answer: A) Teaching Linear Programming. 17. What is linear programming? A) A mathematical technique to solve allocation of resources. B) A model that represents a firm's decision given an objective and constraints. C) A method to maximize profit or minimize cost. D) All of the above. Show Answer Correct Answer: D) All of the above. 18. A constraint that does not affect feasible region is called A) Infeasible. B) Redundant. C) Partial. D) Switzerland?. Show Answer Correct Answer: B) Redundant. 19. Which of the following is a common application area for linear programming? A) All of the above. B) Agriculture. C) Transportation. D) Medical. Show Answer Correct Answer: A) All of the above. 20. What is slack? A) For the amount of a resource that is not used. B) For the amount of a resource that is used. C) No solution to the problem that satisfies all the constraint equations. D) To indicate the amount by which the right-hand side of a constraint is exceeded. Show Answer Correct Answer: A) For the amount of a resource that is not used. 21. In the linear programming formulation of the transportation problem, cost of transporting one unit of the material from a supply point to a demand point appears in A) The objective function only. B) The constraints only. C) Both objective function and constraints. D) Neither objective function nor constraints. Show Answer Correct Answer: A) The objective function only. 22. An unbounded feasible region might not result in an unbounded solution for a minimization or maximization problem.4. True or False? A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 23. What type of inequalities do the variables in a linear programming problem satisfy? A) Logarithmic inequalities. B) Exponential inequalities. C) Quadratic inequalities. D) Linear inequalities. Show Answer Correct Answer: D) Linear inequalities. 24. Identify the feasible region for the inequalities x >= 0, y >= 0, and x + y <= 5. A) Triangle bounded by x = 0, y = 0, and x + y = 5. B) Region outside the triangle bounded by x = 0, y = 0, and x + y = 5. C) Square bounded by x = 0, y = 0, and x + y = 5. D) Circle centered at (0, 0) with radius 5. Show Answer Correct Answer: A) Triangle bounded by x = 0, y = 0, and x + y = 5. 25. What are decision variables in linear programming? A) Variables that are constant. B) Variables that are not important. C) Variables that affect the outcome of the objective function. D) Variables that are random. Show Answer Correct Answer: C) Variables that affect the outcome of the objective function. ← 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