利用拉格朗日松弛法研究了MIP期权值的界

2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC) Pub Date : 2011-09-06 DOI:10.1109/AIMSEC.2011.6009912

F. Zhou

{"title":"利用拉格朗日松弛法研究了MIP期权值的界","authors":"F. Zhou","doi":"10.1109/AIMSEC.2011.6009912","DOIUrl":null,"url":null,"abstract":"according to study the a Maximal Lifetime with Constrained Energy problem (MLCE)in a sensors net, we discuss the bound of the option value of mix integer program (MIP). Since the Maximun of the MIP is NP complete problem, so the exact solution can not be obtained, but the bound of the option value is exist. This paper use Lagrangian relaxation method to derive theoretical upper bound on the optimal value of the MIP problem.","PeriodicalId":214011,"journal":{"name":"2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC)","volume":"186 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research the bound of the option value of MIP by Lagrangian relaxation\",\"authors\":\"F. Zhou\",\"doi\":\"10.1109/AIMSEC.2011.6009912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"according to study the a Maximal Lifetime with Constrained Energy problem (MLCE)in a sensors net, we discuss the bound of the option value of mix integer program (MIP). Since the Maximun of the MIP is NP complete problem, so the exact solution can not be obtained, but the bound of the option value is exist. This paper use Lagrangian relaxation method to derive theoretical upper bound on the optimal value of the MIP problem.\",\"PeriodicalId\":214011,\"journal\":{\"name\":\"2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC)\",\"volume\":\"186 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AIMSEC.2011.6009912\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIMSEC.2011.6009912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

通过对传感器网络中具有约束能量的最大寿命问题(MLCE)的研究，讨论了混合整数规划(MIP)的选择值界。由于MIP的极大值是NP完全问题，因此无法得到精确解，但存在选项值的界。本文利用拉格朗日松弛法导出了MIP问题最优值的理论上界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Research the bound of the option value of MIP by Lagrangian relaxation

according to study the a Maximal Lifetime with Constrained Energy problem (MLCE)in a sensors net, we discuss the bound of the option value of mix integer program (MIP). Since the Maximun of the MIP is NP complete problem, so the exact solution can not be obtained, but the bound of the option value is exist. This paper use Lagrangian relaxation method to derive theoretical upper bound on the optimal value of the MIP problem.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC)

自引率

0.00%

发文量