Is there a way to know if constraints are not too restricitve.

3 次查看（过去 30 天）
Johan
Johan 2013-2-8
Hi everyone,
I was wondering, given a constraint type a.x =<b
Is there a quick way to know if the boundaries are not too restrictive to allow at least one solution?
Given an easy example:
[0 0 -1 -1 -0.5; -1 -1 0 0 -0.5; -1 -1 -1 -1 -1; 1 1 1 1 1]
Thank you!

请先登录，再回答此问题。

采纳的回答

Matt J
Matt J 2013-2-8
编辑：Matt J 2013-2-8
If you know it to be a bounded feasible set, you can check if it has a non-empty set of vertices using LCON2VERT in
http://www.mathworks.com/matlabcentral/fileexchange/30892-representing-polyhedral-convex-hulls-by-vertices-or-inequalities
  7 个评论
显示 5更早的评论
Johan
Johan 2013-2-8
I think I am hopeless, but it is what I am looking for. I want to know if the fact of putting constraints such as 1*a > 1, 1*b>1, a+b =1. In that case it is impossible to find a solution... Thank you for your answers.
Matt J
Matt J 2013-2-8
Then you should restore your question back to its original form. You are asking about whether the feasible set is empty/nonempty, not whether the feasible set is bounded/unbounded.
In any case, you have both answers, but it is practical mainly for low dimensional problems.

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Mathematics and Optimization 的更多信息

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by