1
$\begingroup$

I have a linear program without an objective function. That is, I am looking for a feasible solution to a given set of linear constraints. Is there a specific term for such problems? Likewise, for integer linear programs also, is there a precise term? How would it be different from a SAT/SMT problem?

$\endgroup$
1
  • 1
    $\begingroup$ I would call it the (integer) feasibility problem for a polyhedron $\endgroup$ – LinAlg Nov 19 '20 at 1:04

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.