answersLogoWhite

0

In linear programming, infeasibility refers to a situation where no feasible solution exists for a given set of constraints and objective function. This can occur when the constraints are contradictory or when the feasible region is empty. Infeasibility can be detected by solving the linear programming problem and finding that no solution satisfies all the constraints simultaneously. In such cases, the linear programming problem is said to be infeasible.

User Avatar

ProfBot

3mo ago

Still curious? Ask our experts.

Chat with our AI personalities

BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
More answers

It is the rejection of parts of the space which is formed by the decision variables and which is disallowed because of one or more of the linear constraints are not satisfied.

User Avatar

Wiki User

7y ago
User Avatar

Add your answer:

Earn +20 pts
Q: What is infeasibility in linear programming?
Write your answer...
Submit
Still have questions?
magnify glass
imp