IDEAS home Printed from https://ideas.repec.org/p/nbr/nberwo/0159.html
   My bibliography  Save this paper

A Conic Algorithm for the Group Minimization Problem

Author

Listed:
  • Bruno Simeone

Abstract

A new algorithm for the group minimization problem (GP) is proposed. The algorithm can be broadly described as follows. A suitable relaxation of(GP) is defined, in which any feasible point satisfies the group equation but may have negative components. The feasible points of the relaxation are then generated in order of ascending costs by a variant of a well-known algorithm of Glover, and checked for non-negativity. The first non-negative point is an optimal solution of (GP). Advantages and disadvantages of the algorithm are discussed; in particular, the implementation of the algorithm (which can be easily extended so as to solve integer linear programming problems) does not require group arithmetics.

Suggested Citation

  • Bruno Simeone, 1976. "A Conic Algorithm for the Group Minimization Problem," NBER Working Papers 0159, National Bureau of Economic Research, Inc.
    • Handle: RePEc:nbr:nberwo:0159
    as

    Download full text from publisher

    File URL: http://www.nber.org/papers/w0159.pdf
    Download Restriction: no
    ---><---

    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:nbr:nberwo:0159. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/nberrus.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.