Integer Isotone Optimization

Consider the following integer isotone optimization problem. Given an n-vector x find an n-vector y with integer components so as to minimize $\max\{w_j|x_j - y_j| : 1 \leq j \leq n\}$ subject to $y_1 \leq y_2 \leq \cdots \leq y_n$, where each weight $w_j > 0$. In this article, the dual of this prob... View More