Question: 6. If all aij values in the entering variable column of the simplex table are negative then: A-solution is unbounded B-solution is degenerate C-there exist

6. If all aij values in the entering variable column of the simplex table are negative then: A-solution is unbounded B-solution is degenerate C-there exist no solution D-there are multiple solutions 7. The " minimum ratio test " is used to select the pivot row in the simplex method for linear programming. A-Ture B-False 8. For a maximization problem, objective function coefficient for an artificial variable is A+M B- M C-Zero D-None of these 9. A " pivot " in a non - basic column of a tableau will make it a basic column. A-Ture B-False 10. The simplex method is a step - by - step procedure for finding the optimal solution to a linear programming problem . To apply simplex method to solving a linear programming problem, it has to be ensured that
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
