摘要
本文首先建立方便于计算机算法描述的目标规划的求解典式；然后提出了在微机上求解高维目标规划的两种算法─改进多阶段单纯形法和动态内存法，并对这两种算法的运行速度和解题能力作了比较和讨论。
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.
出处
《华南理工大学学报（自然科学版）》
EI
CAS
CSCD
1995年第6期100-109,共10页
Journal of South China University of Technology(Natural Science Edition)
基金
广东省自然科学基金
关键词
多目标规划
线性规划
单纯形算法
目标规划
s:multiple objective programmings
large scale linear programmings
simplex algorithms/reviced multi-phase simplex algorithms
