frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Carnegie Mellon is putting computer science courses on YouTube for free

https://www.cs.cmu.edu/learn/
1138•pcompeau•9h ago•166 comments

Windows 11 Is Collecting Data on Which Coding Agents and Developer Tools You Use

https://xusheng.dev/posts/windows-coding-agent-telemetry/
439•cwaffles•7h ago•281 comments

BugMeNot has closed

https://www.bugmenot.com/
438•lode•8h ago•210 comments

Optimizely compromised, served malware on Zoom, GitLab

https://blog.report-uri.com/worlds-largest-brands-infected-with-malware-via-optimizely/
240•kristjansson•7h ago•101 comments

Test/verification technique effectiveness with Astra

https://danluu.com/astra-testing/
15•luu•22h ago•0 comments

OpenCode Browse

https://opencode.ai/product/browse
198•mfiguiere•8h ago•91 comments

Running coding agents without handing them my credentials

https://blog.antonio.cx/running-agents-with-lend
83•antoniomika•4h ago•39 comments

Why did modems have speakers? (2019)

https://retrocomputing.stackexchange.com/questions/11765
33•Skyfall106•1d ago•17 comments

Why 3dfx 1 cards had such a washed out color output?

https://twitter.com/id_aa_carmack/status/2122478083319992513
65•mfiguiere•5h ago•8 comments

Chemistry is Actually Geometry

https://chillphysicsenjoyer.substack.com/p/chemistry-is-actually-geometry
183•sebg•9h ago•89 comments

Frame – 31.5" color ePaper display

https://trmnl.com/blog/introducing-frame
368•geerlingguy•13h ago•257 comments

Jiff 1.0: A datetime library for Rust

https://burntsushi.net/jiff/
353•burntsushi•13h ago•79 comments

Formal Verification Is Not Verifiable

https://alperenkeles.com/posts/formal-verification-is-not-verifiable/
100•zdw•2d ago•35 comments

Grazing sheep in fields with solar arrays

https://news.cornell.edu/stories/2026/10/sheep-grazing-solar-fields-offers-farmers-economic-ecolo...
251•PaulHoule•12h ago•241 comments

Comcast's "fiber-powered Wi-Fi" is cable, AT&T says in false advertising case

https://arstechnica.com/tech-policy/2026/11/comcast-falsely-advertises-cable-internet-as-fiber-po...
106•jaredwiener•9h ago•87 comments

Launch HN: Axonnic (YC F26) – Sleeves that track fingers and estimate force

36•arshpatankar•9h ago•17 comments

How to Break into Security, Ptacek Edition (2012)

https://krebsonsecurity.com/2012/06/how-to-break-into-security-ptacek-edition/
97•ronfriedhaber•7h ago•24 comments

Do Repeat Yourself

https://arcentry.com/blog/do-repeat-yourself/
67•max_sendfeld•18h ago•19 comments

Technical issue at JPMorgan Chase triggers online banking delays for US banks

https://apnews.com/article/bank-outage-chase-wells-fargo-truist-50fee2693c22f597fa6ca51a97ef2cda
749•samk3nny•11h ago•626 comments

Spamhaus new email sender requirements in November

https://www.spamhaus.org/sender-guidelines/
90•computer23•8h ago•83 comments

Squircles

https://linebender.org/wiki/curves/squircle/
166•raphlinus•22h ago•45 comments

Microsoft blames monster email outage on software defect introduced in July fix

https://www.theregister.com/saas/2026/11/16/microsoft-blames-monster-email-outage-on-software-def...
274•Bender•16h ago•195 comments

Atomic Nuked Veteran

https://www.armscontrolwonk.com/archive/201309/atomic-nuked-veteran/
35•hubraumhugo•23h ago•7 comments

My Quest to push native Three.js quality match AAA Game Engines

https://ben3d.ca/blog/building-the-aaa-lighting-pipeline-in-threejs
125•bhouston•9h ago•46 comments

Show HN: Sutra-OS – A self-hosted ontology platform

https://github.com/0nelight/sutra-os
47•0nelight•6h ago•24 comments

Rust changed me as a developer

https://blog.startifact.com/posts/how-rust-changed-me/
238•speckx•9h ago•145 comments

Tokendoctor – the same Claude Code for up to 38% less

https://github.com/localixai/tokendoctor
12•rsaryev1997•3h ago•3 comments

The most expensive bargaining chip in history

https://unrelatedfindings.com/essays/the-most-expensive-bargaining-chip-in-history/
16•vext_cwm_fly•3h ago•14 comments

United Airlines experiencing a widespread system outage, airline says

https://www.cnn.com/2026/11/16/us/united-airlines-outage
226•bearsyankees•8h ago•116 comments

Pentagon fails ninth straight audit despite progress in organizing finances

https://www.reuters.com/business/aerospace-defense/pentagon-fails-ninth-straight-audit-despite-pr...
98•petethomas•5h ago•32 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