frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Why AI Wants to Be Local – With Pete Warden (Creator of Moonshine Voice)

https://thedataexchange.media/pete-warden-moonshine/
75•datascientist•1h ago•53 comments

How the European Commission rolled out Matrix to more than 40k staff

https://element.io/blog/how-the-european-commission-rolled-out-matrix-to-more-than-40-000-staff/
503•liotier•6h ago•262 comments

Everything you need to survive and rebuild society

https://lastbook.org/
136•tejohnso•2h ago•71 comments

Cooling buildings is overtaking heating them as an energy need, IEA says

https://maccus.fr/en/cooling-overtaking-heating/
60•robtherobber•2h ago•47 comments

Garage Door Spam

https://blog.harrison.page/garage-door-spam/
434•harrisonpage•3d ago•196 comments

Launch HN: Onlook (YC W25) – An open-source developer tool for designers

https://github.com/onlook-dev/onlook/
12•D_R_Farrell•30m ago•2 comments

Google Chrome dev team declares bug report bankruptcy

https://blog.plover.com/tech/bug-reports.html
56•speckx•44m ago•11 comments

Making 8-page foldable zines from a single A4 sheet in the browser

https://krthr.co/paper-folds-and-whats-new-in-fanzines-app/
112•krthr•3h ago•29 comments

Nintendo takes Picofly firmware down from GitHub [video]

https://www.youtube.com/watch?v=-TLCGUpoD6c
157•cowlevel•1d ago•56 comments

Someone reported java4shell bug in September 2026

https://github.com/openjdk/jdk/pull/32781
140•notmine1337•5h ago•41 comments

How to Make the Ink Used to Write Hamlet and the Declaration of Independence

https://lithub.com/how-to-make-the-ink-used-to-write-hamlet-the-declaration-of-independence-and-b...
23•ohjeez•1h ago•5 comments

Ruby2ßhell: Pre-authentication RCE on stock Rails

https://verialabs.com/ruby2shell/
299•jdns•11h ago•123 comments

I built Cornhole News. A Hacker News inspired site for news across the Midwest

https://cornholenews.news
30•cornholemedia•1h ago•25 comments

What's New in PHP 8.6

https://www.php.net/releases/8.6/en.php
199•netol•7h ago•98 comments

UK Government Forced to Admit It Issued Apple a Secret Encryption Order

https://macanorak.com/uk-government-forced-to-admit-it-issued-apple-a-secret-encryption-order/
32•Terretta•43m ago•2 comments

Germany and Austria Call for European Control of TikTok

https://www.techcentral.ie/germany-and-austria-call-for-european-control-of-tiktok/
92•thm•2h ago•76 comments

Distributed, high-performance blob storage on SQLite

https://zerodha.tech/blog/high-performance-distributed-blob-storage/
180•ghostfoxgod•8h ago•49 comments

Oregon library dropped Dewey Decimal system, adopted bookstore-like arrangement

https://www.fastcompany.com/91597520/oregon-library-ditched-dewey-decimal-wayfinding-system
93•bookofjoe•1d ago•73 comments

Do not buy RAM, compress

https://curiousbits.nl/blog/do-not-buy-ram-compress/
105•Ecno92•8h ago•99 comments

C's designated initializers give us named arguments

https://quuxplusone.github.io/blog/2026/11/16/named-arguments-in-c/
49•joshcsimmons•1d ago•37 comments

Unblockable communication with gravity – Science Advances

https://www.science.org/doi/10.1126/sciadv.aee0802
50•rbanffy•4h ago•19 comments

I've Got Your Packages: Harvesting Customers' Delivery Order Information (2020)

https://dl.acm.org/doi/fullHtml/10.1145/3366423.3380062
10•gregsadetsky•3d ago•0 comments

OpenAI still has a WebRTC Problem

https://moq.dev/blog/webrtc-is-still-the-problem/
61•surprisetalk•2h ago•17 comments

SSD prices will start going down the second half of next year

https://www.drivevault.io/blog/when-will-hard-drive-prices-come-down.html
230•illidan1000•7h ago•191 comments

Exponential Behavior in Magic: The Gathering

https://levineuwirth.org/essays/exponential-magic/
56•neuwirth•1d ago•33 comments

15M web servers on one VM – smoltcp, DPDK, AF_XDP

https://kapteko.com/15-million-webservers/
296•fessguid•11h ago•32 comments

It's All about the Allocator

https://aarol.dev/posts/zig-allocator/
26•ibobev•4d ago•4 comments

We taught robots to carve marble sculptures

https://eleanorwiesler.com/blog/robotic-stone-carving/
94•ewiesler•1d ago•73 comments

Show HN: Watch weight-space programming in action with WebGPU

https://tabbyml.github.io/weight-space-playground/
5•wsxiaoys•1h ago•0 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/
317•runesoerensen•17h ago•121 comments
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