Challenger App

No.1 PSC Learning App

1M+ Downloads
In linear programming problem when does feasibility change?

Achange in objective functions coefficient

Bchange in right hand side of feasible region

CAdiction of new variavle

DFeasibility does not change

Answer:

B. change in right hand side of feasible region

Read Explanation:

Feasibility changes in linear programming when there is a change in the right-hand side of the feasible region. Changes in non-binding constraints do not affect the solution. However, if a binding constraint is changed, the solution may change. Optimal measures of performance may change, and a parallel shift must be made in the graph of that constraint. The dual variable associated with the constraint measures how much the objective function will be influenced by the change.


Related Questions:

For which of the following situations, linear programming can be applied?
A Transportation firm has 4 exit (Supply) point and 5 entry (Demand) points. The total number of entries is greater than exits. So the number of iterations excluding degeneracy would be:
Dangling phenomenon in a network diagram
______________ may be defined as any adjustment to the arrow diagram which becomes necessary owing to departure from the project schedule laid down earlier.
Identify the odd one out with respect to queuing theory.