Some times I have to solve large scale linear programming where the the constraints are given in matrix. However, all tutorials provided only demonstrate very small scale cases. What if I have a linear programming given in a 1000*400 matrix. How to solve such a linear programming in Sage? Do I need to use another package to solve such linear programming problems?
Using a matrix of constraints has been implemented, and will be released soon (in Sage 6.4). See http://trac.sagemath.org/ticket/16714 You already might try installing the changes from this ticket into Sage 6.3 and use them.
Did you try anything ? What happens if you input your matrix in the examples given in the tutorial ?
Look at the linear_program function on this page, use RDF for your floating-point real numbers, and tell us what happens !
Thank you so much for your suggestions. I went to the page you mentioned above and my problem was well solved.
I would also like to take your answer as a correct answer. However, it seems that the system allows only one correct answer. Even though we already have an linear_program function in sage to solve LP in matrix form. However, to my knowledge, [Dima](http://trac.sagemath.org/ticket/16714) provides an new syntax to solve MILP in matrix form. So let us leave the credit to the real contributors of sage.
Asked: 2014-09-15 15:57:38 +0100
Seen: 2,136 times
Last updated: Sep 15 '14
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
