A minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the ...........................

Related MCQs

• In maximisation cases, ....................... are assigned to the artificial variables as their coefficients in the objective function.
• For a minimisation Transportation Problem, the objective is to minimise:
• In a maximisation assignment problem, the objective is to maximise .............................
• If a decision theory problem has 3 decision alternatives and 4 states of nature, the number of payoffs in that problem will be
• When total supply is equal to total demand in a transportation problem , the problem is said to be
• Every Linear Programming Problem is related to another Linear Programming Problem, called ..........................
• While plotting constraints on a graph paper, terminal points on both axes are connected by a straight line because
• The initial solution of a transportation problem can be obtained by applying any known method. But the only condition is
• An assignment problem can be solved by .........................
• The Hungarian method for solving an assignment problem can also be used to solve: