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

Formulating the mixed integer fractional posynomial programming

Author

Listed:
  • Chang, Ching-Ter

Abstract

No abstract is available for this item.

Suggested Citation

  • Chang, Ching-Ter, 2006. "Formulating the mixed integer fractional posynomial programming," European Journal of Operational Research, Elsevier, vol. 173(2), pages 370-386, September.
    • Handle: RePEc:eee:ejores:v:173:y:2006:i:2:p:370-386
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00195-5
    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. 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.
    2. Hartmut Wolf, 1985. "A Parametric Method for Solving the Linear Fractional Programming Problem," Operations Research, INFORMS, vol. 33(4), pages 835-841, August.
    3. Wu, Tai-Hsi, 1997. "A note on a global approach for general 0-1 fractional programming," European Journal of Operational Research, Elsevier, vol. 101(1), pages 220-223, August.
    4. Li, Han-Lin, 1994. "A global approach for general 0-1 fractional programming," European Journal of Operational Research, Elsevier, vol. 73(3), pages 590-596, March.
    5. 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.
    6. Chadha, S. S., 2002. "Fractional programming with absolute-value functions," European Journal of Operational Research, Elsevier, vol. 141(1), pages 233-238, August.
    7. Chang, Ching-Ter, 2002. "On the posynomial fractional programming problems," European Journal of Operational Research, Elsevier, vol. 143(1), pages 42-52, November.
    8. Martin Gugat, 1996. "A Fast Algorithm for a Class of Generalized Fractional Programs," Management Science, INFORMS, vol. 42(10), pages 1493-1499, October.
    Full references (including those not matched with items on IDEAS)

    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. 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, 2001. "On the polynomial mixed 0-1 fractional programming problems," European Journal of Operational Research, Elsevier, vol. 131(1), pages 224-227, May.
    3. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
    4. Billionnet, Alain, 2004. "Mixed integer programming for the 0-1 maximum probability model," European Journal of Operational Research, Elsevier, vol. 156(1), pages 83-91, July.
    5. Jose Joaquin del Pozo-Antúnez & Francisco Fernández-Navarro & Horacio Molina-Sánchez & Antonio Ariza-Montes & Mariano Carbonero-Ruz, 2021. "The Machine-Part Cell Formation Problem with Non-Binary Values: A MILP Model and a Case of Study in the Accounting Profession," Mathematics, MDPI, vol. 9(15), pages 1-16, July.
    6. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
    7. Tunjo Perić & Josip Matejaš & Zoran Babić, 2023. "Advantages, sensitivity and application efficiency of the new iterative method to solve multi-objective linear fractional programming problem," 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. 31(3), pages 751-767, September.
    8. Tien Mai & Arunesh Sinha, 2022. "Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach," Papers 2204.11451, arXiv.org.
    9. Georg Bechler & Claudius Steinhardt & Jochen Mackert, 2021. "On the Linear Integration of Attraction Choice Models in Business Optimization Problems," SN Operations Research Forum, Springer, vol. 2(1), pages 1-13, March.
    10. Tsai, Jung-Fa, 2007. "An optimization approach for supply chain management models with quantity discount policy," European Journal of Operational Research, Elsevier, vol. 177(2), pages 982-994, March.
    11. Viviane Köhler & Marcia Fampa & Olinto Araújo, 2013. "Mixed-Integer Linear Programming Formulations for the Software Clustering Problem," Computational Optimization and Applications, Springer, vol. 55(1), pages 113-135, May.
    12. Alexandre Belloni & Mitchell J. Lovett & William Boulding & Richard Staelin, 2012. "Optimal Admission and Scholarship Decisions: Choosing Customized Marketing Offers to Attract a Desirable Mix of Customers," Marketing Science, INFORMS, vol. 31(4), pages 621-636, July.
    13. Frenk, J.B.G. & Schaible, S., 2004. "Fractional Programming," ERIM Report Series Research in Management ERS-2004-074-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    14. König, Eva & Schön, Cornelia, 2021. "Railway delay management with passenger rerouting considering train capacity constraints," European Journal of Operational Research, Elsevier, vol. 288(2), pages 450-465.
    15. Troutt, Marvin D. & Tadisina, Suresh K. & Sohn, Changsoo & Brandyberry, Alan A., 2005. "Linear programming system identification," European Journal of Operational Research, Elsevier, vol. 161(3), pages 663-672, March.
    16. Veremyev, Alexander & Boginski, Vladimir, 2012. "Identifying large robust network clusters via new compact formulations of maximum k-club problems," European Journal of Operational Research, Elsevier, vol. 218(2), pages 316-326.
    17. Rezapour, Shabnam & Allen, Janet K. & Mistree, Farrokh, 2015. "Uncertainty propagation in a supply chain or supply network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 185-206.
    18. Mavrotas, G. & Diakoulaki, D. & Caloghirou, Y., 2006. "Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming," European Journal of Operational Research, Elsevier, vol. 171(1), pages 296-308, May.
    19. Bechler, Georg & Steinhardt, Claudius & Mackert, Jochen & Klein, Robert, 2021. "Product line optimization in the presence of preferences for compromise alternatives," European Journal of Operational Research, Elsevier, vol. 288(3), pages 902-917.
    20. 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.

    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:173:y:2006:i:2:p:370-386. 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.