Please state which statement is true.
(i) All linear programming problems may not have unique solutions
(ii) The artificial variable technique is not a device that does not get the starting basic feasible solution.

Related MCQs

• Please state which statement is true. (i) All linear programming problems may not have unique solutions (ii) The artificial variable technique is not a device that does not get the starting basic feasible solution.
• A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• Please state which statement is incorrect. (i) Linear programming was first formulated by an English economist L.V. Kantorovich (ii) LP is generally used in solving maximization or minimization problems subject to certain assumptions.
• Please state which statement is incorrect. (i) Linear programming was first formulated by an English economist L.V. Kantorovich (ii) LP is generally used in solving maximization or minimization problems subject to certain assumptions.
• A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• State which of the two statements is correct (i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
• State which of the two statements is correct (i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
• Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