IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v28y1982i7p829-836.html
   My bibliography  Save this article

Note---Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems

Author

Listed:
  • Frieda Granot

    (University of British Columbia)

Abstract

We develop in this paper two types of heuristic methods for solving the positive 0-1 polynomial programming (PP) problem of finding a 0-1 vector x that maximizes c T x subject to f(x) \le b where c, b \ge 0 and f is an m-vector of polynomials with non-negative coefficients. The various heuristics were first tested on randomly generated sparse problems of up to 50 variables and 50 constraints, and their performance in terms of computational time and effectiveness was investigated. The results were very encouraging. Optimal solutions were consistently obtained by some of the heuristic methods in over 50% of the problems solved. The effectiveness was on the average better than 99% and no less than 96.5%. The computational time using these heuristics is on the average 5% of the time required to solve the PP problems to optimality. Some results for very sparse problems with up to 1,000 variables and 200 constraints are also reported.

Suggested Citation

  • Frieda Granot, 1982. "Note---Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems," Management Science, INFORMS, vol. 28(7), pages 829-836, July.
    • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:7:p:829-836
    DOI: 10.1287/mnsc.28.7.829
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.28.7.829
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.28.7.829?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
    ---><---

    More about this item

    Keywords

    programming: integer algorithms; heuristic;

    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:inm:ormnsc:v:28:y:1982:i:7:p:829-836. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.

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