摘要
探讨了ｎ 维复形上一类具有混合约束的多目标规划问题。
A programming problem problem with mix\|subject conditions on n\|complexes is discussed. And the sufficient and necessary condition of the criteria judging the efficient solution of these problems is proved by method of algebraic topology.
出处
《浙江工业大学学报》
CAS
1999年第3期256-259,共4页
Journal of Zhejiang University of Technology
关键词
复形
多目标规划
有效解
N维
complex
multiobjective programming
efficient solution
