Contract award analysis by mathematical programming

Aharon Gavriel Beged‐Dov

Naval Research Logistics Quarterly, 1970, vol. 17, issue 3, 297-307

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.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800170306

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:17:y:1970:i:3:p:297-307

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().