An infeasible problem is one for which Group of answer choices the objective is maximized or minimized by more than one combination of decision variables. there is no solution that simultaneously satisfies all the constraints. the Allowable Increase or Allowable Decrease values for changing cells are zero. there is exactly one solution that will results in the maximum or minimum objective.

there is no solution that simultaneously satisfies all the constraints.

Step-by-step explanation:

An infeasible problem is one for which there is no solution that simultaneously satisfies all the constraints.

In linear programming, when a linear problem or program has no solution that simultaneously satisfies all the constraints i.e no feasible solution can be generated or gotten, then, the problem is said to be an infeasible problem. This ultimately implies that, an infeasible problem is one that does not have an optimal solution for all of its constraints (linear and non-linear constraints).

For example, when the demand requirement in a manufacturing plant or industry is much greater than its available capacity this will result into an infeasible problem. Also, when various functional managers in different departments in an organization have varying degree of requirements because there won't be an optimal solution.