DocumentCode :
3160738
Title :
Research the bound of the option value of MIP by Lagrangian relaxation
Author :
Zhou, Fang
Author_Institution :
Dept. of Math., Xianning Univ., Xianning, China
fYear :
2011
fDate :
8-10 Aug. 2011
Firstpage :
4159
Lastpage :
4162
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.
Keywords :
communication complexity; integer programming; relaxation theory; wireless sensor networks; Lagrangian relaxation method; NP complete problem; constrained energy problem; maximal lifetime; mix integer program; option value; sensors net; Algorithm design and analysis; Complexity theory; Monitoring; Sensors; Upper bound; Wireless communication; Wireless sensor networks; Lagrangian relaxation; MIP; bound; option value; upper;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), 2011 2nd International Conference on
Conference_Location :
Deng Leng
Print_ISBN :
978-1-4577-0535-9
Type :
conf
DOI :
10.1109/AIMSEC.2011.6009912
Filename :
6009912
Link To Document :
بازگشت