机构地区: 华南理工大学自动化科学与工程学院自动化与网络工程系
出 处: 《华南理工大学学报(自然科学版)》 1995年第6期100-109,共10页
摘 要: 本文首先建立方便于计算机算法描述的目标规划的求解典式;然后提出了在微机上求解高维目标规划的两种算法─改进多阶段单纯形法和动态内存法,并对这两种算法的运行速度和解题能力作了比较和讨论。 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.