A weighting method for 0-1 indefinite quadratic bilevel programming

被引:0
|
作者
Arora, S. R. [1 ]
Arora, Ritu [2 ]
机构
[1] Univ Delhi, Dept Math, Hansraj Coll, Delhi 110007, India
[2] Univ Delhi, Dept Math, Keshav Mahavidyalaya, Delhi 110007, India
关键词
Indefinite quadratic programming; Bilevel programming; Scalar optimization; Analytic hierarchy process; Mixed-integer programming; ANALYTIC HIERARCHY PROCESS; MAXIMIZATION; MINIMIZATION;
D O I
10.1007/s12351-010-0088-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper a weighting method is developed to find the solution of a 0-1 Indefinite Quadratic Bilevel Programming problem. The proposed approach converts the hierarchical system into a scalar optimization problem by finding the proper weights using the Analytic Hierarchy Process (AHP). These weights are used to combine the objective functions of both levels into one objective. Here, the relative weights represent the relative importance of the objective functions. The reduced problem, that is, the scalar optimization problem is then linearized and it is solved with an appropriate optimization software. The algorithm is explained with the help of an example.
引用
收藏
页码:311 / 324
页数:14
相关论文
共 50 条
  • [41] METHOD FOR SOLVING INDEFINITE QUADRATIC PROGRAMMING PROBLEM
    MUELLER, RK
    MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05): : 333 - 339
  • [42] A CONIC APPROXIMATION METHOD FOR THE 0-1 QUADRATIC KNAPSACK PROBLEM
    Zhou, Jing
    Chen, Dejun
    Wang, Zhenbo
    Xing, Wenxun
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2013, 9 (03) : 531 - 547
  • [43] Consistency for 0-1 Programming
    Davarnia, Danial
    Hooker, J. N.
    INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2019, 2019, 11494 : 225 - 240
  • [44] The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases
    Punnen, Abraham P.
    Sripratak, Piyashat
    Karapetyan, Daniel
    DISCRETE APPLIED MATHEMATICS, 2015, 193 : 1 - 10
  • [45] Detection of Code Spread OFDM Based on 0-1 Integer Quadratic Programming
    Elghariani, Ali
    Zoltowski, Michael D.
    WIRELESS SENSING, LOCALIZATION, AND PROCESSING VII, 2012, 8404
  • [46] Detection of Code Spread OFDM Based on 0-1 Integer Quadratic Programming
    Elghariani, Ali
    Zoltowski, Michael D.
    2012 CONFERENCE RECORD OF THE FORTY SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2012, : 1962 - 1966
  • [47] A new penalty parameter for linearly constrained 0-1 quadratic programming problems
    Hsia, Yong
    Wang, Yanping
    OPTIMIZATION LETTERS, 2013, 7 (04) : 765 - 778
  • [48] Approximation algorithm for quadratic cost 0-1 mixed integer programming problems
    Mukai, Kumiko
    Tatsumi, Keiji
    Fukushima, Masao
    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), 1999, 82 (06): : 9 - 16
  • [49] Detection of Code Spread OFDM Based on 0-1 Integer Quadratic Programming
    Elghariani, Ali
    Zoltowski, Michael D.
    2012 IEEE MILITARY COMMUNICATIONS CONFERENCE (MILCOM 2012), 2012,
  • [50] A new linearization technique for multi-quadratic 0-1 programming problems
    Chaovalitwongse, W
    Pardalos, PM
    Prokopyev, OA
    OPERATIONS RESEARCH LETTERS, 2004, 32 (06) : 517 - 522