Lingo 做线性规划 - Game Thoery

Reference: <An Introduction to Management Science Quantitative Approaches to Decision Making, Revised 13th Edition>

Instance

Suppose that two companies are the only manufacturers of a particular product; they compete against each other for market share. In planning a marketing strategy for the coming year, each company will select one of three strategies designed to take market share from the other company. The three strategies, which are assumed to be the same for both companies, are as follows:

Strategy 1: Increase advertising.

Strategy 2: Provide quantity discounts.

Strategy 3: Extend warranty.

A payoff table showing the percentage gain in the market share for Company A for each combination of strategies is shown in Table 5.5.

Doing so, Company A identifies the minimum payoff for each of its strategies, which is the minimum value in each row of the payoff table. These row minimums are shown in Table 5.6.

After comparing the row minimum values, Company A selects the strategy that provides the maximum of the row minimum values. This is called a maximin strategy. Thus, Company A selects strategy a1 as its optimal strategy; an increase in market share of at least 2% is guaranteed.

Considering the entries in the Column Maximum row, Company B can be guaranteed a decrease in market share of no more than 2% by selecting the strategy b3. This is called a minimax strategy. Thus, Company B selects b3 as its optimal strategy. Company B has guaranteed that Company A cannot gain more than 2% in market share.

Let us continue with the two-company market-share game and consider a slight modification in the payoff table as shown in Table 5.8. Only one payoff has changed.

Because these values are not equal, a pure strategy solution does not exist. In this case, it is not optimal for each company to be predictable and select a pure strategy regardless of what the other company does. The optimal solution is for both players to adopt a mixed strategy.

With a mixed strategy, each player selects its strategy according to a probability distribution.Weighting each payoff by its probability and summing provides the expected value of the increase in market share for Company A.

Company A will select one of its three strategies based on the following probabilities:
PA1 = the probability that Company A selects strategy a1
PA2 =  the probability that Company A selects strategy a2
PA3 = the probability that Company A selects strategy a3

Given the probabilities PA1, PA2, and PA3 and the expected gain expressions in Table 5.9, game theory assumes that Company B will select a strategy that provides the minimum expected gain for Company A. Thus, Company B will select b1, b2, or b3 based on
Min {EG(b1), EG(b2), EG(b3)}
When Company B selects its strategy, the value of the game will be the minimum expected gain. This strategy will minimize Company A’s expected gain in market share. Company A will select its optimal mixed strategy using a maximin strategy, which will maximize the minimum expected gain. This objective is written as follows:

Define GAINA to be the optimal expected gain in market share for Company A.

Now consider the game from the point of view of Company B. Company B will select one of its strategies based on the following probabilities:
PB1 = the probability that Company B selects strategy b1
PB2 = the probability that Company B selects strategy b2
PB3 = the probability that Company B selects strategy b3

The expression for the expected loss in market share for Company B for each Company A strategy is provided in Table 5.10.

Company A will select a1, a2, or a3 based on
Max {EL(a1), EL(a2), EL(a3)}
When Company A selects its strategy, the value of the game will be the expected loss, which will maximize Company B’s expected loss in market share. Company B will select its optimal mixed strategy using a minimax strategy to minimize the maximum expected loss. This objective is written as follows:

Define LOSSB to be the optimal expected loss in market share for Company B.

时间: 2024-10-14 04:44:52

Lingo 做线性规划 - Game Thoery的相关文章

Lingo 做线性规划 - Revenue Management

Reference: <An Introduction to Management Science Quantitative Approaches to Decision Making, Revised 13th Edition> Leisure Air has two Boeing 737-400 airplanes, one based in Pittsburgh and the other in Newark. Both airplanes have a coach section wi

Lingo 做线性规划

Reference: <An Introduction to Management Science Quantitative Approaches to Decision Making, Revised 13th Edition> Market Application 1: Relax-and-Enjoy provided BP&J with an advertising budget of $30,000 for the first month’s campaign. In addi

