frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Open in hackernews

Linear Programming for Fun and Profit

https://modal.com/blog/resource-solver
62•hmac1282•1y ago

Comments

ayhanfuat•1y ago
> X = [x1, ..., Xn]: instances of each type to launch

Is this a continuous variable? Seems discrete to me. I am surprised it is solved by simplex.

Frummy•1y ago
It's the answer, a vector of integers
ayhanfuat•1y ago
Simplex cannot give a vector of integers though, unless the constraint matrix is unimodular. Maybe the integrality constraint was relaxed.
cweld510•1y ago
You're right -- we do relax the integrality constraint, gaining performance at the expense of some precision, and we're generally able to paper over the difference at scheduling time. We've investigated integer linear programming for some use cases, but for solves to run quickly, we have to constrain the inputs significantly.
ayhanfuat•1y ago
Thanks for the clarification. I guess it wouldn’t matter much if the numbers are large. Initially I thought they were mostly ones and zeros.
stncls•1y ago
If this is business critical for you, you may want to switch to a faster solver. Glop is very nice, but it would be reasonable to expect a commercial solver (Gurobi, XPress, COpt) to be 60x faster [1]. By the same measure, the best open source solvers (CLP, HiGHS) are 2-3x faster than Glop.

Actually, the commercial solvers are so fast that I would not be surprised if they solved the IP problem as fast as Glop solves the LP. (Yes, the theory says it is impossible, but in practice it happens.) The cost of a commercial solver is 10k to 50k per license.

[1] ... this 60x number has very high variance depending on the type of problem, but it is not taken out of nowhere, it comes from the Mittelmann LP benchmarks https://plato.asu.edu/ftp/lpopt.html There are also benchmarks for other types of problems, including IP, see the whole list here: https://plato.asu.edu/bench.html

