A Shadow Simplex Method for Infinite Linear Programs
Operations Research
Journal of Global Optimization
Hi-index | 0.00 |
Minimizing a separable convex objective subject to an ordering restriction on its variables is a generalization of a class of problems in statistical estimation and inventory control. It is shown that a pool adjacent violators (PAV) algorithm can be ...