Please turn JavaScript on

Yet Another Math Programming Consultant

Is this your feed? Claim it!

Publisher:  Unclaimed!
Message frequency:  0.1 / day

Message History

While running experiments on a simple LP model [1], I wanted to see what Simplex solvers returned when they hit an iteration limit early on. Depending on the iteration limit, the model status could be

intermediate infeasible,intermediate nonoptimal,or optimal.I had a specific reason to look at infeasible or nonoptimal solutions: I wanted to verify that a certain com...

Read full story

This note is about a well-known fact in linear programming: variable splitting and minimizing absolute values lead to complementarity pairs \[r_i^{\bf +} \cdot r_i^{\bf -} = 0\] in the solution. A simple example is implementing LAD (Least Absolute Deviation) regression through Linear Programming.

Let's have a look.


Problem: LAD regression


Read full story

I don't see this that often: a solver that completely hangs. 


Read full story
In the previous post, I discussed covering \(k\) of \(n\) 2d points with the smallest possible rectangle. Minimizing the area yields a nonconvex quadratic objective. Solving these models requires global solvers. If we use the perimeter as a measure of size, the problem becomes linear. An example suggested that the solutions of these two approaches are similar. It certai...

Read full story