I have a set of variables $x_i$ for which $x_i \ge 0$, and a set of linear equations relating them: $A \mathbf{x} \le \mathbf{b} $. The typical constraints for a linear program. Is there a general way to check if the region of feasible solutions is actually just a single point? Maybe something analogous to the determinant?
$\begingroup$
$\endgroup$
2
-
$\begingroup$ can you provide the actual problem you're referring to? $\endgroup$– SetFeb 18, 2019 at 4:22
-
$\begingroup$ I edited the post to reflect the desire for a general method $\endgroup$– user3433489Feb 18, 2019 at 13:34
Add a comment
|