Citation
SDP Relaxations for Two Stage OFDMA Networks with and without Probabilistic Constraints. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 445-458, 2011.
Paper
Abstract
In this paper, we propose a two stage stochastic binary quadratic program for OFDMA wireless networks. The goal is to minimize the total power consumption of the network subject to user bit rates, sub-carrier and modulation constraints. Then, we extend the quadratic model by introducing a knapsack probabilistic constrained approach from (A. Gaivoronski, A. Lisser, R. Lopez and H. Xu (2011) Knapsack problem with probability constraints, Journal of Global Optimization, 49, 397-413) on the user bit rate constraints of the second stage problem. In order to compute lower bounds, we derive linear and semidefinite programming relaxations (Resp. LP and SDP). Numerical results show tight lower bounds for the SDP relaxations when compared to the LP ones. Moreover, near optimal solutions are found by the SDP relaxation without probabilistic constraints.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2011-445-458-P, author = {P. Adasme and A. Lisser and I. Soto},
title = {SDP Relaxations for Two Stage OFDMA Networks with and without Probabilistic Constraints},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {445--458},
note = {Paper},
abstract = {In this paper, we propose a two stage stochastic binary quadratic program for OFDMA wireless networks. The goal is to minimize the total power consumption of the network subject to user bit rates, sub-carrier and modulation constraints. Then, we extend the quadratic model by introducing a knapsack probabilistic constrained approach from (A. Gaivoronski, A. Lisser, R. Lopez and H. Xu (2011) Knapsack problem with probability constraints, Journal of Global Optimization, 49, 397-413) on the user bit rate constraints of the second stage problem. In order to compute lower bounds, we derive linear and semidefinite programming relaxations (Resp. LP and SDP). Numerical results show tight lower bounds for the SDP relaxations when compared to the LP ones. Moreover, near optimal solutions are found by the SDP relaxation without probabilistic constraints.},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-445-458-P.pdf} }