This quiz works best with JavaScript enabled. Home > Class 12 > Class 12 Mathematics Chapter 12 Linear Programming – Quiz 11 🏠 Homepage 📘 Download PDF Books 📕 Premium PDF Books Class 12 Mathematics Chapter 12 Linear Programming Quiz 11 (25 MCQs) Quiz Instructions Select an option to see the correct answer instantly. 1. The importance of ..... for integer linear programming problems is often intensified by the fact that a small change in one of the coefficients in the constraints can cause a relatively large change in the value of the optimal solution. A) Sensitivity analysis. B) Objective function. C) Optimization analysis. D) Decision variables. Show Answer Correct Answer: A) Sensitivity analysis. 2. How is the optimal solution determined in linear programming using the graphical method? A) By finding the point of intersection of the feasible region that maximizes or minimizes the objective function. B) By selecting the point of intersection that is closest to the origin. C) By choosing the point of intersection that is farthest from the objective function. D) By randomly selecting a point within the feasible region. Show Answer Correct Answer: A) By finding the point of intersection of the feasible region that maximizes or minimizes the objective function. 3. Which of the following is NOT a component of a Linear Programming Problem? A) Profit Margin. B) Constraints. C) Objective Function. D) Decision Variables. Show Answer Correct Answer: A) Profit Margin. 4. What is the purpose of the simplex algorithm in linear programming? A) To identify the leaving variable. B) To introduce slack variables. C) To draw the graph of constraints. D) To reach the optimal solution through matrix operations. Show Answer Correct Answer: D) To reach the optimal solution through matrix operations. 5. Sarah makes $ 30 for each small purse (x) and $ 50 for each big purse (y). What is the optimized solution? 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. 6. If the Objective quantity is:30x + 50yAnd the corner that maximizes profit is:(0, 6)What is the profit? A) 300. B) 280. C) 400. D) 240. Show Answer Correct Answer: A) 300. 7. What are the limitations of linear programming? A) Discrete variables. B) Assumption of linearity, known parameters, continuous variables, independence, single objective function. C) Assumption of non-linearity. D) Unknown parameters. Show Answer Correct Answer: B) Assumption of linearity, known parameters, continuous variables, independence, single objective function. 8. What happens in a Linear Programming problem if the solution is unbounded? A) The solution is optimal. B) The constraints are contradictory. C) The profit can increase indefinitely. D) The solution is infeasible. Show Answer Correct Answer: C) The profit can increase indefinitely. 9. What is the significance of corner points in linear programming? A) Corner points are used to determine the feasibility of constraints. B) Corner points only represent infeasible solutions. C) Corner points are irrelevant in linear programming. D) Corner points are significant as they are potential optimal solutions in linear programming. Show Answer Correct Answer: D) Corner points are significant as they are potential optimal solutions in linear programming. 10. For a minimization problem, the solution is considered to be unbounded if the value may be made infinitely small.10. True or False? A) True. B) False. C) All the above. D) None of the above. Show Answer Correct Answer: A) True. 11. How can linear programming be used to optimize portfolio selection in finance? A) By maximizing the return or minimizing the risk of a portfolio subject to certain constraints. B) By finding the average return of all possible investment portfolios. C) By eliminating all risk to find the best possible investment outcome. D) By assuming all investment returns are independent of each other. Show Answer Correct Answer: A) By maximizing the return or minimizing the risk of a portfolio subject to certain constraints. 12. What is the value of the objective function at the point (3, 2)? A) 24. B) 12. C) 15. D) 18. Show Answer Correct Answer: D) 18. 13. Graph and identify a possible solution. Identify the slope and y-intercept. Use graph paper. Label each inequality and shade.y$\geq$2x+3y$\geq$1/3x-2 A) (3, 3). B) (-1, -1). C) (-3, 3). D) (-4, -4). Show Answer Correct Answer: C) (-3, 3). 14. How do you graph a linear inequality in two dimensions? A) Graph the corresponding line, then shade the appropriate region based on the inequality. B) Shade the entire graph without considering the inequality. C) Only plot the points that satisfy the inequality without drawing the line. D) Draw a circle around the line and leave it blank. Show Answer Correct Answer: A) Graph the corresponding line, then shade the appropriate region based on the inequality. 15. What is the main advantage of using Microsoft Excel to solve LP problems? A) It allows for easy optimization of objective functions and constraints. B) It adds complexity to problem-solving. C) It limits students' understanding of linear programming. D) It is not suitable for real-world applications. Show Answer Correct Answer: A) It allows for easy optimization of objective functions and constraints. 16. If all the values of the input variables in a decision model are random in nature, then the model is considered to be probabilistic. A) TRUE. B) FALSE. C) All the above. D) None of the above. Show Answer Correct Answer: A) TRUE. 17. What is the primary goal of linear programming? A) To minimize costs. B) To create complex mathematical models. C) To maximize or minimize a linear objective function. D) To allocate resources randomly. Show Answer Correct Answer: C) To maximize or minimize a linear objective function. 18. How do you determine if a point lies within the feasible region? A) A point is always feasible if it is an integer. B) A point lies within the feasible region if it is outside the constraints. C) A point lies within the feasible region if it satisfies all the constraints defining that region. D) A point is feasible if it meets at least one constraint. Show Answer Correct Answer: C) A point lies within the feasible region if it satisfies all the constraints defining that region. 19. A basic feasible solution to a (m x n) transportation problem is said to be a ..... solution ifit contains exactly m + n-1 non negative allocations in independent positions A) Non degenerate basic feasible. B) Basic feasible. C) Feasible. D) Infeasible. Show Answer Correct Answer: A) Non degenerate basic feasible. 20. Formulate a linear programming problem for a diet plan that meets nutritional requirements. A) Minimize variety to reduce meal preparation time. B) Maximize calories while ignoring nutritional needs. C) Minimize cost subject to nutritional constraints for a balanced diet. D) Focus solely on taste without considering cost or nutrition. Show Answer Correct Answer: C) Minimize cost subject to nutritional constraints for a balanced diet. 21. Provide an example of a real-world application where linear programming can be effectively used. A) Weather forecasting. B) Social media marketing. C) Personal finance management. D) Supply chain management. Show Answer Correct Answer: D) Supply chain management. 22. Which of the following is a property of all linear programming problems? A) We can choose from alternate courses of action. B) Minimization of some objective. C) A computer program. D) Usage of graphs in the solution. E) Usage of linear and nonlinear equations and inequalities. Show Answer Correct Answer: A) We can choose from alternate courses of action. 23. What is the defining characteristic of a Non-Linear Programming (NLP) problem? A) Both the objective function and all constraints must be linear. B) Only the constraints must be non-linear. C) The objective function or the constraints (or both) are non-linear. D) The problem must only involve discrete variables. Show Answer Correct Answer: C) The objective function or the constraints (or both) are non-linear. 24. The imposition of an integer restriction is necessary for models where A) Variables can take negative values. B) The decision variables cannot take fractional values. C) Nonnegativity constraints are needed. D) Possible values of variables are restricted to particular intervals. Show Answer Correct Answer: B) The decision variables cannot take fractional values. 25. Which of the following statements about infeasible problems is best? A) All of the possible solutions violate at least one constraint. B) All of the possible solutions violate all of the constraints. C) At least one of the possible solutions violates all of the constraints. D) At least one of the possible solutions violates at least one of the constraints. Show Answer Correct Answer: A) All of the possible solutions violate at least one constraint. ← 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