This quiz works best with JavaScript enabled. Home > Cbse > Class 12 > Science > Mathematics > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 6 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 6 (60 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. A constraint that does not affect feasible region is called A) Infeasible. B) Redundant. C) Partial. D) Switzerland?. Show Answer Correct Answer: B) Redundant. 2. Which of the following is a common application area for linear programming? A) All of the above. B) Agriculture. C) Transportation. D) Medical. Show Answer Correct Answer: A) All of the above. 3. In the linear programming formulation of the transportation problem, cost of transporting one unit of the material from a supply point to a demand point appears in A) The objective function only. B) The constraints only. C) Both objective function and constraints. D) Neither objective function nor constraints. Show Answer Correct Answer: A) The objective function only. 4. An unbounded feasible region might not result in an unbounded solution for a minimization or maximization problem.4. True or False? A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 5. What type of inequalities do the variables in a linear programming problem satisfy? A) Quadratic inequalities. B) Exponential inequalities. C) Logarithmic inequalities. D) Linear inequalities. Show Answer Correct Answer: D) Linear inequalities. 6. Identify the feasible region for the inequalities x >= 0, y >= 0, and x + y <= 5. A) Triangle bounded by x = 0, y = 0, and x + y = 5. B) Region outside the triangle bounded by x = 0, y = 0, and x + y = 5. C) Square bounded by x = 0, y = 0, and x + y = 5. D) Circle centered at (0, 0) with radius 5. Show Answer Correct Answer: A) Triangle bounded by x = 0, y = 0, and x + y = 5. 7. 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. 8. Which ordered pair is a solution to the system of equations:y > 4x-3y $\geq$-2x + 3 A) (0, 0). B) (2, 1). C) (1, 0). D) (1, 2). Show Answer Correct Answer: D) (1, 2). 9. What is the main focus of Activity 5 in Session 10.3? A) Discussing benefits of LP problems. B) Teaching LP using GeoGebra. C) Solving LP problems using PowerPoint. D) Optimizing LP problems. Show Answer Correct Answer: D) Optimizing LP problems. 10. 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. 11. A set of linear inequalities subject to the constraints through visualized formulation. A) DASHBOARD. B) GRAPHICAL METHOD. C) GRAPHICAL SOLUTION. D) VISUALIZATION. Show Answer Correct Answer: C) GRAPHICAL SOLUTION. 12. 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. 13. 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) Graphing exponential functions. C) Solving complex algebraic equations. 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. 14. 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. 15. 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. 16. 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. 17. 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. 18. What are model constraints in a linear programming model? A) The restriction to the decision variables to zero or positive values. B) Mathematical symbols that represent levels of activity by the firm. C) The minimum cost of transportation. D) Linear relationships of the decision variables representing restrictions. Show Answer Correct Answer: D) Linear relationships of the decision variables representing restrictions. 19. 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. 20. 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. 21. Solve:5x + 34 =-2(-7x + 1) A) 9. B) 36/19. C) 4. D) -4. Show Answer Correct Answer: C) 4. 22. 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. 23. 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. 24. 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. 25. 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. 26. 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. 27. 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) Two solutions. B) Infinitely many solutions. C) No solutions. D) One solution. Show Answer Correct Answer: D) One solution. 28. 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. 29. What is the role of the vertices in finding the optimal solution in LP? A) They are key points to check for optimal solutions. B) They are irrelevant. C) They are used for decoration. D) They are used to confuse students. Show Answer Correct Answer: A) They are key points to check for optimal solutions. 30. What is a vertex in the context of a solution region? A) A point outside the feasible region. B) A point where two lines intersect. C) The maximum value of a function. D) A line that divides the plane. Show Answer Correct Answer: B) A point where two lines intersect. 31. What is the main objective of Activity 3 in Session 10.1? A) Teaching LP using GeoGebra. B) Solving LP problems using Excel. C) Discussing challenges in LP problems. D) Optimizing LP problems. Show Answer Correct Answer: C) Discussing challenges in LP problems. 32. Number of basic variables always equals to the number of ..... A) Constraints. B) Non-basic variables and constraints. C) Variable minus constraints. D) Non-bsic variables. Show Answer Correct Answer: A) Constraints. 33. In the context of optimizing a portfolio in finance, what is the significance of corner points? A) They represent the only points where the portfolio's return can be maximized or minimized. B) They are used to construct the efficient frontier. C) They indicate investment options that are not binding. D) They represent possible portfolio allocations that are not optimal. Show Answer Correct Answer: A) They represent the only points where the portfolio's return can be maximized or minimized. 34. Before starting phase 2, we remove all the artificial variable from the table which were non-basic at the end of phase 1. A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 35. What tool can be used to solve LP problems using Microsoft Excel? A) None of the above. B) GeoGebra. C) Solver Tool. D) What-If Analysis. Show Answer Correct Answer: B) GeoGebra. 36. What is the purpose of scenario analysis in LP models? A) None of the above. B) To interpret results generated by Solver. C) To conduct sensitivity analysis. D) To explore different scenarios and evaluate their impact. Show Answer Correct Answer: A) None of the above. 37. What is the objective in LPP? A) To solve nonlinear equations. B) To maximise or minimise a linear function. C) To find the average value. D) To find any solution. Show Answer Correct Answer: B) To maximise or minimise a linear function. 38. Erin is 3 years younger than twice Alex's age. Their ages combined are 33 years. How old are Alex and Erin. If x=Erin's age and y=Alex's age, choose the system that matches the situation. A) X + y = 3x = 33-2y. B) X + y = 33x = 2y-3. C) X + y = 33y = 2x-3. D) X + y = 33x = 3-2y. Show Answer Correct Answer: B) X + y = 33x = 2y-3. 39. In a linear programming problem, what does the term 'bounded' refer to? A) The feasible region is closed and contains all optimal solutions. B) The feasible region is open and does not contain optimal solutions. C) The objective function has no maximum or minimum. D) The constraints are not satisfied. Show Answer Correct Answer: A) The feasible region is closed and contains all optimal solutions. 40. Diketahui sistem persamaan $x+y=10$ $x-y=4$ A) 9. B) 8. C) 7. D) 6. Show Answer Correct Answer: C) 7. 41. 4x-2y = 7x + 2y = 3If I had to solve using substitution, which variable should I solve for? A) X in the second equation. B) Y in the first equation. C) X in the first equation. D) Y in the second equation. Show Answer Correct Answer: A) X in the second equation. 42. Interpret the optimal solution of a linear programming problem in terms of the objective function. A) The optimal solution only affects the constraints of the problem. B) The optimal solution maximizes or minimizes the objective function value based on the decision variables. C) The optimal solution is irrelevant to the objective function. D) The optimal solution is always the first feasible solution found. Show Answer Correct Answer: B) The optimal solution maximizes or minimizes the objective function value based on the decision variables. 43. A) A ..... solution satisfies "all" constraints. A) Feasible. B) Infeasible. C) Bad. D) Good. Show Answer Correct Answer: A) Feasible. 44. What method can be used to solve linear programming problems graphically? A) Simplex method. B) Algebraic method. C) Graphical method. D) Iterative method. Show Answer Correct Answer: C) Graphical method. 45. Discuss the role of the objective function in linear programming. A) The objective function is determined randomly in linear programming. B) The objective function has no impact on linear programming. C) The objective function sets the direction for the optimization process in linear programming. D) The objective function is only used for decoration in linear programming. Show Answer Correct Answer: C) The objective function sets the direction for the optimization process in linear programming. 46. What is the characteristic of the variables in a linear programming problem? A) Zero. B) Negative. C) Positive. D) Non-negative. Show Answer Correct Answer: D) Non-negative. 47. What is the slope intercept equation? A) Y=Mx=b+mb. B) Y=mmmbbbbxx. C) Mb+x=y+slope. D) Y=mx+b. Show Answer Correct Answer: D) Y=mx+b. 48. What is a linear programming problem concerned with? A) Graphing exponential functions. B) Finding the optimal value of a linear function. C) Solving quadratic equations. D) Balancing chemical equations. Show Answer Correct Answer: B) Finding the optimal value of a linear function. 49. What is a half-plane in the context of the xy-plane? A) The area above a line only. B) A point of intersection of lines. C) A region on both sides of a line. D) The region on a side of a line. Show Answer Correct Answer: D) The region on a side of a line. 50. In the Galaxy Industries example, what is the profit per dozen for the Zapper? A) $ 5. B) $ 8. C) $ 6. D) $ 10. Show Answer Correct Answer: A) $ 5. 51. If a system of equations has infinitely many solutions, the equations are: A) Parallel. B) Intersecting at one point. C) Coinciding. D) Perpendicular. Show Answer Correct Answer: C) Coinciding. 52. What do the variables represent? A) X = belts, y = wallets. B) X = cutting time, y = sewing time. C) X = profit, y = vertices. D) X = leather, y = profit. Show Answer Correct Answer: A) X = belts, y = wallets. 53. If all constraints of an LPP are satisfied, the solution is called: A) Feasible. B) Basic. C) Impossible. D) Intermediate. Show Answer Correct Answer: A) Feasible. 54. What is the objective of linear programming? A) To maximize or minimize a quadratic function. B) To solve non-linear equations. C) To maximize or minimize a linear function subject to linear constraints. D) To find the absolute maximum or minimum of a function. Show Answer Correct Answer: C) To maximize or minimize a linear function subject to linear constraints. 55. If the given inequality is greater than or greater than or equal, the region ..... the straight line ax+by+c=0 has to be shaded. A) Below. B) Above. C) All the above. D) None of the above. Show Answer Correct Answer: B) Above. 56. What is the main benefit of teaching linear programming using Microsoft Excel? A) Making the process more complicated. B) Increasing manual calculations. C) Streamlining the optimization process. D) Reducing efficiency. Show Answer Correct Answer: C) Streamlining the optimization process. 57. Maximize Z = 3x + 4y Subject to the constraints:x + y < 4, x > 0, y > 0 Find the maximum value of Z? A) 12. B) 42. C) 16. D) 35. Show Answer Correct Answer: A) 12. 58. Question 6:What is the graphical method used to identify the feasible region in linear programming? A) Geometric method. B) Algebraic method. C) Calculus method. D) Graphical method. Show Answer Correct Answer: D) Graphical method. 59. In case of an ..... constraints, the graph line is a solid straight line. A) Greater than. B) More than. C) Equal to. D) Less than. Show Answer Correct Answer: C) Equal to. 60. An infeasible problem is one in which the objective function can be increased to infinity.3. True or False? A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. ← PreviousNext →Related QuizzesScience QuizzesClass 12 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 7Class 12 Mathematics Chapter 12 Linear Programming Quiz 8Class 12 Mathematics Chapter 12 Linear Programming Quiz 9 🏠 Back to Homepage 📘 Download PDF Books 📕 Premium PDF Books