ExamVeda
Login
Home

While solving a LP problem infeasibility may be removed by

This question belongs to Management Operations Research
Operations Research
?

While solving a LP problem, infeasibility may be removed by?

Answer & Solution
Correct Answer: Option C
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.
Examveda
Question posted by Examveda
Community

Join the Discussion

1 Comment
Prathik Patil
Prathik Patil 5 years ago
Ok
Keep Learning

Related Questions on Operations Research

The use of decision models.
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
Every mathematical model.
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
More Related Questions on Operations Research