IDEAS home Printed from https://ideas.repec.org/p/cwl/cwldpp/453.html
   My bibliography  Save this paper

An Observation on the Structure of Production Sets with Indivisibilities

Author

Abstract

A subset of the constraints of an integer programming problem is said to be binding if, when the remaining constraints are eliminated, the smaller problem has the same optimal solution as the original problem. It is shown that an integer programming problem with n variables has a set of binding constraints of cardinality less than or equal to 2n−1. The bound is sharp.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Herbert E. Scarf, 1977. "An Observation on the Structure of Production Sets with Indivisibilities," Cowles Foundation Discussion Papers 453, Cowles Foundation for Research in Economics, Yale University.
    • Handle: RePEc:cwl:cwldpp:453
    Note: CFP 454.
    as

    Download full text from publisher

    File URL: https://cowles.yale.edu/sites/default/files/files/pub/d04/d0453.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. I. Bárány & H. E. Scarf & D. Shallcross, 2008. "The topological structure of maximal lattice free convex bodies: The general case," Palgrave Macmillan Books, in: Zaifu Yang (ed.), Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research, chapter 11, pages 191-205, Palgrave Macmillan.
    2. Queyranne, M. & Tardella, F., 2015. "Carathéodory, Helly and Radon Numbers for Sublattice Convexities," LIDAM Discussion Papers CORE 2015010, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Walter Briec & Kristiaan Kerstens & Ignace Van de Woestyne, 2022. "Nonconvexity in Production and Cost Functions: An Exploratory and Selective Review," Springer Books, in: Subhash C. Ray & Robert G. Chambers & Subal C. Kumbhakar (ed.), Handbook of Production Economics, chapter 18, pages 721-754, Springer.
    4. Herbert E. Scarf, 2008. "Integral Polyhedra in Three Space," Palgrave Macmillan Books, in: Zaifu Yang (ed.), Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research, chapter 4, pages 69-104, Palgrave Macmillan.
    5. Wiesława Obuchowska, 2010. "Minimal infeasible constraint sets in convex integer programs," Journal of Global Optimization, Springer, vol. 46(3), pages 423-433, March.
    6. Friedrich Eisenbrand & Gennady Shmonin, 2008. "Parametric Integer Programming in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 839-850, November.
    7. Valentin Borozan & Gérard Cornuéjols, 2009. "Minimal Valid Inequalities for Integer Constraints," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 538-546, August.
    8. Maurice Queyranne & Fabio Tardella, 2017. "Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 495-516, May.
    9. Obuchowska, Wiesława T., 2012. "Feasibility in reverse convex mixed-integer programming," European Journal of Operational Research, Elsevier, vol. 218(1), pages 58-67.

    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:cwl:cwldpp:453. 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: Brittany Ladd (email available below). General contact details of provider: https://edirc.repec.org/data/cowleus.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.