首页 | 本学科首页   官方微博 | 高级检索  
     检索      

目标规划的典式和高维目标规划的求解
引用本文:蔡广基,刘永清.目标规划的典式和高维目标规划的求解[J].华南理工大学学报(自然科学版),1995,23(6):100-109.
作者姓名:蔡广基  刘永清
作者单位:华南理工大学自动化系
摘    要:本文首先建立方便于计算机算法描述的目标的求解典式,然后提出了在微机上求解高维目标规划的两种算法-改进多阶段单纯形法和动态内存法,并对这两种算法的运行速度和解题能力作了比较和讨论。

关 键 词:多目标规划  线性规划  单纯形算法  目标规划

CANONICAL EQUATIONS OF MULTIPLE OBJECTIVE PROGRAMMINGS AND SOLVING OF LARGE SCALE GOAL PROGRAMMINGS
Cat Guangji, Liu Yongqing.CANONICAL EQUATIONS OF MULTIPLE OBJECTIVE PROGRAMMINGS AND SOLVING OF LARGE SCALE GOAL PROGRAMMINGS[J].Journal of South China University of Technology(Natural Science Edition),1995,23(6):100-109.
Authors:Cat Guangji  Liu Yongqing
Abstract:In this paper, a set of canonical equations of goal programming is proposed for the need of describing the solving process of goal programming. Then,two algorithms, the reviced multi-phase simplex algorithm and the dynamical memory algorithm, for solving large-scale goal programming are presented. Last, a comparison between the two algorithms is discussed extensively.
Keywords:s:multiple objective programmings  large scale linear programmings  simplex algorithms/reviced multi-phase simplex algorithms  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号