This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 12 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 12 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. The constraint x1-x2 = 0 implies that if project 1 is selected, project 2 cannot be. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: B) False. 2. Assumer there is a total of n variables and m constraints in an LP model. Each variable can be either ..... variable or ..... variable. A) Basic; non-basic. B) Feasible; non-feasible. C) Optimal; non-optimal. D) Bad; good. Show Answer Correct Answer: A) Basic; non-basic. 3. What does the shaded region in a system of inequalities represent? A) The average of all lines. B) The maximum value of the function. C) The intersection of all solutions. D) The midpoint of the graph. Show Answer Correct Answer: C) The intersection of all solutions. 4. To find the optimal solution for maximum cases, all entries in the objective row of the final tableau are ..... A) Positive. B) Negative. C) All the above. D) None of the above. Show Answer Correct Answer: A) Positive. 5. LPP is widely used in: A) Resource allocation. B) Weather forecasting. C) Painting. D) None of the above. Show Answer Correct Answer: A) Resource allocation. 6. What is the role of slack variables in linear programming? A) Slack variables are used to maximize the objective function in linear programming. B) Slack variables convert inequality constraints into equality constraints in linear programming. C) Slack variables are only applicable to integer programming, not linear programming. D) Slack variables are introduced to minimize the number of constraints in linear programming. Show Answer Correct Answer: B) Slack variables convert inequality constraints into equality constraints in linear programming. 7. If the feasible region for a LPP is unbounded, maximum or minimum of theobjective function Z = ax + by may or may not exist. A) TRUE. B) FALSE. C) All the above. D) None of the above. Show Answer Correct Answer: A) TRUE. 8. The region that satisfies all the constraints in a linear programming problem is called: A) Optimal solution. B) Decision region. C) Objective function. D) Feasible region. Show Answer Correct Answer: D) Feasible region. 9. What is the outcome of completing Unit-10? A) Balancing Competing Objectives. B) Understanding Real-World Problems. C) Solving Cryptography Puzzles. D) Analyzing Historical Events. Show Answer Correct Answer: A) Balancing Competing Objectives. 10. Identify the feasible region for the inequalities x >= 0, y >= 0, and x + 2y <= 8. A) The feasible region is a rectangle with vertices at (0, 0), (0, 8), (8, 8), and (8, 0). B) The feasible region is the triangle with vertices at (0, 0), (0, 4), and (8, 0). C) The feasible region is a line passing through (0, 0) and (8, 8). D) The feasible region is a circle with center at (4, 4) and radius 4. Show Answer Correct Answer: B) The feasible region is the triangle with vertices at (0, 0), (0, 4), and (8, 0). 11. How do you identify the feasible region in a graphical method? A) The feasible region is the entire graph area. B) The feasible region is the area on the graph where all constraints are satisfied. C) The feasible region is only the boundary lines of the constraints. D) The feasible region is where no constraints are met. Show Answer Correct Answer: B) The feasible region is the area on the graph where all constraints are satisfied. 12. When optimizing harvesting planning and scheduling using LP, what is the objective? A) Minimize harvesting costs. B) Maximize tree growth rates. C) Ignore market demand. D) Increase operational constraints. Show Answer Correct Answer: A) Minimize harvesting costs. 13. What are the constraints in a linear programming problem? A) Constraints are always quadratic equations that maximize profit. B) Constraints in a linear programming problem are linear inequalities or equations that represent limitations on resources. C) Constraints are irrelevant to the solution of linear programming problems. D) Constraints are only applicable to integer programming problems. Show Answer Correct Answer: B) Constraints in a linear programming problem are linear inequalities or equations that represent limitations on resources. 14. What is the main purpose of linear programming? A) Writing computer code. B) Creating graphs. C) Maximizing or minimizing a particular outcome. D) Solving complex equations. Show Answer Correct Answer: C) Maximizing or minimizing a particular outcome. 15. How can graphical solutions to linear inequalities be used in real-life scenarios? A) Designing architectural structures. B) Predicting weather patterns. C) Creating artistic compositions. D) Optimizing transportation routes. Show Answer Correct Answer: D) Optimizing transportation routes. 16. What is the objective of a business in linear programming? A) To maximize profit. B) To minimize cost. C) To balance supply and demand. D) To find the optimal solution. Show Answer Correct Answer: A) To maximize profit. 17. Which field does not use linear programming for decision-making? A) Military planning. B) Music. C) Business. D) Economics. Show Answer Correct Answer: B) Music. 18. Find the inverse of the matrix [[4, 7], [2, 6]]. A) [[0.6, -0.7], [-0.2, 0.4]]. B) [[1, 2], [3, 4]]. C) [[4, 2], [6, 7]]. D) [[0, 1], [1, 0]]. Show Answer Correct Answer: A) [[0.6, -0.7], [-0.2, 0.4]]. 19. What is the slope? y= 1/2x +-8 A) 1/2x. B) -8. C) -1/2. D) 1/2. Show Answer Correct Answer: D) 1/2. 20. In dual simplex, we first determine ..... Variable and ..... variable. A) Entering, leaving. B) Leaving, Feasible. C) Basic, Infeasible. D) Leaving, entering. Show Answer Correct Answer: D) Leaving, entering. 21. In a linear programming problem, what's another term for the "corners" of the feasible region? A) Vertices. B) Inequalities. C) Objectives. D) Slope. Show Answer Correct Answer: A) Vertices. 22. A numerical coefficients and constants used in the objective function and constraints. A) OBJECTIVE FUNCTION. B) PARAMETERS. C) DECISION VARIABLES. D) CONSTRAINTS. Show Answer Correct Answer: B) PARAMETERS. 23. The feasible region in a linear programming problem is always: A) Unbounded. B) Circular. C) Convex. D) Concave. Show Answer Correct Answer: C) Convex. 24. In Phase 1, a cost ..... is assigned to all variables except artificial variable A) 0. B) 1. C) -1. D) M. Show Answer Correct Answer: A) 0. 25. How do you graph multiple linear inequalities on the same coordinate plane? A) To graph multiple linear inequalities, graph each inequality's boundary line, shade the appropriate region, and repeat for all inequalities. B) Only graph the first inequality and ignore the rest. C) Use only dotted lines for all inequalities regardless of type. D) Shade all regions without considering the boundaries. Show Answer Correct Answer: A) To graph multiple linear inequalities, graph each inequality's boundary line, shade the appropriate region, and repeat for all inequalities. ← 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