Convex Duality and Calculus: Reduction to Cones
Author
Abstract
Suggested Citation
DOI: 10.1007/s10957-009-9574-8
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Wilco Van den Heuvel & Albert P. M. Wagelmans, 2010.
"Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics,"
Operations Research, INFORMS, vol. 58(1), pages 59-67, February.
- van den Heuvel, W. & Wagelmans, A.P.M., 2007. "Worst case analysis for a general class of on-line lot-sizing heuristics," Econometric Institute Research Papers EI 2007-46, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Wilco Van den Heuvel & Albert P. M. Wagelmans, 2010.
"Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics,"
Operations Research, INFORMS, vol. 58(1), pages 59-67, February.
- van den Heuvel, W. & Wagelmans, A.P.M., 2007. "Worst case analysis for a general class of on-line lot-sizing heuristics," Econometric Institute Research Papers EI 2007-46, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 0. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
- van den Heuvel, W.J. & Wagelmans, A.P.M., 2008. "A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters," Econometric Institute Research Papers EI 2008-10, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Adam N. Elmachtoub & Retsef Levi, 2015. "From Cost Sharing Mechanisms to Online Selection Problems," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 542-557, March.
- Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
- Niv Buchbinder & Tracy Kimbrel & Retsef Levi & Konstantin Makarychev & Maxim Sviridenko, 2013. "Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms," Operations Research, INFORMS, vol. 61(4), pages 1014-1029, August.
- Massonnet, G. & Gayon, J.-P. & Rapine, C., 2014. "Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand," European Journal of Operational Research, Elsevier, vol. 234(3), pages 641-649.
- Guanqun Ni, 2023. "An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller," Journal of Combinatorial Optimization, Springer, vol. 46(2), pages 1-14, September.
- Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 2022. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2246-2268, November.
- Adam N. Elmachtoub & Retsef Levi, 2016. "Supply Chain Management with Online Customer Selection," Operations Research, INFORMS, vol. 64(2), pages 458-473, April.
- Absi, Nabil & van den Heuvel, Wilco, 2019. "Worst case analysis of Relax and Fix heuristics for lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 279(2), pages 449-458.
More about this item
Keywords
Convex analysis; Duality; Calculus; Convex cones; Binary operations; Optimization;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:143:y:2009:i:3:d:10.1007_s10957-009-9574-8. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.