用LINGO求解线性规划的例子

附1:用LINGO求解线性规划的例子   一奶制品加工厂用牛奶生产A1.A2两种奶制品,1桶牛奶可以在设备甲上用12小时加工成3公斤A1,或者在设备乙上用8小时加工成4公斤A2.根据市场需求,生产的A1.A2能全部售出,且每公斤A1获利24元,每公斤A2获利16元.现在加工厂每天能得到50桶牛奶的供应,每天正式工人总的劳动时间为480小时,并且设备甲每天至多能加工100公斤A1,设备乙的加工能力没有限制.试为该厂制定一个生产计划,使每天获利最大,并进一步讨论以下3个附加问题: 1)若用35元可以

Lingo求解线性规划问题

lingo是一个方便进行求解规划问题的软件,可以很快求出,写好代码后按照下图点击即可. 大致以下几种情况: !变量下界为0的简单线性规划; model: max=4*x1+3*x2; 5*x1+x2>10; x1+x2<8; x2<6; end !下界可以是任何值得简单线性规划; model: max=4*x1+3*x2; 5*x1+x2<14; x1+x2<18; x2<6; @free(x1);@free(x2); end !整数线性规划; model: max=4

Lingo求解线性规划案例4——下料问题

凯鲁嘎吉 - 博客园 http://www.cnblogs.com/kailugaji/ 造纸厂接到定单,所需卷纸的宽度和长度如表 卷纸的宽度 长度 5 7 9 10000 30000 20000 工厂生产1号(宽度10)和2号(宽度20)两种标准卷纸,其长度未加规定.现按定单要求对标准卷纸进行切割,切割后有限长度的卷纸可连接起来达到所需卷纸的长度.问如何安排切割计划以满足定单需求而使切割损失最小? 解:为了满足定单要求和使切割损失最小,我们可以使用多种切割方法来进行组合.此时,我们不但要考虑对

用Lingo求解线性规划问题

第一步:输入目标条件和约束条件.每行以分号隔开.然后点击工具栏上的Solve按钮,或Lingo菜单下的Solve子菜单. 第二步:检查report中的结果. 默认情况下,Lingo不进行灵敏度分析. 需要在Lingo中一下配置才可以生成灵敏度分析报告:Lingo菜单>Options. General Solver选项卡>Dual Computations:Prices and Ranges. 然后点击Apply按钮. 重新点击Solve菜单和Range菜单以生成如下灵敏度分析报告(Range

VS2013调用GLPK求解线性规划

最近做线性规划问题,要用到GLPK工具,VS2013环境下鼓捣了好久终于成功.下面一步步来展示一下环境的配置. 1.下载GLPK4.45版本 http://glpk-for-windows.soft112.com/ 然后解压. 2.用VS2013新建一个项目,命名为GLPK_TEST,源文件里建一个cpp文件命名为TESTGLPK.cpp 3.右键选择这个工程的属性,选择常规,看到右边的"附加包含目录",点击它,选择GLPK下的include文件夹路径,然后确定. 4.再找到属性下&q

列举几个python解决数学建模的例子

一.线性规划问题的求最大最小值问题 # max: z = 4x1 + 3x2 # st: -2x1 - 3x2<=-10 # x1 + x2 <=8 # x2 <= 7 # x1,x2 > 0 from scipy.optimize import linprog c = [4,3] #默认linprog求解的是最小值,若求最大值,此处c取反即可得到最大值的相反数. A = [[-2,-3],[1,1]] b = [-10,8] x1_bounds = [0,None] x2_bou

java 线性规划 和lingo 比较

model:max=13*A+ 23*B; 5*A + 15*B <480 ; 4*A + 4 *B <160 ; 35* A + 20 *B <1190 ; end Variable Value Reduced Cost A 12.00000 0.000000 B 28.00000 0.000000 Row Slack or Surplus Dual Price 1 800.0000 1.000000 2 0.000000 1.000000 3 0.000000 2.000000 4