This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 22 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 22 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. The goal of a linear programming problem is called A) Objective Function. B) Decision Variable. C) Constraint. D) Phone a friend?. Show Answer Correct Answer: A) Objective Function. 2. How do you handle multiple constraints in a graphical representation? A) Use a visual tool to represent each constraint and analyze their relationships. B) Eliminate any constraints that seem unnecessary. C) Ignore the constraints and focus on the main goal. D) Use a single color to represent all constraints. Show Answer Correct Answer: A) Use a visual tool to represent each constraint and analyze their relationships. 3. Where is the optimal solution typically found in a LP problem? A) None of the above. B) At the intersection of constraint lines. C) At one of the corner points of the feasible region. D) At the midpoint of the feasible region. Show Answer Correct Answer: B) At the intersection of constraint lines. 4. An ..... solution is a feasible solution that provides "the most favorable" objective function value. (The largest for maximization and the smallest for minimization problems.) A) Optimal. B) Good. C) Feasible. D) Infeasible. Show Answer Correct Answer: A) Optimal. 5. Calculate the determinant of the matrix [[1, 1], [1, 1]]. A) 1. B) 2. C) -1. D) 0. Show Answer Correct Answer: D) 0. 6. It involves planning of activities to obtain the best or optimal solution to a problem using limited resources to attain the goal A) Operations research. B) Maximization. C) Minimization. D) Linear programming. Show Answer Correct Answer: D) Linear programming. 7. Set of all points that satisfy all of the problem's resource restrictions A) Extreme points. B) Intercepts. C) Feasible region. D) Graphical solution. Show Answer Correct Answer: C) Feasible region. 8. Define linear Programming. A) A mathematical way to find the maximum profit, within given constraints. B) Money you make after expenses. C) Vertices where the lines intersect on the graph. D) The best solution or outcome. Show Answer Correct Answer: A) A mathematical way to find the maximum profit, within given constraints. 9. Other name of Least Cost Entry Method A) Matrix Method. B) Maxima Method. C) Vogel's Approximation Method. D) Matrix Minima Method. Show Answer Correct Answer: D) Matrix Minima Method. 10. Why is it important to understand the objective function? A) Understanding the objective function is irrelevant to the optimization process. B) It is important to understand the objective function because it determines the constraints of the problem. C) The objective function is only necessary for linear programming problems. D) It is important to understand the objective function because it defines the goal of optimization and guides decision-making. Show Answer Correct Answer: D) It is important to understand the objective function because it defines the goal of optimization and guides decision-making. 11. In linear programming, a feasible solution is: A) One that maximizes profit. B) One that satisfies all constraints. C) One that violates at least one constraint. D) Always unique. Show Answer Correct Answer: B) One that satisfies all constraints. 12. What is the role of the objective function in linear programming? A) The objective function is irrelevant to the optimization process in linear programming. B) The objective function is used to calculate the constraints in linear programming. C) The objective function defines the goal of optimization in linear programming. D) The objective function limits the variables in linear programming. Show Answer Correct Answer: C) The objective function defines the goal of optimization in linear programming. 13. What does the term xi $\geq$ 0 represent? A) Non-negativity constraint. B) Objective function. C) Constraint violation. D) None of the above. Show Answer Correct Answer: A) Non-negativity constraint. 14. In what ways can linear programming models be adapted to accommodate uncertainty in decision making? A) Incorporating probabilistic constraints or objectives, using stochastic programming techniques, or applying robust optimization methods. B) Applying decision tree algorithms. C) Implementing neural networks. D) Using linear regression techniques. Show Answer Correct Answer: A) Incorporating probabilistic constraints or objectives, using stochastic programming techniques, or applying robust optimization methods. 15. What is the main focus of Activity 4 in Session 10.3? A) Avoiding LP problems. B) Teaching LP using Microsoft Word. C) Solving LP problems using Excel. D) Discussing challenges in LP problems. Show Answer Correct Answer: D) Discussing challenges in LP problems. 16. QR IS THE ONLY A) Analysis tool. B) Reliability of the prepared. C) All of the above. D) None of the above. Show Answer Correct Answer: A) Analysis tool. 17. The objective function in LPP is always: A) Non-linear. B) Circular. C) Linear. D) Exponential. Show Answer Correct Answer: C) Linear. 18. While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because A) The resources are limited in supply. B) The objective function is a linear function. C) The constraints are linear equations or inequalities. D) All of the above. Show Answer Correct Answer: C) The constraints are linear equations or inequalities. 19. ..... are the entities whose value are to be determined from the solution of linear programming. A) Opportunity costs. B) Objective function. C) Constraints. D) Decision variables. Show Answer Correct Answer: D) Decision variables. 20. What do the variables in a linear programming problem satisfy? A) Set of exponential inequalities. B) Set of quadratic inequalities. C) Set of logarithmic inequalities. D) Set of linear inequalities. Show Answer Correct Answer: D) Set of linear inequalities. 21. To maximize is to ..... A) Make the most, biggest profit. B) Put a limit on a possible outcome. C) Spend money up front. D) Find where the lines intersect on a graph. Show Answer Correct Answer: A) Make the most, biggest profit. 22. Find the inverse of the matrix [[1, 1], [1, -1]]. A) [[0, 1], [1, 0]]. B) [[1, -1], [1, 1]]. C) [[1, 0], [0, 1]]. D) [[0.5, 0.5], [0.5, -0.5]]. Show Answer Correct Answer: D) [[0.5, 0.5], [0.5, -0.5]]. 23. In Phase 1, the simplex method is applied to a specially constructed ..... LPP A) General. B) Auxilliary. C) Primal. D) Dual. Show Answer Correct Answer: B) Auxilliary. 24. Which field widely uses linear programming for decision-making? A) Music. B) Sports. C) Medicine. D) Engineering. Show Answer Correct Answer: D) Engineering. 25. A system of inequalities is graphed. The solution is: A) The intersection point of the lines. B) The region that satisfies all inequalities. C) The union of all lines. D) The region outside the feasible region. Show Answer Correct Answer: B) The region that satisfies 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