While solving a LP problem, infeasibility may be removed by?
A. Adding another constraint
B. Adding another variable
C. Removing a constraint
D. Removing a variable
Answer: Option C
Solution(By Examveda Team)
While solving a LP problem, infeasibility may be removed by removing a constraint. A linear program is infeasible if there exists no solution that satisfies all of the constraints in other words, if no feasible solution can be constructed.This Question Belongs to Management >> Operations Research
Join The Discussion
Comments ( 1 )
Related Questions on Operations Research
A. Is possible when the variables value is known
B. Reduces the scope of judgement & intuition known with certainty in decision-making
C. Require the use of computer software
D. None of the above
A. Must be deterministic
B. Requires computer aid for its solution
C. Represents data in numerical form
D. All of the above
A physical model is example of.
A. An iconic model
B. An analogue model
C. A verbal model
D. A mathematical model
The qualitative approach to decision analysis relies on.
A. Experience
B. Judgement
C. Intuition
D. All of the above
Ok