用带权极大模理想点法求解多目标双层规划问题

用带权极大模理想点法求解多目标双层规划问题

姜志侠¹, 成丽波¹, 刘宇宁²

1. 长春理工大学应用数学系, 长春 130022; 2. 长春中联软件公司, 长春 130022

收稿日期:2004-10-14 修回日期:1900-01-01 出版日期:2005-07-26
通讯作者: 姜志侠

Solution of Multiobjective Bilevel Programming Problems by Maximal Module Ideal Point Algorithm with Power

JIANG Zhi-xia¹， CHENG Li-bo¹, LIU Yu-ning²

1. Department of Applied Mathematics, Changchun University of Science and Techn ology, Changchun 130022, China; 2. Changchun Vanda Software Group, Changchun 130022, China

Received:2004-10-14 Revised:1900-01-01 Online:2005-07-26
Contact: JIANG Zhi-xia

摘要/Abstract

摘要： 研究一种具有多个决策者卷入、各决策者的目标不止一个、决策者之间存在二层递阶关系系统——双层多目标规划问题. 给出双层多目标决策问题数学模型的一种解决方法, 把带权极大模理想点法和Kuhn-Tucker条件结合起来, 从而把双层多目标规划问题转化为单层单目标约束规划问题, 进而求得原问题的弱有效解.

关键词: 双层规划, 极大模, 理想点

Abstract: The present paper covers a research on a two level syst em with several interconnected decision makers based on the Stackelberg leader- follower game. It contains many decision makers, each of them has more than one object-bilevel multiobjective decision making. An algorithm is given to solve a mathematical model of bilevel multiobjective decision making. Via connectin g the maximal module ideal point algorithm with the power coefficient under Kuhn-Tucker condition, the bilevel multiobjective programming problem is change d to a singular-level singular-objective constraint programming problem. Then th e weak efficient solution of the problem can be aquired.

Key words: bilevel programming, maximal module, ideal point

中图分类号:

O221.6

姜志侠, 成丽波, 刘宇宁. 用带权极大模理想点法求解多目标双层规划问题[J]. J4, 2005, 43(04): 417-421.

JIANG Zhi-xia， CHENG Li-bo, LIU Yu-ning. Solution of Multiobjective Bilevel Programming Problems by Maximal Module Ideal Point Algorithm with Power[J]. J4, 2005, 43(04): 417-421.

[1]	任爱红. 基于可信度法求解区间双层线性规划问题[J]. 吉林大学学报(理学版), 2018, 56(2): 268-272.
[2]	徐俊彦, 高莹莹, 苗壮, 刘庆怀. 求解二次双层规划问题的全局最优解[J]. 吉林大学学报(理学版), 2014, 52(05): 937-942.
[3]	邓键, 黄庆道, 马明娟,, 张瑶. 改进的Kth-best方法解无上层约束的线性双层规[J]. J4, 2008, 46(06): 1031-1036.
[4]	李佳民, 刘庆怀. 解一类双层规划问题的组合同伦方法[J]. J4, 2007, 45(02): 213-215.