The amount that the objective function coefficient of a decision variable would have to improve before that variable would have a positive value in the solution is the

Related MCQs

• The solution shown was obtained by Vogel's approximation. The difference between the objective function for this solution and that for the optimal is
• The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current solution because
• A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation table is
• The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are
• Which of the following is a valid objective function for a linear programming problem?
• The per-unit change in the objective function associated with assigning flow to an unused arc in the transportation simplex method is called the
• Maximization of objective function in an LP model means
• . ………..is a method of analyzing the current movement of the same variable in an effort to predict the future movement of the same variable.
• Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to
• If two constraints do not intersect in the positive quadrant of the graph, then