Separable convex optimization problems with linear ascending constraints

@article{Padakandla2009SeparableCO,
  title={Separable convex optimization problems with linear ascending constraints},
  author={Arun Padakandla and Rajesh Sundaresan},
  journal={SIAM Journal on Optimization},
  year={2009},
  volume={20},
  pages={1185-1204}
}
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum point in a finite number of steps is described. The optimum value is shown to be monotone with respect to a partial order on the constraint parameters. Moreover, the optimum value is convex with respect to these parameters. This work generalizes the existing algorithms of Morton, von Randow, and Ringwald [Math… CONTINUE READING

From This Paper

Topics from this paper.
7 Citations
30 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 30 references

R

  • G. Morton
  • von Randow, and K. Ringwald, A greedy algorithm…
  • 1985
Highly Influential
8 Excerpts

Disaggregation and resource allocation using convex knapsack problems with bounded variables

  • G. R. Bitran, A. C. Hax
  • Management Sci., 27
  • 1981
Highly Influential
5 Excerpts

The theory of search: Optimum distribution of search effort

  • A. Charnes, W. W. Cooper
  • Management Sci., 5
  • 1958
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…