This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 4 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 4 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. When a feasible region is unbounded and the objective is maximization, the optimal solution: A) Does not exist. B) Always exists. C) May or may not exist. D) Is the origin. Show Answer Correct Answer: C) May or may not exist. 2. What is the optimal solution in LP problems? A) The Solution that Ignores Constraints. B) The Solution that Maximizes or Minimizes the Objective Function. C) The Solution with the Most Variables. D) The Most Complicated Solution. Show Answer Correct Answer: B) The Solution that Maximizes or Minimizes the Objective Function. 3. What is the condition for the variables in a linear programming problem? A) Negative. B) Zero. C) Non-negative. D) Fractional. Show Answer Correct Answer: C) Non-negative. 4. Larry's Fish Market buys salmon (S) for $ 5 per pound and a local whitefish (W) for $ 3.50 per pound. Larry wants to minimize his cost, but he cannot spend more than $ 160. The objective function that minimizes these costs for Larry is: A) 5S + 3.5W = 160. B) Min 5S + 3.5 W. C) Max 5S + 3.5 W. D) Min 5S + 3.5W = 160. Show Answer Correct Answer: B) Min 5S + 3.5 W. 5. Question 2:How is the feasible region determined in a linear programming problem? A) By plotting the constraints on a graph and finding the overlapping area. B) By using trial and error to find the region. C) By randomly selecting a region on the graph. D) By solving a system of linear equations. Show Answer Correct Answer: A) By plotting the constraints on a graph and finding the overlapping area. 6. What is the main goal of linear programming? A) To reduce the number of products. B) To eliminate all constraints. C) To minimize costs. D) To increase the number of employees. Show Answer Correct Answer: C) To minimize costs. 7. Which field widely uses linear programming to make efficient use of resources and achieve specific goals? A) Business. B) Engineering. C) Agriculture. D) Medicine. Show Answer Correct Answer: A) Business. 8. What is the role of GeoGebra in teaching graphical solutions to linear inequalities? A) Enhancing visual learning experiences. B) Predicting future trends. C) Creating music compositions. D) Analyzing historical data. Show Answer Correct Answer: A) Enhancing visual learning experiences. 9. How can graphical solutions help in optimizing production planning? A) By Increasing Costs. B) By Decreasing Efficiency. C) By Maximizing Output. D) By Ignoring Constraints. Show Answer Correct Answer: C) By Maximizing Output. 10. What is the objective function in a linear programming problem? A) A function that is always linear. B) A function that needs to be minimized or maximized. C) A function that has no constraints. D) A function that is only defined for integers. Show Answer Correct Answer: B) A function that needs to be minimized or maximized. 11. For converting a problem in to dual, minimization primal should have A) All constraints greater than equal to. B) All constraints less than equal to. C) All constraints equal to. D) None of these. Show Answer Correct Answer: B) All constraints less than equal to. 12. This mathematical symbol ' < ' is represent the following EXCEPT:Simbol matematik "<" mewakili pilihan di bawah KECUALI: A) Less than. B) Fewer than. C) Below. D) Exceeds. Show Answer Correct Answer: D) Exceeds. 13. Determine if the system of equations 3x + 2y = 6 and 6x + 4y = 12 is consistent. A) The system has no solutions. B) No, the system is inconsistent. C) The equations represent parallel lines. D) Yes, the system is consistent. Show Answer Correct Answer: D) Yes, the system is consistent. 14. What is the objective function in linear programming? A) A function that creates graphs. B) A function that counts the variables. C) A function that generates random numbers. D) A function that you want to maximize or minimize. Show Answer Correct Answer: D) A function that you want to maximize or minimize. 15. What are the limitations of linear programming in decision making processes? A) Assumption of linearity, requirement of known parameters, inability to handle discrete decisions, challenge of dealing with multiple objectives. B) Unlimited flexibility in decision-making. C) Ability to incorporate uncertain parameters. D) Ease of handling complex models. Show Answer Correct Answer: A) Assumption of linearity, requirement of known parameters, inability to handle discrete decisions, challenge of dealing with multiple objectives. 16. How do you determine the optimal solution using the graphical method? A) Identify the optimal point in the feasible region by evaluating corner points of the constraints. B) Identify the optimal point by averaging all corner points of the constraints. C) Choose any point within the feasible region without evaluating constraints. D) Select the midpoint of the feasible region as the optimal solution. Show Answer Correct Answer: A) Identify the optimal point in the feasible region by evaluating corner points of the constraints. 17. What is the role of the pivot element in the simplex method? A) Intersection of the pivot row and pivot column. B) Value of the objective function. C) Value of the basic variables. D) Value of the non-basic variables. Show Answer Correct Answer: A) Intersection of the pivot row and pivot column. 18. The distinguishing feature of an LP model is A) Relationship among all variables is linear. B) It has single objective function and constraints. C) Value of decision variables is nonnegative. D) All of the above. Show Answer Correct Answer: D) All of the above. 19. Maps, blueprints and programs are examples of which model A) Iconic. B) Digital. C) Analog. D) Symbolic. Show Answer Correct Answer: C) Analog. 20. How do you handle multiple optimal solutions in graphical methods? A) Ignore the feasible region entirely. B) Identify all points on the objective function line tangent to the feasible region. C) Use only the corner points of the feasible region. D) Select only the highest point on the graph. Show Answer Correct Answer: B) Identify all points on the objective function line tangent to the feasible region. 21. What does it mean for a solution region to be bounded? A) It is infinite in size. B) It contains only one point. C) It has no constraints. D) It can be enclosed in a rectangle. Show Answer Correct Answer: D) It can be enclosed in a rectangle. 22. What are the coordinates of the vertex at the intersection of x + y = 5 and 2x + 3y = 12? A) (3, 2). B) (0, 5). C) (5, 5). D) (6, 0). Show Answer Correct Answer: A) (3, 2). 23. Linear Programming provides a method to optimize operations within certain constraints. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 24. Total y and x is at least k(Jumlah y dan x sekurang-kurangnya k) A) $y+x>k$. B) $y+x\ge k$. C) $y+x D) $y+x\le k$. Show Answer Correct Answer: B) $y+x\ge k$. 25. Resources are what you use to create your product. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. ← 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 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 10Class 12 Mathematics Chapter 12 Linear Programming Quiz 11 🏠 Back to Homepage 📘 Download PDF Books 📕 Premium PDF Books