IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v52y2012i2p345-371.html
   My bibliography  Save this article

Scaling linear optimization problems prior to application of the simplex method

Author

Listed:
  • Joseph Elble
  • Nikolaos Sahinidis

Abstract

No abstract is available for this item.

Suggested Citation

  • Joseph Elble & Nikolaos Sahinidis, 2012. "Scaling linear optimization problems prior to application of the simplex method," Computational Optimization and Applications, Springer, vol. 52(2), pages 345-371, June.
    • Handle: RePEc:spr:coopap:v:52:y:2012:i:2:p:345-371
    DOI: 10.1007/s10589-011-9420-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-011-9420-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-011-9420-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Robert E. Bixby, 2002. "Solving Real-World Linear Programs: A Decade and More of Progress," Operations Research, INFORMS, vol. 50(1), pages 3-15, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ole Bent Olesen & Niels Christian Petersen & Victor V. Podinovski, 2022. "Scale characteristics of variable returns-to-scale production technologies with ratio inputs and outputs," Annals of Operations Research, Springer, vol. 318(1), pages 383-423, November.
    2. Csaba Fábián & Krisztián Eretnek & Olga Papp, 2015. "A regularized simplex method," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 877-898, December.
    3. Sultan Almotairi & Elsayed Badr & Mustafa Abdul Salam & Hagar Ahmed, 2023. "Breast Cancer Diagnosis Using a Novel Parallel Support Vector Machine with Harris Hawks Optimization," Mathematics, MDPI, vol. 11(14), pages 1-25, 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.
    1. Thiago Serra & Ryan J. O’Neil, 2020. "MIPLIBing: Seamless Benchmarking of Mathematical Optimization Problems and Metadata Extensions," SN Operations Research Forum, Springer, vol. 1(3), pages 1-6, September.
    2. Bach, Lukas & Hasle, Geir & Schulz, Christian, 2019. "Adaptive Large Neighborhood Search on the Graphics Processing Unit," European Journal of Operational Research, Elsevier, vol. 275(1), pages 53-66.
    3. Ole Bent Olesen & Niels Christian Petersen & Victor V. Podinovski, 2022. "Scale characteristics of variable returns-to-scale production technologies with ratio inputs and outputs," Annals of Operations Research, Springer, vol. 318(1), pages 383-423, November.
    4. Cambero, Claudia & Sowlati, Taraneh, 2014. "Assessment and optimization of forest biomass supply chains from economic, social and environmental perspectives – A review of literature," Renewable and Sustainable Energy Reviews, Elsevier, vol. 36(C), pages 62-73.
    5. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
    6. Castro, Jordi, 2006. "Minimum-distance controlled perturbation methods for large-scale tabular data protection," European Journal of Operational Research, Elsevier, vol. 171(1), pages 39-52, May.
    7. Zygmunt Stanula & Marek Wieruszewski & Adam Zydroń & Krzysztof Adamowicz, 2023. "Optimizing Forest-Biomass-Distribution Logistics from a Multi-Level Perspective—Review," Energies, MDPI, vol. 16(24), pages 1-17, December.
    8. Defeng Liu & Andrea Lodi & Mathieu Tanneau, 2021. "Learning chordal extensions," Journal of Global Optimization, Springer, vol. 81(1), pages 3-22, September.
    9. Andrey M. Lizyayev, 2009. "Stochastic Dominance: Convexity and Some Efficiency Tests," Tinbergen Institute Discussion Papers 09-112/2, Tinbergen Institute, revised 05 Jan 2010.
    10. Timo Berthold & Jakob Witzig, 2021. "Conflict Analysis for MINLP," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 421-435, May.
    11. David R. Morrison & Jason J. Sauppe & Sheldon H. Jacobson, 2013. "A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 2-12, February.
    12. Leonardo Lozano & Daniel Duque & Andrés L. Medaglia, 2016. "An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints," Transportation Science, INFORMS, vol. 50(1), pages 348-357, February.
    13. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    14. Juan Carlos Duque & Raúl Ramos & Jordi Suriñach, 2007. "Supervised Regionalization Methods: A Survey," International Regional Science Review, , vol. 30(3), pages 195-220, July.
    15. Timo Kuosmanen, 2004. "Efficient Diversification According to Stochastic Dominance Criteria," Management Science, INFORMS, vol. 50(10), pages 1390-1406, October.
    16. Harrod, Steven & Schlechte, Thomas, 2013. "A direct comparison of physical block occupancy versus timed block occupancy in train timetabling formulations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 50-66.
    17. Andrey Lizyayev, 2010. "Stochastic Dominance Efficiency Analysis of Diversified Portfolios: Classification, Comparison and Refinements," Tinbergen Institute Discussion Papers 10-084/2, Tinbergen Institute.
    18. A Corominas & R Pastor, 2011. "Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH)," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1704-1710, September.
    19. M Carey, 2009. "A framework for user equilibrium dynamic traffic assignment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(3), pages 395-410, March.
    20. Yang, Linfeng & Zhang, Chen & Jian, Jinbao & Meng, Ke & Xu, Yan & Dong, Zhaoyang, 2017. "A novel projected two-binary-variable formulation for unit commitment in power systems," Applied Energy, Elsevier, vol. 187(C), pages 732-745.

    Corrections

    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:coopap:v:52:y:2012:i:2:p:345-371. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.