J4

• 数学 • Previous Articles     Next Articles

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

JIANG Zhi-xia1, CHENG Li-bo1, LIU Yu-ning2   

  1. 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: 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

CLC Number: 

  • O221.6