摘要
本文讨论了多目标规划的障碍函数问题。研究了障碍函数问题有效解与原问题有效解之间的关系,也研究了这两问题有效解集E(X_0,μ)和E(X)之间的关系。其中一些结论是非线性规划结论的推广,另一些结论是新的。
In this paper, we discuss the barrier function problem of multjobjective programming. We study the relation between the efficient solution of the barrier function problem and the efficient solution of the primal problem. We also study the relation between E(X,/i) and E(X), where E(X,μ) and E(X)are efficient solution sets of the barrier function problem and the primal problem respectively. Some results are similar to the results of nonlinear programming. In addition, some new results are given.
出处
《高校应用数学学报（A辑）》
CSCD
北大核心
1990年第2期178-187,共10页
Applied Mathematics A Journal of Chinese Universities(Ser.A)
