国防科技大学学报2011，Vol.33Issue(3)：38-43,6.
基于拉格朗日松弛的航天测控调度上界求解算法
TT&C Scheduling Upper Bound Solution Algorithm Based on Lagrangian Relaxation
摘要
Abstract
The TT&C demand of TT&C Scheduling problem was analyzed and a model of TT&C Scheduling 0-1 integer programming was constructed. The model's facility constraints and satellite constraints were relaxed by lagrangian relaxation method, and an upper bound of lagrangian dual problem by subgradient optimization algorithm was obtained. Finally, two examples were tested. The results demonstrate the validity of upper bound obtained by subgradient optimization algorithm.关键词
航天测控调度/拉格朗日松弛/拉格朗日对偶/次梯度优化Key words
TT&C scheduling/ lagrangian relaxation/ lagrangian dual/ subgradient optimization分类
信息技术与安全科学引用本文复制引用
康宁,武小悦..基于拉格朗日松弛的航天测控调度上界求解算法[J].国防科技大学学报,2011,33(3):38-43,6.基金项目
国家省部资助项目 （）
