-1
$\begingroup$

I have an optimization problem and was using a linear programming optimizer to find solutions. However, I find that past a certain size, the problem becomes "infeasible" and has no solutions.

So I am wondering if it is possible to access the mathematical techniques / algorithms / computations that are used to determine that the problem is infeasible. It would help me understand why I am getting no solutions past a certain point.

Thank you.

Improve this question
New contributor
Bamboozle is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
$\endgroup$
1
  • $\begingroup$ If it is a continuous LP then the optimizer should give you an infeasibility certificate, ie. a (small, if you're lucky) set of conflicting constraints. Finding a certificate is not any different than optimizing and is typically just one of the conclusions the optimizer can reach. Check for instance "Farkas lemma". From your description ("past a certain size") it could also be numerical issues or the like that come into play, especially if you actually expect it to always be feasible. $\endgroup$
    – Michal Adamaszek
    Commented Dec 9 at 13:18

0

Reset to default

Browse other questions tagged .