App Logo

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:

Which of the following location analysis techniques involves a method of evaluating different locations based on the load being transported and the distance?
The first and last activities of a network diagram
Simplex problem is considered as infeasible when
Which of the following is NOT correct critical path method (CPM) used in Project scheduling?
Any linear programming model must have all of the following properties EXCEPT: