IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v17y1970i3p297-307.html
   My bibliography  Save this article

Contract award analysis by mathematical programming

Author

Listed:
  • Aharon Gavriel Beged‐Dov

Abstract

ABSTRACT A large manufacturer of telephone directories purchases about 100,000 tons of paper annually from several paper mills on the basis of competitive bids. The awards are subject to several constraints. The principal company constraint is that the paper must be purchased from at least three different suppliers. The principal external constraints are: 1) one large paper mill requires that if contracted to sell the company more than 50,000 tons of paper, it must be enabled to schedule production over the entire year; 2) the price of some bidders is based on the condition that their award must exceed a stipulated figure. The paper shows that an optimal purchasing program corresponds to the solution of a model which, but for a few constraints, is a linear programming formulation with special structure. The complete model is solved by first transforming it into an almost transportation type problem and then applying several well‐known L.P. techniques.

Suggested Citation

  • Aharon Gavriel Beged‐Dov, 1970. "Contract award analysis by mathematical programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 17(3), pages 297-307, September.
    • Handle: RePEc:wly:navlog:v:17:y:1970:i:3:p:297-307
    DOI: 10.1002/nav.3800170306
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800170306
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800170306?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

    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:wly:navlog:v:17:y:1970:i:3:p:297-307. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.