Advanced Search
MyIDEAS: Login

Covering Relaxation for Positive 0-1 Polynomial Programs

Contents:

Author Info

  • Daniel Granot

    (University of British Columbia)

  • Frieda Granot

    (University of British Columbia)

  • Jerry Kallberg

    (New York University)

Registered author(s):

    Abstract

    Granot and Hammer (Granot, F., P. L. Hammer. 1971. On the use of boolean functions in 0-1 programming. Operations Research, Statistics and Economic Mimeograph Series No. 70, Technion (August 1970). (Published in Methods of Oper. Res. 12 154-184); Granot, F., P. L. Hammer. 1975. On the role of generalized covering problems. Cahiers du Centre D'Etudes de Recherche Operationelle 17 277-289.) have shown constructively that the set of 0-1 vectors x satisfying a polynomial constraint with non negative coefficients remains unchanged if the polynomial constraint is replaced by an appropriate finite collection of linear inequalities in x. When rewritten in the complementary vector x\bar = 1 - x, the linear inequalities are those of a linear covering problem. This reduction is used here to give a cutting-plane algorithm for solving the positive 0-1 polynomial program of finding a 0-1 vector that maximizes a nondecreasing linear function subject to the restrictions that several polynomials do not exceed given numbers. The algorithm consists of solving (by implicit enumeration) a nested sequence of linear covering problems, each of which is a relaxation of the original positive 0-1 polynomial program. Each covering problem is found by adding to its predecessor a small number (one suffices, but more speed convergence) of covering constraints that are violated by the optimal solution found for the preceding covering problem. Over 200 randomly generated problems with up to 50 variables and 50 constraints were solved using our covering relaxation algorithm. The CPU time was often less than one second and has exceeded one minute only for three problems. The number of iterations, i.e., the number of linear covering problems solved, ranged between 1 and 6, while the number of covers in the largest covering problem solved usually did not exceed the number of constraints in the original problem.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://dx.doi.org/10.1287/mnsc.25.3.264
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 25 (1979)
    Issue (Month): 3 (March)
    Pages: 264-273

    as in new window
    Handle: RePEc:inm:ormnsc:v:25:y:1979:i:3:p:264-273

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords: programming: integer algorithms; cutting planes; programming: nonlinear; algorithms; cutting planes;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:25:y:1979:i:3:p:264-273. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.