How to get alternative solutions to a linear programming problem using linprog?

11 次查看（过去 30 天）
Nihat Sayar
Nihat Sayar 2011-1-25
Hi,
I am trying to solve a linear programming problem using linprog with no inequalities and an equalities matrix that is 4633-by-10683 in size. As far as I understand, that means there is no unique solution for this problem and I want to be able to arrive at some of the alternative solutions other than the one that running linprog yields. One trick I can think of is to change some of the lower & upper boundary values on the design variables in order to change the solution. I am wondering if there are other ways (maybe changing an internal parameter of the solver function?) to try in order to get at alternative solutions over successive runs of linprog.
Many thanks,
Al

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

回答（1 个）

Rakesh Kumar
Rakesh Kumar 2011-4-12
Why do you think there won't be a unique solution? When you have a linear objective (bounded) and constraints are linear (and bounded) you get a unique solution. At the solution constraints may be dependent but the solver should be able to take care of that.
Hth, Rakesh

类别

在 Help Center 和 File Exchange 中查找有关 Solver Outputs and Iterative Display 的更多信息

标签

产品

Community Treasure Hunt

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

Start Hunting!

Translated by