petters•1y ago
If you are able to paper over the fractional numbers and get a usable solution, an integer solver should also be able to find a feasible solution easily. Perhaps not optimal, but better than just solving the LP and rounding
hustwindmaple1•1y ago
You are basically doing a heurstic. Your solutions are not guaranteed to be optimal. Integer programming is the way to do.
cweld510•1y ago
Great to see this post here -- really enjoyed writing it! I think it's really cool how an algorithm from an operational research context can play a critical role in a high-availability large-scale cloud service.
sumtechguy•1y ago
LP is a shockingly good way to optimize a system. If you can put inputs/outputs into the correct form. Had an econ prof that loved these things for doing supply/demand maxima and minimum finding. He didnt outright say it but I think it was his current line of study when I was taking classes from him the 90s. I thought that, as he managed to bring it up in every class he taught.
Onavo•1y ago
Well, kantorovich did win the Nobel for inventing that.
underanalyzer•1y ago
Neat article. I do wish it mentioned that there are polynomial time algorithms to solve linear programming problems. According to the Google ortools docs it has the option to use those as well (but not with the GLOP solver). Might be good for when simplex is struggling (https://developers.google.com/optimization/lp/lp_advanced)
stncls•1y ago
You're right, but it's very subtle and complicated.

In theory, the simplex method is not known to be polynomial-time, and it is likely that indeed it is not. Some variants of the simplex method have been proven to take exponential time in some worst cases (Klee-Minty cubes). What solvers implement could be said to be one such variant ("steepest-edge pricing"), but because solvers have tons of heuristics and engineering, and also because they work in floating-point arithmetic... it's difficult to tell for sure.

In practice, the main alternative is interior-point (aka. barrier) methods which, contrary to the simplex method, are polynomial-time in theory. They are usually (but not always) faster, and their advantage tends to increase for larger instances. The problem is that they are converging numerical algorithms, and with floating-point arithmetic they never quite 100% converge. By contrast, the simplex method is a combinatorial algorithm, and the numerical errors it faces should not accumulate. As a result, good solvers perform "crossover" after interior-point methods, to get a numerically clean optimal solution. Crossover is a combinatorial algorithm, like the simplex method. Unlike the simplex method though, crossover is polynomial-time in theory (strongly so, even). However, here, theory and practice diverge a bit, and crossover implementations are essentially simplified simplex methods. As a result, in my opinion, calling iterior-point + crossover polynomial-time would be a stretch.

Still, for large problems, we can expect iterior-point + crossover to be faster than the simplex method, by a factor 2x to 10x.

There is also first-order methods, which are getting much attention lately. However, in my experience, you should only use that if you are willing to tolerate huge constraint violations in the solution, and wildly suboptimal solutions. Their main use case is when other solvers need too much RAM to solve your instance.

Onavo•1y ago
The most interesting question is how you scrape the prices. The cloudprovider really need to provide an API.
underanalyzer•1y ago
Very interesting! Thanks for the reply. I wonder if they tried these other solvers and decided they were either too slow b/c their problems were too small or the answers were too inaccurate

Gemini 4 Neon

https://blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-4-neon/
539•yigitdemirag•6h ago•492 comments

Unauthenticated remote code execution in Nginx

https://www.wiz.io/blog/nginx-http2-rce-vulnerabilities
1187•speedping•12h ago•531 comments

Multiple vulnerabilities in Regexp and String case conversion

https://www.ruby-lang.org/en/news/2026/11/18/multiple-vulnerabilities-in-regexp-and-string/
116•runesoerensen•3h ago•30 comments

Gemini 4 Neon looks like an Opus 5.5 competitor

https://micjm.com/blog/gemini-4-neon-looks-like-a-top-model/
117•seizethecheese•3h ago•44 comments

Unreal Tournament 2004 in the Browser

https://ut2004.dev/
41•TheAceOfHearts•2h ago•9 comments

Seven new models at scalable price-performance

https://microsoft.ai/news/microsoft-ignite-2026/
469•gmays•11h ago•326 comments

AI agents ask better questions than KPMG accountants in audit trial

https://europeanbusinessmagazine.com/ai-agents-better-questions-kpmg/
384•Betelbuddy•11h ago•169 comments

Inside Deutsche Bank

https://www.inside-db.com/
577•gyre007•11h ago•194 comments

LLM assisted reverse engineering

https://www.slowchronicle.com/posts/llm-assisted-reverse-engineering
93•ioma8•5h ago•27 comments

DNS resolvers are the wrong place to fight piracy

https://techstackups.com/articles/quad9-leaves-france-dns-blocking/
615•ritzaco•14h ago•233 comments

Previous-Token Prediction Based LLM Inversion for Prompt Reconstruction

https://arxiv.org/abs/2607.29378
15•dalmo3•2h ago•4 comments

DaisyRose-27B

https://www.radixark.com/blog/daisyrose-27b
152•de_sty•7h ago•45 comments

Dumping an AES key from a MyQ garage opener to stop rebooting when offline

https://kusha.me/blog/stop_myq_homebridge_819lmb_rebooting/
57•kusha•2d ago•22 comments

We need smart people who give a shit

https://violetpixel.com/blog/2026-11-17-we-need-smart-people-who-give-a-shit/
290•ExMachina73•3h ago•151 comments

AI will not make you rich (2025)

https://colossus.com/article/ai-will-not-make-you-rich/
63•madars•1h ago•39 comments

Genie 4 is now available

https://blog.google/innovation-and-ai/models-and-research/google-deepmind/genie-4-now-available-p...
203•leumon•8h ago•146 comments

Advancing chip design with OpenAI models

https://openai.com/index/advancing-chip-design-with-our-models/
168•vighneshiyer•9h ago•109 comments

The Cambridge Dictionary has named ‘human’ as the Word of the Year 2026

https://www.cam.ac.uk/news/cambridge-dictionary-reveals-word-of-the-year-2026
245•DeepLogin•12h ago•173 comments

FailTrace – Reproduce a failed GitHub Actions run locally from its URL

https://github.com/Ri4dH/failtrace
10•ri4dh•2h ago•0 comments

Anthropic prices initial public offering

https://www.anthropic.com/news/anthropic-prices-initial-public-offering
118•surprisetalk•4h ago•84 comments

Show HN: ExitPath – Open-source ways out of Slack, Notion and Microsoft 365

https://exitpath-ruddy.vercel.app/
175•zerocool0101•11h ago•53 comments

Cuttlefish on Mac: Android's Virtual Device Framework on Apple Silicon

https://engineering.fb.com/2026/11/13/android/cuttlefish-on-mac/
47•acossta•3d ago•10 comments

Show HN: Take Voyager 1 apart, down to a single memory chip

https://rshekhar.com/voyager/
164•raj-shekhar•11h ago•34 comments

Palo Alto Networks to Acquire Applied Compute for $4.5B

https://investors.paloaltonetworks.com/news-releases/news-release-details/palo-alto-networks-acqu...
24•alpb•3h ago•2 comments

Show HN: Open-source, real-time object tracking for live video feeds

https://github.com/aryamandarda/tamserve
53•aryaman_darda•2d ago•2 comments

Launch HN: Maritime (YC F26) – A managed cloud for production AI agents

45•ashriv•10h ago•40 comments

A Collage Showing 49 Drill Holes Made by NASA's Curiosity Mars Rover

https://science.nasa.gov/photojournal/a-collage-showing-49-drill-holes-made-by-nasas-curiosity-ma...
35•wawayanda•2d ago•4 comments

Collisions in Hash Functions

https://collisions.zksecurity.xyz/
9•baby•2d ago•4 comments

My computer misbehaved so I went down a rabbit hole (2019)

https://leonwu.tech/posts/my_computer_misbehaved_so_i_went_down_a_rabbit_hole
5•sammatilda•1d ago•0 comments

The x86 CPU: From 4004 to 486

https://pikuma.com/blog/history-of-x86-4004-to-486
151•ibobev•12h ago•47 comments