Test problem LP

This is a program that generates a test problem for linear optimization with a sparse matrix. The test problem is of the kind

min c'*x
s.t. Aeq*x=beq
lb<=x<=ub

where lb is a zero vector and ub is greater then a zero vector so that the problem has a solution.

The problem that generates is a minimum cost flow network problem. When the problem is generated the program will (if you want) show the graph of the problem.

You call the program with the command

[Aeq,beq,lb,ub,c]=simsys_sparse(m)

where m is the number of rows you want Aeq to have. Before you change some variable in the program you have to choose m>=11.

See the help-notes of each m-file.