MTH601 Quiz 3 Solution 2026 by Iqra Azhar

1. If the optimum solution of a Linear Programming problem is finitely unique, its corresponding objective function must have: o (a) infinite o (b) arbitrary o (c) NO o (d) finite Correct

Q2. While solving a LP by Simplex method, which of the following corresponds to corner points of the feasible region in Graphical method?

o (a) non-negative solutions o (b) basic feasible solution Correct o (c) non-feasible solution o (d) non-basic feasible solution

3. While applying Simplex method to a LP of minimization type,

o (a) decreases Correct o (b) oscillate o (c) increases o (d) does not change

4. While applying Simplex method to a LP of maximization type,

o (a) increases Correct o (b) oscillates o (c) decreases o (d) does not change

5. Shortcoming of Big M method is that the value of M could be:

o (a) positive o (b) very small o (c) negative o (d) very large Correct

6. In the Simplex method, Gauss Jordan Elimination method demands that all the key column's entries should be ________ except key row (pivot) entry: o (a) maximum or minimum o (b) strictly negative o (c) strictly positive o (d) zero Correct

7. The positive slack variables indicate:

o (a) idle(waste) resource o (b) excess resource available Correct o (c) shortage of resources o (d) nil resources

8. After converting constraints into standard equalities, an LP problem has 4 equations in 6 variables. The number of possible combinations of basic feasible solutions is: o (a) 15 Correct o (b) 24 o (c) 2 o (d) 10
9. By Simplex method, to minimize (Z = 2x + 9y), if (z = A > 0) in the initial iteration, the next entering variable is: o (a) y > 0 Correct o (b) x < 0 o (c) x > 0