This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 27 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 27 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. Which of the following error messages is displayed in Excel Solver when attempting to solve an unbounded problem? A) Objective Cell values do not converge. B) Solver cannot improve the current solution. All constraints are satisfied. C) Solver could not find a feasible solution. D) Solver could not find a bounded solution. Show Answer Correct Answer: A) Objective Cell values do not converge. 2. 2x-y = 04x-y = 0 A) (1, 2). B) (0, 0). C) No Solutions. D) Infinite Solutions. Show Answer Correct Answer: B) (0, 0). 3. Does linear programming require computer programming to solve problems? A) Yes. B) No. C) All the above. D) None of the above. Show Answer Correct Answer: B) No. 4. Question 9:Can the feasible region change if the constraints of a linear programming problem are altered? Explain. A) Yes. B) Only if the objective function changes. C) No. D) Maybe. Show Answer Correct Answer: A) Yes. 5. What are the two types of distribution models? A) Transportation and assignment. B) Linear and non-linear. C) Feasible and infeasible. D) Optimal and suboptimal. Show Answer Correct Answer: A) Transportation and assignment. 6. How can you determine the optimal solution using a graph? A) Use linear programming to find the optimal solution. B) Apply random sampling to estimate the best path. C) Rely on trial and error to determine the best route. D) Use graph algorithms like Dijkstra's or Prim's to find the optimal solution. Show Answer Correct Answer: D) Use graph algorithms like Dijkstra's or Prim's to find the optimal solution. 7. What is the first step in graphing a linear inequality? A) Find the area of the inequality region. B) Solve for x. C) Rewrite the inequality in slope-intercept form. D) Plot the y-intercept on the graph. Show Answer Correct Answer: C) Rewrite the inequality in slope-intercept form. 8. The common region represented by the inequalities $3x+5y\le15$ $5x+2y\le10$ $x\ge0$ $y\ge0$ A) A triangle. B) A quadrilateral. C) A pentagon. D) An equilateral triangle. Show Answer Correct Answer: B) A quadrilateral. 9. Given the relation P on the set E = \{a, b, c, d\} defined by P = \{(a, a), (b, b), (c, c), (d, d), (a, b), (b, a)\}, is P an equivalence relation? Why or why not? A) No, P is not an equivalence relation because it is not reflexive. B) Yes, P is an equivalence relation because it is symmetric. C) No, P is not an equivalence relation because it is not transitive. D) Yes, P is an equivalence relation because it is reflexive. Show Answer Correct Answer: C) No, P is not an equivalence relation because it is not transitive. 10. Tentukan nilai y dari $3y-7=2$ A) 4. B) 3. C) 2. D) 1. Show Answer Correct Answer: C) 2. 11. Consider the matrices $A$ $B$ $AB \neq BA$ A) Commutative property. B) Associative property. C) Distributive property. D) Non-commutative property. Show Answer Correct Answer: D) Non-commutative property. 12. What is the objective function? A) P = 18x + 12y. B) P = 2x + 3y. C) P = 6x + 3y. D) P = 24x + 36y. Show Answer Correct Answer: A) P = 18x + 12y. 13. Describe the process of graphing a system of linear inequalities with three or more constraints. A) The process involves graphing each linear inequality separately, identifying overlapping shaded regions, and determining the common region that satisfies all constraints. B) Graphing all linear inequalities simultaneously. C) Ignoring the shaded regions. D) Selecting only one constraint to graph. Show Answer Correct Answer: A) The process involves graphing each linear inequality separately, identifying overlapping shaded regions, and determining the common region that satisfies all constraints. 14. The points where constraints intersect on the boundary of the feasible region are termed as the A) Feasible points. B) Feasible edges. C) Extreme points. D) Objective function contour. Show Answer Correct Answer: C) Extreme points. 15. A constraint of the form x + y $\geq$ 8 represents: A) Below the line. B) Above the line. C) Only the line. D) None of these. Show Answer Correct Answer: B) Above the line. 16. Impact of changes in RHS values of constraints is typically measured by the: A) Reduced cost. B) RHS allowable increase value. C) RHS allowable decrease value. D) Shadow price. Show Answer Correct Answer: D) Shadow price. 17. The slack value for binding constraints is A) Equal to the sum of the optimal points in the solution. B) Zero. C) Always a positive integer. D) A negative integer. Show Answer Correct Answer: B) Zero. 18. Objective function of LPP is A) A constraint. B) An inequality. C) A function to be optimized. D) Feasible region. Show Answer Correct Answer: C) A function to be optimized. 19. Given the objective function z = 3x + 4y, how do you determine the maximum value? A) Evaluate z at the vertices of the feasible region to find the maximum value. B) Set z equal to zero and solve for x and y. C) Calculate the derivative of z to find the maximum value. D) Use the midpoint of the feasible region to estimate the maximum value. Show Answer Correct Answer: A) Evaluate z at the vertices of the feasible region to find the maximum value. 20. Which of the following represents the decision variables in a linear programming model for forest production planning? A) Available land area. B) Labor hours available. C) Number of hectares of each tree species to be harvested. D) Total revenue from timber sales. Show Answer Correct Answer: C) Number of hectares of each tree species to be harvested. 21. What is the best answer we can find in a problem? A) An irrelevant answer. B) The least effective solution. C) The most effective solution. D) A random guess. Show Answer Correct Answer: C) The most effective solution. 22. Five times the sum of a number and 27 is greater than or equal to six times the sum of that number and 26. What is the solution set of this problem? A) $\left(-\infty, \-21\right)$. B) $\left(-\infty, \-21\right]$. C) $\left(-21, \\infty\right)$. D) $\left(21, \\infty\right)$. Show Answer Correct Answer: B) $\left(-\infty, \-21\right]$. 23. Non-negativity constraint ensures: A) Variables are integers. B) Variables are always positive or zero. C) Variables are negative. D) Variables are decimals. Show Answer Correct Answer: B) Variables are always positive or zero. 24. A baker uses organic flour from a local farmer in all of his baked goods. For each batch of bread (x1), he uses 4 pounds of flour. For a batch of cookies (x2), he uses 3 pounds, and for a batch of muffins (x3) he uses 2 pounds. The local farmer can supply him with no more than 24 pounds per week. The constraint that represents this condition is: A) X1 = 8, x2 = 8, x3 = 8. B) X1 + x2 + x3 = 24. C) X1 + x2 + x3 = 24. D) 4x1 + 3x2 + 2x3 = 24. Show Answer Correct Answer: D) 4x1 + 3x2 + 2x3 = 24. 25. Is the function m(x) = 4x-7 one-to-one? Provide a proof or counterexample. A) M(x) = 4x-7 is one-to-one only for x > 0. B) Yes, the function m(x) = 4x-7 is one-to-one. C) No, the function m(x) = 4x-7 is not one-to-one. D) M(x) = 4x-7 is one-to-one only for x < 0. Show Answer Correct Answer: B) Yes, the function m(x) = 4x-7 is one-to-one. ← 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