LINEAR PROGRAMMING-PHASE II -SOLUTION OF THE MULTIPLE DISCOUNT PROBLEM

THE REPORT PRESENTS A TECHNIQUE CAPABLE OF DETERMINING OPTIMAL SOLUTIONS TO MULTIPLE OFFERS OF QUANTITY DISCOUNTS FROM DIFFERENT DELIVERY POINTS. AN EXAMPLE OF THE TECHNIQUES APPLICATION IS INCLUDED IN THE REPORT. THE EXAMPLE COVERS GASOLINE SUPPLIERS BIDDING ON THE NEEDS OF ONE, TWO, OR ALL DISTRICTS WITHIN A STATE, WITH THE NUMBER OF LOCATIONS BID LEFT TO THE SUPPLIERS DISCRETION. WITH THIS CHOICE, EACH PROSPECTIVE SUPPLIER COULD OFFER ALTERNATIVE BIDS. BY DETERMINING THE COMBINATION OF BIDS REFLECTING THE GREATEST ECONOMIES OF DISTRIBUTION AND SCALE, AS OUTLINED IN THE REPORT, THE STATE MAY OBTAIN THE LOWEST COST GASOLINE. /BPR/

  • Supplemental Notes:
    • Hpr, 0513
  • Corporate Authors:

    Virginia Highway Research Council

    Charlottesville, VA  United States 
  • Authors:
    • Doom, I F
  • Publication Date: 1966-6

Subject/Index Terms

Filing Info

  • Accession Number: 00200913
  • Record Type: Publication
  • Source Agency: Bureau of Public Roads /US
  • Files: TRIS
  • Created Date: Oct 1 1994 12:00AM