Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...
We introduce the Symmetric Reduction Ansatz at a point from the closure of the feasible set in generalized semi-infinite programming. A corresponding Symmetric Reduction Lemma is s...
: This short article offers economically intuitive proofs of the Euler equation and the maximum principle based on one of the best known results in economics, namely that the margi...
Elementary symmetric polynomials can be thought of as derivative polynomials of En(x) = i=1,...,n xi. Their associated hyperbolicity cones give a natural sequence of relaxations f...
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...