**Problem:**

In linear programming, a solution that does not simultaneously satisfy all constraints is called an?

A. illogical solution.

B. intermediate solution.

C. impossible solution.

D. infeasible solution.

0 votes

A Linear Program is infeasible if there exists no arrangement that fulfills the entirety of the constraints - at the end of the day if no feasible result can be raised. Since any genuine activity that you are demonstrating must stay inside the requirements of the real world, infeasibility frequently shows an issue like. Simplex-based LP programming like lp_solve productively distinguishes when no feasible result is conceivable. The wellspring of infeasibility is frequently hard to find. It might come from an error in indicating a portion of the limitations in your model, or from some off-base numbers in your information.