Home > Business Math > Quizzes > Business Mathematics Practice Test: Linear Programming Problem
Business Mathematics Practice Test: Linear Programming Problem
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 67% Most missed: “Non-negative condition in an LP model implies”
Business Mathematics Practice Test: Linear Programming Problem
Time left 00:00
25 Questions

1. If the value of the objective function
2. Which of the following is assumption of an LP model
3. Which of the following statements is true with respect to the optimal solution of an LP problem
4. A feasible solution to an LP problem
5. An iso-profit line represents
6. A model is
7. A solution which satisfies non-negative conditions also is called as....-
8. A constraint in an LP model restricts
9. A constraint in an LP model becomes redundant because
10. Maximization of objective function in LPP means
11. Which of the following is not a characteristic of the LP
12. For the constraint of a linear optimizing function z=x1+x2 given by x1+x2≤1, 3x1+x2≥3 and x1, x2≥0
13. A feasible solution of LPP
14. Which of the following is a limitation associated with an LP model
15. Non-negative condition in an LP model implies
16. The graph of x≤2 and y≥2 will be situated in the
17. If the number of available constraints is 3 and the number of parameters to be optimized is 4, then
18. A basic solution is called non-degenerate, if
19. The value of objective function is maximum under linear constraints
20. While plotting constraints on a graph paper, terminal points on both the axes are connected by a straight line because
21. A constraint in an LP model restricts
22. In graphical method of linear programming problem if the iOS-cost line coincide with a side of region of basic feasible solutions we get
23. Maximization of objective function in an LP model means
24. Constraints in LP problem are called active if they
25. Constraints in an LP model represents