Random Projections for Linear Programming
Author
Abstract
Suggested Citation
DOI: 10.1287/moor.2017.0894
Download full text from publisher
References listed on IDEAS
- Daniela Pucci de Farias & Benjamin Van Roy, 2004. "On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 462-478, August.
- George B. Dantzig, 1990. "The Diet Problem," Interfaces, INFORMS, vol. 20(4), pages 43-47, August.
- Miles Lubin & Iain Dunning, 2015. "Computing in Operations Research Using Julia," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 238-248, May.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Leo Liberti & Benedetto Manca, 2022. "Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections," Journal of Global Optimization, Springer, vol. 83(1), pages 83-118, May.
- Leo Liberti, 2020. "Distance geometry and data science," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 271-339, July.
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.- Jing Wu & Lijie Su & Gongshu Wang & Yang Yang, 2024. "Approximated Dynamic Programming for Production and Inventory Planning Problem in Cold Rolling Process of Steel Production," Mathematics, MDPI, vol. 12(24), pages 1-17, December.
- Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
- Dimitris Bertsimas & Arthur Delarue & Patrick Jaillet & Sébastien Martin, 2019. "Travel Time Estimation in the Age of Big Data," Operations Research, INFORMS, vol. 67(2), pages 498-515, March.
- Torres-Rojo, J. M., 2001. "Risk management in the design of a feeding ration: a portfolio theory approach," Agricultural Systems, Elsevier, vol. 68(1), pages 1-20, April.
- L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
- Nemirovski, Arkadi, 2012. "On safe tractable approximations of chance constraints," European Journal of Operational Research, Elsevier, vol. 219(3), pages 707-718.
- Davi Valladão & Thuener Silva & Marcus Poggi, 2019. "Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns," Annals of Operations Research, Springer, vol. 282(1), pages 379-405, November.
- Onur Babat & Juan C. Vera & Luis F. Zuluaga, 2021. "Computing near-optimal Value-at-Risk portfolios using Integer Programming techniques," Papers 2107.07339, arXiv.org.
- Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
- Meissner, Joern & Strauss, Arne, 2012.
"Network revenue management with inventory-sensitive bid prices and customer choice,"
European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
- Joern Meissner & Arne Strauss, 2008. "Network Revenue Management with Inventory-Sensitive Bid Prices and Customer Choice," Working Papers MRG/0008, Department of Management Science, Lancaster University, revised Apr 2010.
- Ethan Anderes & Steffen Borgwardt & Jacob Miller, 2016. "Discrete Wasserstein barycenters: optimal transport for discrete data," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(2), pages 389-409, October.
- Dowson, Oscar & Philpott, Andy & Mason, Andrew & Downward, Anthony, 2019. "A multi-stage stochastic optimization model of a pastoral dairy farm," European Journal of Operational Research, Elsevier, vol. 274(3), pages 1077-1089.
- Michael H. Veatch, 2013. "Approximate Linear Programming for Average Cost MDPs," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 535-544, August.
- Dallinger, Bettina & Schwabeneder, Daniel & Lettner, Georg & Auer, Hans, 2019. "Socio-economic benefit and profitability analyses of Austrian hydro storage power plants supporting increasing renewable electricity generation in Central Europe," Renewable and Sustainable Energy Reviews, Elsevier, vol. 107(C), pages 482-496.
- Daniel Adelman & Adam J. Mersereau, 2008. "Relaxations of Weakly Coupled Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 56(3), pages 712-727, June.
- Sánchez, Antonio & Martín, Mariano & Zhang, Qi, 2021. "Optimal design of sustainable power-to-fuels supply chains for seasonal energy storage," Energy, Elsevier, vol. 234(C).
- Dimitris Bertsimas & Velibor V. Mišić, 2017. "Robust Product Line Design," Operations Research, INFORMS, vol. 65(1), pages 19-37, February.
- Purva Grover & Arpan Kumar Kar, 2017. "Big Data Analytics: A Review on Theoretical Contributions and Tools Used in Literature," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 18(3), pages 203-229, September.
- Feng, Wei & Feng, Yiping & Zhang, Qi, 2021. "Multistage robust mixed-integer optimization under endogenous uncertainty," European Journal of Operational Research, Elsevier, vol. 294(2), pages 460-475.
- Hesaraki, Alireza F. & Dellaert, Nico P. & de Kok, Ton, 2019. "Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan," European Journal of Operational Research, Elsevier, vol. 275(1), pages 304-318.
More about this item
Keywords
Johnson-Lindenstrauss lemma; concentration of measure; dimension reduction;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:inm:ormoor:v:43:y:2018:i:4:p:1051-1071. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.