Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Linear Programming Optimization #47

Open
reenashah opened this issue Dec 3, 2013 · 4 comments
Open

Linear Programming Optimization #47

reenashah opened this issue Dec 3, 2013 · 4 comments

Comments

@reenashah
Copy link

Here is a summary of the Linear Programming Optimization that we discussed today with Professor Stark. Hopefully this is a helpful resource.

Also, if you have any background in linear programming (or willing to learn!), comment on this issue so that we can form a group and begin discussing a potential solution.

I have linear programming experience, and some experience with AMPL.

@davidwang001
Copy link

Thanks @reenashah, this is really helpful

@timothyhoang
Copy link

If it is possible to linearize A sub m, then we can use the simplex function in the SciPy package:
http://docs.scipy.org/doc/scipy/reference/tutorial/optimize.html

@davidwang001
Copy link

Could you expand on what you mean by linearize A sub m, and what simplex does?

@bonghyun5
Copy link

Simplex is al algorithm to solve linear programming problems. Most
mathematical packages have a way of solving them already

On Wed, Dec 4, 2013 at 12:31 AM, davidwang001 [email protected]:

Could you expand on what you mean by linearize A sub m, and what simplex
does?


Reply to this email directly or view it on GitHubhttps://github.com//issues/47#issuecomment-29787366
.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

4 participants