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

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

Answer 1

[Rakesh Kumar]

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