Which of the following conditions ensures that only better solutions will be encountered in the simplex method? (a) Condition of Feasibility (b) Condition of Non-negativity (c) Condition of Optimality (d) Condition of Additivity | Card: 1 / 20 |
Fill in the blank: The method used for optimization when decision variables exceed two is called ______. | Card: 3 / 20 |
True or False: In a linear programming problem, if a resource is not fully utilized, the shadow price of that resource is positive. | Card: 5 / 20 |
Riddle: I am a method that introduces artificial variables into a problem to solve inequalities, yet I must ensure they don't appear in the final solution. What am I? | Card: 9 / 20 |
![]() Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only |
In the simplex method, a unique solution occurs when the number of basic variables is equal to what? | Card: 11 / 20 |
Fill in the blank: The dual problem in linear programming is formulated from parameters of the ______ problem. | Card: 13 / 20 |
Which case in linear programming indicates that the highest value of the objective function can go to infinity? | Card: 15 / 20 |
True or False: The graphical method can be used effectively for linear programming problems involving more than two decision variables. | Card: 17 / 20 |
False. The graphical method becomes inadequate when there are more than two decision variables. | Card: 18 / 20 |
What is the maximum possible profit per day if the constraints yield a solution of (20, 10) in a linear programming problem with profit coefficients of 150 and 100? | Card: 19 / 20 |






