Class 12 Mathematics Chapter 12 Linear Programming Quiz 23 (25 MCQs)

Quiz Instructions

Select an option to see the correct answer instantly.

1. 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.
2. The graph of y $\geq$ x-3 uses a ..... ? ..... line
3. What is the goal in linear programming?
4. What are the variables in a linear programming problem?
5. Which of the following statements is true about an L.P. problem?
6. Which of the following methods is most suitable for solving large-scale linear programming problems?
7. 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.
8. Non-linear cost functions arising from discounts or bulk orders are an application of NLP in which supply chain activity?
9. After graphing the inequalities, the area where all of the inequalities are true is called the ..... (hint:It's colored yellow in the example)
10. 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.
11. The main example used in this video was called .....
12. How many inequalities are there in the given linear programming problem?
13. Row wise and column wise difference between two minimum costs is calculatedunder ..... method.
14. Tentukan himpunan penyelesaian dari pertidaksamaan $x-2>3$
15. How can graphical solutions to systems of linear inequalities be applied in real life?
16. The most important lever of profit for a company is (a)
17. OR stands for:
18. How can you identify unbounded solutions in linear programming?
19. If a line segment between any two points on a function lies below or on the curve, the function is defined as:
20. Is the function h(x) = 2x-1 one-to-one? Provide a proof or counterexample.
21. A software with features of a visual interface that includes nodes for a range of activities, from extracting data to presenting it.
22. A special case in LP wherein there is a constraint that does not affect the feasible region.
23. What is the importance of identifying the feasible region?
24. Profit Statement P = 30x + 50y Corner that maximizes profit:(0, 6) What is the profit?
25. Program linier adalah alat untuk memecahkan masalah