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

Introduction to Linear Programming in Python | Maxime Labonne #5

Open
utterances-bot opened this issue May 12, 2022 · 5 comments
Open

Comments

@utterances-bot
Copy link

Introduction to Linear Programming in Python | Maxime Labonne

A guide to mathematical optimization with Google OR-Tools

https://mlabonne.github.io/blog/linearoptimization/

Copy link

DeanStra commented May 12, 2022

This is very useful, thanks! Out of interest why did it take my program 184037.00 milliseconds to solve? Is your pc really more than 2,000 times faster? I was entering the code in IDLE.

edit: the answer comes ~instantaneously but IDLE says it's taking a number of seconds.

Copy link

Useful blog on explain OR tools with interested war game. It is ready user friendly and OR tools and support multi model.

================= Solution =================
Solved in 1.00 milliseconds in 2 iterations

Optimal power = 1800.0 💪power
Army:

  • 🗡️Swordsmen = 6.0000000000000036
  • 🏹Bowmen = 0.0

Copy link
Owner

Thanks for your feedback!

@DeanStra This is strange, is it value returned by solver.wall_time() or another measure provided by IDLE?

@DeanStra
Copy link

DeanStra commented May 13, 2022 via email

Copy link
Owner

@DeanStra No problem, I just wanted to check where this "184037.00 milliseconds" value comes from. It's probably nothing important, I'm glad if it works better for you with Jupyter Notebook.

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

No branches or pull requests

4 participants