摘要
探讨了ｎ维复形上一类具有混合约束的多目标规划问题，并运用代数拓扑方法得出这类规划问题的有效解。
In this paper a programming problem with mix subject conditions on n complexes is discussed, and the criteria for the efficient solution to this problems are gained by the use of the method of algebraic topology.
出处
《运筹与管理》
CSCD
1999年第2期29-32,共4页
Operations Research and Management Science
关键词
混合约束
复形
多目标规划
有效解
complex
multiobjective programming
efficient solution
