6 ms·

You are totally correct, this is only a typo in latex which I have just pushed a fix for. Thank for you the note.

• hyperman1 5y ago
  Now it says 404. The correct URL has a -1 after it Update: Eight o'clock and all is well ;-). Thanks for the interesting article.
  • stefanpie 5y ago
    Should be back to normal again, apologies for the issues, web dev is not my strong point
    • antoine-levitt 5y ago
      ... And so that constraint forces R1 to be zero? Note that finding a solution to the problem originally stated is equivalent to a linear programming problem, which (for such a simple problem) can easily be solved exactly.
      • deleted 5y ago
        [deleted]
      • kragen 5y ago
        Dividing by R₁ + 2R₂ is not linear, and neither is multiplying C by R₁ + 2R₂, nor dividing by that product. But you could maybe formulate a linear objective function that solves this problem correctly, and then you could formulate the component selection problem as a MILP problem and solve it with GMPL/MathProg/GLPK or the COIN-OR tools. Glancing at it, though, it isn't obvious to me how to formulate it linearly. How would you do it?