This quiz works best with JavaScript enabled. Home > Cbse > Class 12 > Science > Mathematics > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 9 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 9 (60 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. For converting a problem in to dual, all RHS of constraints should be A) Non negative in case of minimization primal. B) Non negative in case of maximization primal. C) Both A and B. D) None of these. Show Answer Correct Answer: C) Both A and B. 2. What is the significance of the intersection point of two inequalities in linear programming? A) The intersection point indicates the infeasible region. B) The intersection point signifies the feasible region. C) The intersection point has no relevance in linear programming. D) The intersection point represents the optimal solution directly. Show Answer Correct Answer: B) The intersection point signifies the feasible region. 3. What is the value of x in the constraint 2x + 12y = 26? A) 3. B) 1. C) 4. D) 2. Show Answer Correct Answer: B) 1. 4. What is the max profit? A) $ 72. B) $ 108. C) $ 126. D) $ 134. Show Answer Correct Answer: C) $ 126. 5. In the context of NLP, what is the significance of a Convex Function? A) It means that any local optimum is also the global optimum. B) It guarantees that the problem has no feasible solution. C) It guarantees that the problem has a global optimum. D) It indicates the presence of a concave constraint. Show Answer Correct Answer: A) It means that any local optimum is also the global optimum. 6. What is the primary focus of Session 10.5? A) Teaching Algebra. B) Teaching Calculus. C) Teaching Linear Programming. D) Teaching Statistics. Show Answer Correct Answer: C) Teaching Linear Programming. 7. When was Linear Programming introduced? A) 1893. B) 1989. C) 1938. D) 1939. Show Answer Correct Answer: D) 1939. 8. Solution of primal cannot be read from dual. A) TRUE. B) FALSE. C) All the above. D) None of the above. Show Answer Correct Answer: B) FALSE. 9. What is the feasible region in the given linear programming problem? A) Third quadrant. B) First quadrant. C) Second quadrant. D) Fourth quadrant. Show Answer Correct Answer: B) First quadrant. 10. How can linear programming be used to optimize transportation routes? A) Focusing only on speed. B) Minimizing costs such as fuel consumption and travel time. C) Maximizing costs without any constraints. D) Ignoring demand and capacity constraints. Show Answer Correct Answer: B) Minimizing costs such as fuel consumption and travel time. 11. The goal of a linear programming problem is called A) Decision Variable. B) Phone a friend?. C) Objective Function. D) Constraint. Show Answer Correct Answer: C) Objective Function. 12. 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. 13. 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. 14. 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) Feasible. C) Infeasible. D) Good. Show Answer Correct Answer: A) Optimal. 15. Calculate the determinant of the matrix [[1, 1], [1, 1]]. A) 1. B) -1. C) 2. D) 0. Show Answer Correct Answer: D) 0. 16. It involves planning of activities to obtain the best or optimal solution to a problem using limited resources to attain the goal A) Maximization. B) Minimization. C) Linear programming. D) Operations research. Show Answer Correct Answer: C) Linear programming. 17. Set of all points that satisfy all of the problem's resource restrictions A) Extreme points. B) Feasible region. C) Intercepts. D) Graphical solution. Show Answer Correct Answer: B) Feasible region. 18. Define linear Programming. A) Money you make after expenses. B) A mathematical way to find the maximum profit, within given constraints. C) The best solution or outcome. D) Vertices where the lines intersect on the graph. Show Answer Correct Answer: B) A mathematical way to find the maximum profit, within given constraints. 19. Other name of Least Cost Entry Method A) Vogel's Approximation Method. B) Matrix Minima Method. C) Matrix Method. D) Maxima Method. Show Answer Correct Answer: B) Matrix Minima Method. 20. 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. 21. 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. 22. What is the role of the objective function in linear programming? A) The objective function defines the goal of optimization in linear programming. B) The objective function is used to calculate the constraints in linear programming. C) The objective function is irrelevant to the optimization process in linear programming. D) The objective function limits the variables in linear programming. Show Answer Correct Answer: A) The objective function defines the goal of optimization in linear programming. 23. 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. 24. In what ways can linear programming models be adapted to accommodate uncertainty in decision making? A) Using linear regression techniques. B) Applying decision tree algorithms. C) Incorporating probabilistic constraints or objectives, using stochastic programming techniques, or applying robust optimization methods. D) Implementing neural networks. Show Answer Correct Answer: C) Incorporating probabilistic constraints or objectives, using stochastic programming techniques, or applying robust optimization methods. 25. 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. 26. The objective function in LPP is always: A) Exponential. B) Linear. C) Non-linear. D) Circular. Show Answer Correct Answer: B) Linear. 27. 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. 28. ..... are the entities whose value are to be determined from the solution of linear programming. A) Decision variables. B) Opportunity costs. C) Constraints. D) Objective function. Show Answer Correct Answer: A) Decision variables. 29. What do the variables in a linear programming problem satisfy? A) Set of logarithmic inequalities. B) Set of exponential inequalities. C) Set of linear inequalities. D) Set of quadratic inequalities. Show Answer Correct Answer: C) Set of linear inequalities. 30. To maximize is to ..... A) Make the most, biggest profit. B) Spend money up front. C) Put a limit on a possible outcome. D) Find where the lines intersect on a graph. Show Answer Correct Answer: A) Make the most, biggest profit. 31. Find the inverse of the matrix [[1, 1], [1, -1]]. A) [[1, -1], [1, 1]]. B) [[0, 1], [1, 0]]. C) [[0.5, 0.5], [0.5, -0.5]]. D) [[1, 0], [0, 1]]. Show Answer Correct Answer: C) [[0.5, 0.5], [0.5, -0.5]]. 32. In Phase 1, the simplex method is applied to a specially constructed ..... LPP A) Primal. B) Auxilliary. C) Dual. D) General. Show Answer Correct Answer: B) Auxilliary. 33. Which field widely uses linear programming for decision-making? A) Medicine. B) Sports. C) Engineering. D) Music. Show Answer Correct Answer: C) Engineering. 34. 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. 35. Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is14. A. at least 1.B. 0.C. an infinite number.D. at least 2. A) D. B) C. C) A. D) B. Show Answer Correct Answer: D) B. 36. The graph of y $\geq$ x-3 uses a ..... ? ..... line A) Solid. B) Vertical. C) Horizontal. D) Dashed. Show Answer Correct Answer: A) Solid. 37. What are the variables in a linear programming problem? A) Imaginary variables. B) Irrational variables. C) Complex variables. D) Decision variables. Show Answer Correct Answer: D) Decision variables. 38. Which of the following statements is true about an L.P. problem? A) Concerned with finding the objective function of several variables. B) It refers to the method of determining a particular programme or action. C) Problem should have an optimal region inorder to have an optimal solution. D) All of the the above. Show Answer Correct Answer: D) All of the the above. 39. Which of the following methods is most suitable for solving large-scale linear programming problems? A) Trial-and-error. B) Graphical method. C) Simplex method. D) Enumeration. Show Answer Correct Answer: C) Simplex method. 40. Which of the following statements is NOT true?11. A feasible solution satisfies all constraints.B. An optimal solution satisfies all constraints.C. An infeasible solution violates all constraints.D. A feasible solution point does not have to lie on the boundary of the feasible region. A) A. B) D. C) C. D) B. Show Answer Correct Answer: C) C. 41. Non-linear cost functions arising from discounts or bulk orders are an application of NLP in which supply chain activity? A) Transportation and Logistics. B) Production Planning. C) Supplier Selection and Procurement. D) Demand Forecasting. Show Answer Correct Answer: C) Supplier Selection and Procurement. 42. After graphing the inequalities, the area where all of the inequalities are true is called the ..... (hint:It's colored yellow in the example) A) Feasible region. B) Sample space. C) Optimal area. D) Answer set. Show Answer Correct Answer: A) Feasible region. 43. It offers two different sets of prices for its software. One set of prices for installing the software on-premise and another for the software. A) SISENSE. B) KNIME. C) IMPROVADO. D) TABLEAU. Show Answer Correct Answer: D) TABLEAU. 44. The main example used in this video was called ..... A) Optimize the area of a field. B) Choose the best price. C) The carpenter problem. D) Average rate of travel. Show Answer Correct Answer: C) The carpenter problem. 45. How many inequalities are there in the given linear programming problem? A) 4. B) 3. C) 2. D) 5. Show Answer Correct Answer: A) 4. 46. Row wise and column wise difference between two minimum costs is calculatedunder ..... method. A) Vam. B) Least cost merhod. C) Modi method. D) None of the above. Show Answer Correct Answer: A) Vam. 47. How can graphical solutions to systems of linear inequalities be applied in real life? A) To complicate decision-making processes. B) To optimize production planning and manage inventory levels efficiently. C) To ignore constraints and objectives. D) To create unnecessary complexity in problem-solving. Show Answer Correct Answer: B) To optimize production planning and manage inventory levels efficiently. 48. The most important lever of profit for a company is (a) A) COST. B) EXPENSE. C) A. PRICE. D) REVENUE. Show Answer Correct Answer: C) A. PRICE. 49. How can you identify unbounded solutions in linear programming? A) Unbounded solutions happen when all constraints are equal. B) Unbounded solutions are identified by a finite objective function value. C) Unbounded solutions occur when the feasible region is empty. D) Unbounded solutions occur when the feasible region allows for infinite increase in the objective function without constraints. Show Answer Correct Answer: D) Unbounded solutions occur when the feasible region allows for infinite increase in the objective function without constraints. 50. If a line segment between any two points on a function lies below or on the curve, the function is defined as: A) Linear. B) Quadratic. C) Convex. D) Concave. Show Answer Correct Answer: D) Concave. 51. A software with features of a visual interface that includes nodes for a range of activities, from extracting data to presenting it. A) ALTERYX. B) IMPROVADO. C) KNIME. D) RAPIDMINER. Show Answer Correct Answer: C) KNIME. 52. A special case in LP wherein there is a constraint that does not affect the feasible region. A) Alternate solution. B) Infeasibility. C) Unboundedness. D) Redundancy. Show Answer Correct Answer: D) Redundancy. 53. What is the importance of identifying the feasible region? A) It helps in defining the set of all possible solutions that meet the problem's constraints. B) It allows for the elimination of all variables in the equation. C) It simplifies the problem by reducing the number of constraints. D) It guarantees that the optimal solution will be found. Show Answer Correct Answer: A) It helps in defining the set of all possible solutions that meet the problem's constraints. 54. Profit Statement P = 30x + 50y Corner that maximizes profit:(0, 6) What is the profit? A) 400. B) 280. C) 300. D) 240. Show Answer Correct Answer: C) 300. 55. Program linier adalah alat untuk memecahkan masalah A) Menentukan nilai max, min. B) Menentukan nilai panjang. C) Menentukan nilai volum. D) Menentukan nilai luas. E) Menentukan nilai lebar. Show Answer Correct Answer: A) Menentukan nilai max, min. 56. How is the optimal solution found in the graphical method? A) By flipping a coin. B) By following a random path. C) By choosing the highest number. D) By identifying the corner point of the feasible region that optimizes the objective function. Show Answer Correct Answer: D) By identifying the corner point of the feasible region that optimizes the objective function. 57. An inequality using $\ge$ $\le$ A) Solid. B) Dashed. C) All the above. D) None of the above. Show Answer Correct Answer: A) Solid. 58. Where is the optimal solution found in LP problems using the graphical method? A) None of the above. B) At the midpoint of the feasible region. C) At the intersection of constraint lines. D) At one of the corner points of the feasible region. Show Answer Correct Answer: A) None of the above. 59. What is the significance of non-negativity constraints in Linear Programming? A) They prevent negative values for decision variables. B) They ensure that profits are maximized. C) They limit the number of products produced. D) They define the feasible region. Show Answer Correct Answer: A) They prevent negative values for decision variables. 60. A relationship between two or more variables which is directly and precisely proportional A) Parameter. B) Sensitivity analysis. C) Analog. D) Linear. Show Answer Correct Answer: D) Linear. ← 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 6Class 12 Mathematics Chapter 12 Linear Programming Quiz 7Class 12 Mathematics Chapter 12 Linear Programming Quiz 8 🏠 Back to Homepage 📘 Download PDF Books 📕 Premium PDF Books