This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 14 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 14 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. What does it mean for a solution to be feasible? A) A feasible solution is one that satisfies all the constraints of the linear programming problem. B) A feasible solution is one that maximizes the objective function regardless of constraints. C) A feasible solution is one that minimizes the number of variables used in the problem. D) A feasible solution is one that is not bounded by any constraints. Show Answer Correct Answer: A) A feasible solution is one that satisfies all the constraints of the linear programming problem. 2. Which ordered pair is a solution to the system of equations:y > 4x-3y $\geq$-2x + 3 A) (0, 0). B) (1, 0). C) (1, 2). D) (2, 1). Show Answer Correct Answer: C) (1, 2). 3. What is the main focus of Activity 5 in Session 10.3? A) Optimizing LP problems. B) Teaching LP using GeoGebra. C) Solving LP problems using PowerPoint. D) Discussing benefits of LP problems. Show Answer Correct Answer: A) Optimizing LP problems. 4. The objective of the transportation problem is to A) Identify one origin that can satisfy total demand at the destinations and at the same time minimize total shipping cost. B) Minimize the number of origins used to satisfy total demand at the destinations. C) Minimize the number of shipments necessary to satisfy total demand at the destinations. D) Minimize the cost of shipping products from several origins to several destinations. Show Answer Correct Answer: D) Minimize the cost of shipping products from several origins to several destinations. 5. A set of linear inequalities subject to the constraints through visualized formulation. A) GRAPHICAL SOLUTION. B) DASHBOARD. C) GRAPHICAL METHOD. D) VISUALIZATION. Show Answer Correct Answer: A) GRAPHICAL SOLUTION. 6. How can you find the intersection points of the lines represented by the constraints? A) Choose one equation and ignore the other. B) Set the equations equal and solve for the variables. C) Graph the lines and estimate the intersection visually. D) Add the equations together and simplify. Show Answer Correct Answer: B) Set the equations equal and solve for the variables. 7. What is the main objective of linear programming? A) Maximizing or minimizing a linear objective function while abiding by a set of linear constraints. B) Solving complex algebraic equations. C) Graphing exponential functions. D) Optimizing non-linear functions. Show Answer Correct Answer: A) Maximizing or minimizing a linear objective function while abiding by a set of linear constraints. 8. What is the difference between maximization and minimization in linear programming? A) Maximization finds the maximum value, while minimization finds the minimum value. B) Maximization and minimization are not applicable in linear programming. C) Maximization finds the minimum value, while minimization finds the maximum value. D) Maximization and minimization are the same in linear programming. Show Answer Correct Answer: A) Maximization finds the maximum value, while minimization finds the minimum value. 9. What are constraints in linear programming? A) Variables that affect the outcome. B) Graphs. C) Restrictions or limitations on the decision variables. D) Random numbers. Show Answer Correct Answer: C) Restrictions or limitations on the decision variables. 10. How many of each purse should Sarah make to maximize profit? (Recall:x represents small purses and y represents big purses) A) 6 big purses. B) 8 small purses. C) 6 small purses and 2 big purses. D) None of the above. Show Answer Correct Answer: A) 6 big purses. 11. In a linear programming problem, what type of the numbers are used in the objective function? A) Profit. B) Time. C) Variables. D) Vertices. Show Answer Correct Answer: A) Profit. 12. What are model constraints in a linear programming model? A) Linear relationships of the decision variables representing restrictions. B) Mathematical symbols that represent levels of activity by the firm. C) The restriction to the decision variables to zero or positive values. D) The minimum cost of transportation. Show Answer Correct Answer: A) Linear relationships of the decision variables representing restrictions. 13. NLP is a critical part of advanced supply chain analytics, particularly in which two areas? A) Data entry and report generation. B) Basic accounting and payroll. C) Predictive analytics and scenario planning. D) Hardware maintenance and networking. Show Answer Correct Answer: C) Predictive analytics and scenario planning. 14. Sarah makes $ 30 for each small purse (x) and $ 50 for each big purse (y). What is the objective quantity? A) P = 30x + 50y. B) P = 50x + 30y. C) All the above. D) None of the above. Show Answer Correct Answer: A) P = 30x + 50y. 15. Solve:5x + 34 =-2(-7x + 1) A) -4. B) 9. C) 4. D) 36/19. Show Answer Correct Answer: C) 4. 16. Given the relation R on the set A = \{1, 2, 3\} defined by R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}, is R an equivalence relation? Why or why not? A) R is an equivalence relation because it is symmetric and transitive. B) R is not an equivalence relation because it is not reflexive. C) Yes, R is an equivalence relation because it is reflexive. D) No, R is not an equivalence relation. Show Answer Correct Answer: D) No, R is not an equivalence relation. 17. Graph the inequality 2x-y $\geq$ 3 and shade the feasible region. A) Graph the line y = 2x-3 with a solid line and shade below it. B) Graph the line y = 2x + 3 with a dashed line and shade above it. C) Graph the line y = 2x-3 with a dashed line and shade above it. D) Graph the line y =-2x + 3 with a solid line and shade below it. Show Answer Correct Answer: A) Graph the line y = 2x-3 with a solid line and shade below it. 18. What does the leaving variable represent in the simplex method? A) Non-basic variable that becomes basic. B) Variable with the largest positive value. C) Basic variable that becomes non-basic. D) Variable with the smallest ratio. Show Answer Correct Answer: C) Basic variable that becomes non-basic. 19. What defines a feasible region in a linear programming context? A) The set of all points satisfying the constraints of a linear programming problem. B) The area where all possible solutions are found. C) The graphical representation of the objective function. D) The maximum and minimum values of the objective function. Show Answer Correct Answer: A) The set of all points satisfying the constraints of a linear programming problem. 20. Which of the following situations can be represented by y=10+0.55n A) The total cost at a store for one book that costs $ 10 and n bookmarks that cost $ 0.55 each. B) The total cost of 10 bags of chips that cost $ 0.55 each. C) The height of a tree after n day that was 10feet tall and it grew 55 feet a day. D) Not here. Show Answer Correct Answer: A) The total cost at a store for one book that costs $ 10 and n bookmarks that cost $ 0.55 each. 21. Identify each of the following system of linear equations as having no solution, one solution, or infinitely many solutions. $6x+2y=9$ $2x-4y=2$ A) One solution. B) No solutions. C) Infinitely many solutions. D) Two solutions. Show Answer Correct Answer: A) One solution. 22. What is the purpose of the objective function in LP models? A) To define constraints. B) To represent decision variables. C) To be maximized or minimized. D) None of the above. Show Answer Correct Answer: D) None of the above. 23. What is the role of the vertices in finding the optimal solution in LP? A) They are used for decoration. B) They are key points to check for optimal solutions. C) They are used to confuse students. D) They are irrelevant. Show Answer Correct Answer: B) They are key points to check for optimal solutions. 24. What are the main components of a linear programming problem? A) Objective function, decision variables, constraints, feasible region. B) Objective function, decision variables, constraints, non-linear region. C) Objective function, decision variables, constraints, unbounded region. D) Objective function, decision variables, constraints, infeasible region. Show Answer Correct Answer: A) Objective function, decision variables, constraints, feasible region. 25. What are constraints in the context of linear programming? A) Constraints are the decision variables in linear programming. B) Constraints are the objectives to be maximized or minimized. C) Constraints are the optimal solutions in linear programming. D) Constraints in linear programming are conditions that limit the values of decision variables. Show Answer Correct Answer: D) Constraints in linear programming are conditions that limit the values of decision variables. ← 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