原创力文档- 1、本文档共25页，可阅读全部内容。
- 2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
- 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
查看更多
Lecture18Lecture18
Lecture 18 Integer Programming
12.8 If the LP relaxation is infeasible, then the ILP is infeasible.
12.10 If the optimal solution to the LP is integer, then this is the optimal solution to the ILP also.
Problem P:
max cx
s.t. Ax = b
0 x u
xj integer for all j
Problem LP:
max cx
s.t. Ax = b
0 x u
Let x1 be feasible for P.
Then cx1 is a lower bound for problem P.
Let x2 be an optimum for LP.
Then cx2 is an upper bound for P.
gap = (120-100)/120 = 16.7%
When constructing an LP model, we usually try to use the smallest number of constraints and variables.
-----------------------------------------------
When constructing an ILP model, we usually try to make the optimal objective value of the LP relaxation as small as possible. This may involve using more constraints than is absolutely necessary.
Consider a problem with constraints of the form:
select x or y, select x or z, select y or z
max x+y+z
s.t. x + y 1
x + z 1
y + z 1
x, y, z binary
LP relaxation yields (1/2, 1/2, 1/2) with objective value of 3/2.
--------------------------------------------
max x+y+z
s.t. x + y 1
x + z 1
y + z 1
x + y + z 1
x, y, z binary
LP relaxation yields (1,0,0) with objective value of 1 (a better relaxation). We used a redundant constraint to obtain an improved relaxation. The gap between the LP and ILP is smaller.
Im working on a telecom design problem where customers for wireless phone service are assigned to towers and channels are assigned to customer-tower combinations.
Assumptions
1. Customers can be assigned to either tower
2. tower #1 capacity = 800 customers, cost = $300,000
3. tower #2 capacity = 750 customers, cost = $288,888
4. revenue per customer each year = $750
-----------------------------------------------
Determine which tower(s) to build and which customers to assign to the towers.
Run # 1
printfModel1\n\n;
var C1T1 = 0;
var C1T2 = 0;
var C2T1 = 0;
var C2T2 = 0
文档评论（0）