Skip to main content
SpringerLink
Log in

An Exact Method for a Discrete Quadratic Fractional Maximum Problem

  • Conference paper
Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 14))

  • 1559 Accesses

Abstract

In this work, we develop a new algorithm for solving a discrete quadratic fractional maximum problem in which the objective is to optimize a ratio of two quadratic functions over a set of integer points contained in a convex polytope. This algorithm is based on a branch and bound method on computation of penalties and a related integer linear fractional programs.For this problem, optimality conditions are derived. A numerical example is presented for illustrating the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbas, M., Moulaï, M.: Penalties Method for Integer Linear Fractional Programs. Jorbel 37, 41–51 (1997)

    MathSciNet  MATH  Google Scholar 

  2. Abbas, M., Moulaï, M.: An algorithm for mixed integer linear fractional programming problem. Jorbel 39, 21–30 (1999)

    MathSciNet  MATH  Google Scholar 

  3. Abbas, M., Moulaï, M.: Integer Linear Fractional Programming with Multiple Objective. Ricerca Operativa, 103–104, 51–70 (2002)

    Google Scholar 

  4. Cambini, A., Martein, L.: Equivalence in Linear Fractional Programming. Optimization 23, 41–51 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Craven, B.D.: Fractional programming. Sigma Series in Applied Mathematics, vol. 4. Heldermann Verlag (1988)

    Google Scholar 

  6. Sniedovich., M.: Fractional programming revisited. EJOR 33, 334–341 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Stancu-Minasian, I.M.: A sixth bibliography of fractional programming. Optimization 55, 405–428 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAID3, Faculty of Mathematics, USTHB BP 32, Bab-Ezzouar, 16111, Algeria

    Nacéra Maachou

  2. Laboratoire LAID3, Département de Recherche Opérationnelle, USTHB BP. 32, EL ALIA, 16111, Alger, Algérie

    Mustapha Moulaï

Authors
  1. Nacéra Maachou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mustapha Moulaï
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science, UFR MIM,, Paul Verlaine University of Metz, Metz, France

    Hoai An Le Thi

  2. Faculty of Sciences, Technology and Communications, University of Luxembourg, Luxembourg

    Pascal Bouvry

  3. Laboratory of Mathematics, National Institute for Applied Sciences, Rouen Mont, Saint Aignan, France

    Tao Pham Dinh

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maachou, N., Moulaï, M. (2008). An Exact Method for a Discrete Quadratic Fractional Maximum Problem. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87477-5_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87476-8

  • Online ISBN: 978-3-540-87477-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation