shadow price in linear programming 对shadow price 一个较好的解释

转载 2013年12月03日 21:57:52

I am quite confuse with the explaination of Shadow Price found from Internet.

It can be understood as: the value of an addition revenue if the constraint is relaxed.


How much you would be willing to pay for an additional resource.

The problem:

maximize 5x1 + 4x2 + 6x3
subject to 6x1 + 5x2 + 8x3 <= 16   (c1)
10x1 + 20x2 + 10x3 <= 35           (c2)
0 <= x1, x2, x3 <= 1

Solving this problem, we get the shadow price of c1 = 0.727273, c2 = 0.018182.

Comparing c1 and c2, if 1 constraint can be relaxed, we should relax c1 instead of c2?


shareimprove this question
  add comment

Here's perhaps a better way to think of the shadow price. (I don't like the word "relax" here; I think it's confusing.)

For maximization problems like this one the constraints can often be thought of as restrictions on the amount of resources available, and the objective can be thought of as profit. Then the shadow price associated with a particular constraint tells you how much the optimal value of the objective would increase per unit increase in the amount of resources available. In other words, the shadow price associated with a resource tells you how much more profit you would get by increasing the amount of that resource by one unit. (So "How much you would be willing to pay for an additional resource" is a good way of thinking about the shadow price.)

In the example you give, there are 16 units available of the first resource and 35 units available of the second resource. The fact that the shadow price of c1 is 0.727273 means that if you could increase the first resource from 16 units to 17 units, you would get an additional profit of about$0.73. Similarly, if you could increase the second resource from 35 units to 36 units then you would get an additional profit of about $0.02.

So if you could increase just one resource by one unit, and the cost of increasing the first resource is the same as that of increasing the second resource (this assumption is not part of the model), then, yes, you should definitely increase the first resource by one unit.

求解优化问题,利用拉格朗日松弛法时,拉格朗日乘子就相当于shadow price 的意思,当增加约束一个单位,objective will get more profit,so it can be used to change some variable to make the problem converge

shadow price in linear programming 对shadow price 一个较好的解释

shadow price in linear programming up vote4down votefavorite 2 ...
  • mucai1
  • mucai1
  • 2013年12月03日 21:57
  • 913


Aaccounting 会计accounting cost 会计成本 accounting profit 会计利润 adverse selection 逆向选择 allocation 配置 alloc...
  • steven_chr
  • steven_chr
  • 2006年09月03日 09:03
  • 7000

【.NET基础】——ShadowCopy And DeepCopy

在介绍.NET平台下的ShadowCopy And DeepCopy之前,我们先来了解两个概念——值类型 and 引用类型。 值类型 and 引用类型 ...
  • u013035538
  • u013035538
  • 2015年01月17日 21:04
  • 1352


临时计算器交互模式中,最近一个表达式的值赋给变量 _。这样我们就可以把它当作一个桌面计算器,很方便的用于连续计算,例如:>>> tax = 12.5 / 100 >>> price = 100.50 ...
  • hfdwdjl
  • hfdwdjl
  • 2015年06月24日 10:39
  • 415

Bid Price Definition of 'Bid Price' The pri...
  • caolaosanahnu
  • caolaosanahnu
  • 2012年02月14日 11:28
  • 455

10.OP-TEE OS启动(一)

如果个系统有ATF(ARM Trusted Frimware)(ARF的部分,请参考ATF的相关文档),OP-TEE OS属于bl32阶段被启动,通过在bl31阶段调用opteed_enter_sp函...
  • shuaifengyun
  • shuaifengyun
  • 2017年05月23日 11:33
  • 2569


文章来源 Linux操作系统下有一个文件负...
  • u013184094
  • u013184094
  • 2016年01月06日 11:34
  • 2664

final static Price INSTANCE = new Price(2.8);

class Price { //类成员是Price实例 final static Price INSTANCE = new Price(2.8); //在定义一个类变量。 static dou...
  • autumn20080101
  • autumn20080101
  • 2012年12月07日 09:22
  • 461


  • oraclebs
  • oraclebs
  • 2010年01月06日 12:15
  • 3675


1、市场经济是组织生产活动的一种工具——一种有价值且高效的工具。市场社会是一种生活方式,其间,市场价值观渗透到了人类活动的各个方面。市场社会是一个社会关系按照市场规律加以改变的社会 在任何给定的情形...
  • gyley2
  • gyley2
  • 2014年04月14日 16:06
  • 1177
您举报文章:shadow price in linear programming 对shadow price 一个较好的解释