首页 | 本学科首页   官方微博 | 高级检索  
     检索      

用带权极大模理想点法求解多目标双层规划问题
引用本文:姜志侠,成丽波,刘宇宁.用带权极大模理想点法求解多目标双层规划问题[J].吉林大学学报(理学版),2005,43(4):417-421.
作者姓名:姜志侠  成丽波  刘宇宁
作者单位:长春理工大学,应用数学系,长春,130022;长春中联软件公司,长春,130022
基金项目:教育部科学技术研究重点项目基金(批准号:02089).
摘    要:研究一种具有多个决策者卷入、 各决策者的目标不止 一个、 决策者之间存在二层递阶关系系统——双层多目标规划问题. 给出双层多目标决 策问题数学模型的一种解决方法, 把带权极大模理想点法和Kuhn-Tucker条件结合起来, 从 而把双层多目标规划问题转化为单层单目标约束规划问题, 进而求得原问题的弱有效解.

关 键 词:双层规划  极大模  理想点
文章编号:1671-5489(2005)04-0417-05
收稿时间:2004-10-14
修稿时间:2004年10月14

Solution of Multiobjective Bilevel Programming Problems by Maximal Module Ideal Point Algorithm with Power
JIANG Zhi-xia,CHENG Li-bo,Liu Yu-ning.Solution of Multiobjective Bilevel Programming Problems by Maximal Module Ideal Point Algorithm with Power[J].Journal of Jilin University: Sci Ed,2005,43(4):417-421.
Authors:JIANG Zhi-xia  CHENG Li-bo  Liu Yu-ning
Institution:1. Department of Applied Mathematics, Changchun University of Science and Techn ology, Changchun 130022, China; 2. Changchun Vanda Software Group, Changchun 130022, China
Abstract:The present paper covers a research on a two level system 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 connecting the maximal module ideal point algorithm with the (power) coefficient under Kuhn-Tucker condition, the bilevel multiobjective programming problem is changed to a singular-level singular-objective constraint programming problem. Then the weak efficient solution of the (problem) can be aquired.
Keywords:bilevel programming  maximal module  ideal point
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号