We're talking about metal products factory. There is machine which cuts long iron bars to smaller parts which are later used for creating various products. For example, I have requirement to produce bars of following length and quantity: 2 pieces of 248mm, 5 of 1150mm, 6 of 2843mm, 3 of 3621mm. That is the partitioning output. O...
I'm looking at the standard definition of the assignment problem as defined here My question is to do with the two constraints (latex notation follows): \sum_{j=1}^n(x_{ij}) = 1 for all i = 1, ... , n \sum_{i=1}^n(x_{ij}) = 1 for all j = 1, ... , n Specifically, why the second constraint required? Doesn't the first already cover all ...
Is there an open source alternative to Mosek? Basically, I'm looking for large scale convex optimization solver packages. Thanks! EDIT: Forgot to mention earlier, problem is non-linear; mostly quadratic, but occasionally may need non-quadratic constraints + non-quadratic objective ...