search

stat157 / background

0 stars 4 forks source link

Linear Programming Optimization #47

Open reenashah opened 10 years ago

reenashah commented 10 years ago

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 commented 10 years ago

Thanks @reenashah, this is really helpful

timothyhoang commented 10 years ago

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 commented 10 years ago

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

bonghyun5 commented 10 years ago

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 notifications@github.comwrote:

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/stat157/background/issues/47#issuecomment-29787366 .