摘要
对2005年全国大学生数学建模B题，在满足会员需求、兼顾利润的原则下进行了建模。对问题1）利用参数法，建立了以最少购买量为目标的概率模型；对问题2）引入了0-1变量，建立了以会员总满意度为目标的0．1线性规划模型；对问题3）建立了以会员的总满意度和网站的总利润的双目标规划，并将其转化为单目标规划。最后通过Lingo编程求解，取得了满意的结果；并进行了结果分析，验证了模型的可行性及高效性。
In this paper, we will first introduce the problem B of CUMCM in 2005.Then, by considering the satisfaction of member＇s needs and taking the outlays into account, we make it into modeling.For problem one, a probability model is presented. This model is based on the objects of the minimum purchase by parameter methods.For problem two,0-1 linear programming model is established,it is based on the objects of total members＇ satisfaction by 0-1 variables.For problem three, a double objects programming model is founded ,the model is based on the objects of total members＇ satisfaction and total outlays of network companies, and translates it into the singles object programming. Finally, all of the models are seek for answers by Lingo programming,and get satisfied results.The results prove that the model has feasibility and highly efficiency.
