LINEAR BILEVEL MULTIOBJECTIVE OPTIMIZATION PROBLEM: PENALTY APPROACH

被引：6
|
作者：
Lv, Yibing [1 ]
Wan, Zhongping [2 ]
机构：
[1] Yangtze Univ, Sch Informat & Math, Jingzhou 434023, Peoples R China
[2] Wuhan Univ, Sch Math & Stat, Wuhan 430072, Hubei, Peoples R China
来源：
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION | 2019年 / 15卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Linear bilevel multiobjective programming; multiple objective programming; pareto optimal solution; penalty methods; numerical results; DECISION-MAKING; PROGRAMS;
D O I：
10.3934/jimo.2018092
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper, we are interested by the linear bilevel multiobjective programming problem, where both the upper level and the lower level have multiple objectives. We approach this problem via an exact penalty method. Then, we propose an exact penalty function algorithm. Numerical results showing viability of the algorithm proposed are presented.
引用
收藏
页码：1213 / 1223
页数：11
相关论文
共 50 条
12345