摘  要

本文主要通過對最優(yōu)網(wǎng)購問題中所提供的甲、乙、 丙 和丁四人網(wǎng)購總訂單以及三個購物網(wǎng)站A、B和C相關(guān)的庫存量、商品定價和優(yōu)惠活動等方面進(jìn)行探討研究,將問題定位為消費者網(wǎng)購時應(yīng)付的總費用最小化問題進(jìn)行建模,按照題目要求分兩問進(jìn)行解答.

問題一：本文根據(jù)甲、乙、丙和丁的網(wǎng)購總訂單分析發(fā)現(xiàn)有四人網(wǎng)購時購買了同一編號商品的情況，所以需要考慮庫存量與需求量的關(guān)系.因此運用最優(yōu)規(guī)劃理論建立了同時適用于四人的最優(yōu)網(wǎng)購方案的模型,運用Lingo軟件編程求解可得出四人采購應(yīng)付的總費用分別為659.81元、843.62元、783.85元和961.18元. 購物具體方案整理后如附錄中表1、表2、表3和表4所示.

針對問題一,本文就實際生活中可能出現(xiàn)的多人購買同一商品的情況,在模型1的基礎(chǔ)上進(jìn)一步研究,同樣采用最優(yōu)規(guī)劃理論建立適用于多人購買同一商品的綜合模型2. 模型2相當(dāng)于委托其中一人購買所有的商品,然后幾個人按自己購物數(shù)量占的比例分擔(dān)郵費,從而減少應(yīng)付費用得到最優(yōu)化方案. 經(jīng)Lingo軟件編程求解可以得出總體最優(yōu)方案. 具體方案如附錄中表5所示. 模型2與模型1相比更省錢,不過前提條件是網(wǎng)購者相互認(rèn)識且委托其中一人將所有物品全部購買.

 問題二：本文根據(jù)相關(guān)調(diào)查和研究發(fā)現(xiàn)每個網(wǎng)站都有自己的促銷方式. 有的商場使用打折的方式進(jìn)行促銷,有的網(wǎng)站會推出雙重或多重促銷方式,在打折的同時又推出商品貨額達(dá)到一定數(shù)額免運費等優(yōu)惠. 因此本文考慮在問題一打折的基礎(chǔ)上,再添加最新優(yōu)惠活動因素. 在模型1的基礎(chǔ)上添加最新優(yōu)惠活動得到模型3,運用Lingo軟件編程求解可知甲、乙、丙和丁的網(wǎng)購應(yīng)付費用總額分別為654.81元、828.62元、778.85元和951.18元. 具體購物方案如表6、表7、表8和表9所示.

關(guān)鍵詞：網(wǎng)絡(luò)購物；優(yōu)化理論；最優(yōu)購物方案；0-1變量

 ABSTRACT

This article mainly through to the best online questions provided in the A B C d four total orders online and A, B and C three shopping website of relevant inventory goods pricing further study favourable activity, etc, positioning problem when shopping for consumer to cope with the total cost minimization problem of modeling.

Question one: according to a Yi Bing Ding online when there are four people in total order analysis found that online shopping is to buy the same number of goods, so need to think about inventory and demand relationship. So by using the optimal planning theory is suitable for four people at the same time the optimal online scheme model, using the Lingo software programming to solve can be concluded that four people purchasing to deal with the total cost of 659.81 yuan, 843.62 yuan, 783.85 yuan and 961.18 yuan. The plans after finishing shopping such as table 1, table 2 and table 3 and table 4.

About question one, the real people at the same time in your life are likely to buy the same goods and consumers know, or many people in the same shop to buy goods. And online shopping if a bought many people to buy the same goods, the postage is calculate according to individual orders. That is to entrust one person to buy all the goods, the last few people according to their shopping accounted for the proportion of share the postage, so as to reduce costs, and optimization solution is obtained. According to the situation on the basis of model 1 further study, the optimal planning theory is adopted to establish the same applies to people buy the same goods, a comprehensive model 2 by Lingo software programming method can obtain the overall optimal solution. The specific scheme as shown in table 5.

Question two: in this paper, according to the investigation and study found that each website has its own way of sales promotion. Some stores use a discount promotion in the form of double or multiple promotions, some website will launch on sale at the same time introduce commodity goods amount reaches a certain amount of free shipping offers. So this article consider the question, on the basis of a discount, to add the latest preferential activities. On the basis of model 1 to add the latest preferential activities for model 3, using the Lingo software programming solution shows a Yi Bing Ding online deal with total costs were 654.81 yuan, 828.62 yuan, 778.85 yuan and 951.18 yuan. Concrete shopping plan in table 6 as shown in table 7 table 8 and table 9.

Key words: online shopping; Optimization theory; The optimal shopping plan; 0-1variable

目  錄

目  錄 1

1.問題重述 1

2.問題分析 1

2.1問題1的分析 1

2.2 問題2的分析 2

3.模型假設(shè) 2

4.定義與符號說明 3

5.模型的建立與求解 3

5.1模型1的建立與求解 3

5.2模型2的建立與求解 5

5.3模型3的建立與求解 6

6.模型評價與推廣 7

6.1模型的評價 7

6.2模型的推廣 7

附  錄 9

參 考 文 獻(xiàn) 17

致  謝 18