MP
2010
13 years 6 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
MP
2010
13 years 6 months ago
2010
MP
2010
13 years 6 months ago
2010
MP
2010
13 years 6 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
MP
2010
13 years 6 months ago
2010
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
MP
2010
13 years 6 months ago
2010
Let S = {x Rn : g1(x) 0,
MP
2010
13 years 6 months ago
2010
MP
2010
13 years 6 months ago
2010
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
MP
2010
13 years 10 months ago
2010
MP
2010
13 years 10 months ago
2010
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...