n维复形上带有时间因素的规划问题  

A Programming Problem with Time Coefficient on N-Complex

作　　者：郑汉鼎[1] 

机构地区：[1]山东大学数学系

出　　处：《应用数学》1990年第3期38-43,共6页Mathematica Applicata

摘　　要：本文讨论了带时间系数的数学规划问题,用图论和拓扑学的方法获得了多目标规划问题的解.In this paper the prográmming problem with time coefficient,is disc- ussed in which n dimensional complex K^n,r-1 dimensional chain b^(r-1) the weights c_j^1,c_j^2,…,c_j^l,and the time coefficient t_j,c_j^i≥0,i=1,2,…,l,j= 1,2,...,a^r corresponding to every simplex A_j~~r are given. Let S be the set of all efficient solution for the following multiple- objective programming min{sum from j=1 to a^r c_j^1|x_j|,sum from j=1 to a^r c_j^2|x_j|,…,sum from j=1 to a^r c_j^l|x_j||△x^r=b^(r-1)}. The time function associated with r dimensional chain x^r=sum form j=1 to a^r x_jA_j^r is given by T(x^r)=max{t_j|x_j≠0}. The programming problem with time coefficient is as follows, minT(x^r).

关 键 词：时间因素 规划问题 基可行解 

分 类 号：O221[理学—运筹学与控制论]