Related Posts

Q. For solving an assignment problem, which method is used?

Q. A path formed by allowing horizontal and vertical lines and the entire corner cells of which are occupied is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

Q. In simplex algorithm , which method is used to deal with the situation where an infeasible starting basic solution is given?

Q. Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐

Q. 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.

Q. Who pointed out that the businessman always studies his production function and his input prices and substitutes one input for another till his costs become the minimum possible?

Q. A BFS of a LPP is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ if at least one of the basic variable is zero

Q. The solution need not be in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ numbers

Q. 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

Q. The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