Crude Integer Programming. Recently, the U.S. Government began to sell crude oil from its Naval Petroleum Reserve in sealed bid auctions. There are typically six commodities or products to be sold in the auction, corresponding to the crude oil at the six major production and shipping points. A "bid package" from a potential buyer consists of (a) a number indicating an upper limit on how many barrels (bbl.) the buyer is willing to buy overall in this auction and (b) any number of "product bids". Each product bid consists of a product name and three numbers representing, respectively, the bid price per barrel of this product, the minimum acceptable quantity of this product at this price, and the maximum acceptable quantity of this product at this price. Not all product bids of a buyer need be successful. The government usually places an arbitrary upper limit (e.g., 20%) on the percentage of the total number of barrels over all six products one firm is allowed to purchase.
To illustrate the principal ideas, let us simplify slightly and suppose there are only two supply sources/products which are denoted by A and B. There are 17,000 bbls. available at A while B has 13,000. Also, there are only two bidders, the Mobon and the Exxil companies. The government arbitrarily decides either one can purchase at most 65% of the total available crude. The two bid packages are as follows:
Mobon:
Maximum desired = 16,000 bbls. total.
Minimum Maximum
Bid per Barrels Barrels
Product Barrel Accepted Wanted
A 43 9000 16,000
B 51 6000 12,000
Exxil:
Maximum desired = No limit,
Minimum Maximum
Bid per Barrels Barrels
Product Barrel Accepted Wanted
A 47 5000 10,000
B 50 5000 10,000
Formulate and solve an appropriate IP for the seller.
希望大家花点时间帮忙解决一下,不能直接就用谷歌或有道翻译啊,那些都不通顺的额~~·~
都不通顺的啊,好像是直接用谷歌翻的吧,貌似不行喔
都不通顺的啊,好像是直接用谷歌翻的吧,貌似不行喔
这是你自己翻的么,感觉不错嘛,英语很好吧
本回答被提问者采纳好像都是用谷歌直接翻译的啊,都不顺喔
那就捡不晕的翻嘛