IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v123y2000i3p652-659.html
   My bibliography  Save this article

An efficient linearization approach for mixed-integer problems

Author

Listed:
  • Chang, Ching-Ter

Abstract

No abstract is available for this item.

Suggested Citation

  • Chang, Ching-Ter, 2000. "An efficient linearization approach for mixed-integer problems," European Journal of Operational Research, Elsevier, vol. 123(3), pages 652-659, June.
    • Handle: RePEc:eee:ejores:v:123:y:2000:i:3:p:652-659
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00106-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Li, Han-Lin & Chang, Ching-Ter, 1998. "An approximate approach of global optimization for polynomial programming problems," European Journal of Operational Research, Elsevier, vol. 107(3), pages 625-632, June.
    2. Hanif D. Sherali & Warren P. Adams & Patrick J. Driscoll, 1998. "Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems," Operations Research, INFORMS, vol. 46(3), pages 396-405, June.
    3. Lokketangen, Arne & Glover, Fred, 1998. "Solving zero-one mixed integer programming problems using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 624-658, April.
    4. Fred Glover, 1975. "Improved Linear Integer Programming Formulations of Nonlinear Integer Problems," Management Science, INFORMS, vol. 22(4), pages 455-460, December.
    5. Ossama Kettani & Muhittin Oral, 1990. "Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization," Management Science, INFORMS, vol. 36(1), pages 115-119, January.
    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. Chang, Ching-Ter, 2002. "On the posynomial fractional programming problems," European Journal of Operational Research, Elsevier, vol. 143(1), pages 42-52, November.
    2. Chang, Ching-Ter, 2007. "Binary fuzzy goal programming," European Journal of Operational Research, Elsevier, vol. 180(1), pages 29-37, July.
    3. Liberatore, Federico & Scaparra, Maria P. & Daskin, Mark S., 2012. "Hedging against disruptions with ripple effects in location analysis," Omega, Elsevier, vol. 40(1), pages 21-30, January.
    4. Ching-Ter Chang, 2006. "Mixed binary interval goal programming," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 469-473, April.
    5. Chang, Ching-Ter, 2001. "On the polynomial mixed 0-1 fractional programming problems," European Journal of Operational Research, Elsevier, vol. 131(1), pages 224-227, May.
    6. Ching-Ter Chang & Huang-Mu Chen & Zheng-Yun Zhuang, 2014. "Integrated multi-choice goal programming and multi-segment goal programming for supplier selection considering imperfect-quality and price-quantity discounts in a multiple sourcing environment," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(5), pages 1101-1111, May.
    7. Sina Abbasi & Ilias Vlachos & Shabnam Rekabi & Mohammad Talooni, 2023. "Designing the Distribution Network of Essential Items in the Critical Conditions of Earthquakes and COVID-19 Simultaneously," Sustainability, MDPI, vol. 15(22), pages 1-23, November.
    8. Chang, Ching-Ter, 2006. "Formulating the mixed integer fractional posynomial programming," European Journal of Operational Research, Elsevier, vol. 173(2), pages 370-386, September.
    9. Chang, Ching-Ter, 2005. "A linearization approach for inventory models with variable lead time," International Journal of Production Economics, Elsevier, vol. 96(2), pages 263-272, May.
    10. Chang, Ching-Ter, 2007. "Multi-choice goal programming," Omega, Elsevier, vol. 35(4), pages 389-396, August.

    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. Liberatore, Federico & Scaparra, Maria P. & Daskin, Mark S., 2012. "Hedging against disruptions with ripple effects in location analysis," Omega, Elsevier, vol. 40(1), pages 21-30, January.
    2. R. Lougee-Heimer & W. Adams, 2005. "A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs," Annals of Operations Research, Springer, vol. 139(1), pages 289-320, October.
    3. Warren Adams & Hanif Sherali, 2005. "A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems," Annals of Operations Research, Springer, vol. 140(1), pages 21-47, November.
    4. Richard J. Forrester & Warren P. Adams & Paul T. Hadavas, 2010. "Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(1), pages 1-12, February.
    5. Yokoyama, Ryohei & Kitano, Hiroyuki & Wakui, Tetsuya, 2017. "Optimal operation of heat supply systems with piping network," Energy, Elsevier, vol. 137(C), pages 888-897.
    6. Christodoulos Floudas & Xiaoxia Lin, 2005. "Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications," Annals of Operations Research, Springer, vol. 139(1), pages 131-162, October.
    7. Gupta, Renu & Bandopadhyaya, Lakshmisree & Puri, M. C., 1996. "Ranking in quadratic integer programming problems," European Journal of Operational Research, Elsevier, vol. 95(1), pages 231-236, November.
    8. Osman, Hany & Demirli, Kudret, 2010. "A bilinear goal programming model and a modified Benders decomposition algorithm for supply chain reconfiguration and supplier selection," International Journal of Production Economics, Elsevier, vol. 124(1), pages 97-105, March.
    9. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2011. "A new class of functions for measuring solution integrality in the Feasibility Pump approach," DIS Technical Reports 2011-08, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    10. Verbiest, Floor & Cornelissens, Trijntje & Springael, Johan, 2019. "A matheuristic approach for the design of multiproduct batch plants with parallel production lines," European Journal of Operational Research, Elsevier, vol. 273(3), pages 933-947.
    11. Ali, Agha Iqbal & O'Connor, Debra J., 2010. "The impact of distribution system characteristics on computational tractability," European Journal of Operational Research, Elsevier, vol. 200(2), pages 323-333, January.
    12. Biswas, Debajyoti & Alfandari, Laurent, 2022. "Designing an optimal sequence of non‐pharmaceutical interventions for controlling COVID-19," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1372-1391.
    13. Ricardo M. Lima & Ignacio E. Grossmann, 2017. "On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study," Computational Optimization and Applications, Springer, vol. 66(1), pages 1-37, January.
    14. Jih-Jeng Huang, 2016. "Resource decision making for vertical and horizontal integration problems in an enterprise," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1363-1372, November.
    15. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.
    16. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
    17. Wakui, Tetsuya & Akai, Kazuki & Yokoyama, Ryohei, 2022. "Shrinking and receding horizon approaches for long-term operational planning of energy storage and supply systems," Energy, Elsevier, vol. 239(PD).
    18. Parreño, Francisco & Álvarez-Valdés, Ramón & Martí, Rafael, 2021. "Measuring diversity. A review and an empirical analysis," European Journal of Operational Research, Elsevier, vol. 289(2), pages 515-532.
    19. Martina Fischetti & Michele Monaci, 2016. "Proximity search heuristics for wind farm optimal layout," Journal of Heuristics, Springer, vol. 22(4), pages 459-474, August.
    20. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:123:y:2000:i:3:p:652-659. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.