Skip to main content
SpringerLink
Log in

A weighting method for 0–1 indefinite quadratic bilevel programming

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Al-Khayyal FA (1986) Linear, quadratic and bilinear programming approaches to linear complementarity problem. Eur J Oper Res 24:216–227

    Article  Google Scholar 

  • Bialas W, Karwan M, Shaw J (1980) A parametric complementary pivot approach for two- level linear programming. Techanical Report 80-2, State University of New York at Buffalo, Operations Research Program

  • Cabot A, Francis RL (1970) Solving certain non-convex quadratic minimization problems by ranking the extreme points. Oper Res 18:82–86

    Article  Google Scholar 

  • Calvete HI, Gale C (2003) Local optimality in quasiconcave bilevel programming. Monografias del Semin Matem. Garcia de Galdeano. 27:153–160

    Google Scholar 

  • Calvete HI, Gale C, Mateo P (2008) A new approach for solving linear bilevel problems using genetic algorithms. Eur J Oper Res 188(1):14–28

    Article  Google Scholar 

  • Chang CT (2000) An efficient linearization approach for mixed integer problems. Eur J Oper Res 123:652–659

    Article  Google Scholar 

  • Faisca NP, Dua V, Rustem B, Saraiva PM, Pistikopoulos EN (2007) Parametric global optimization for bilevel programming. J Glob Optim 38:609–623

    Article  Google Scholar 

  • Faisca PN, Dua V, Rustem B, Saraiva PM, Pistikopoulos EN (2009) A multi- parametric programming approach for multilevel hierarchical and decentralized optimization problems. Comput Manage Sci 6(4):377–397

    Article  Google Scholar 

  • Falk JE, Soland RM (1969) An algorithm for solving separable non-convex programming problems. Manage Sci 15:550–569

    Article  Google Scholar 

  • Ho W (2008) Integrated analytic hierarchy process and its applications—a literature review. Eur J Oper Res 186:211–228

    Article  Google Scholar 

  • Konno H (1976) Maximizaiton of convex quadratic function under linear constraints. Math Program 11:117–127

    Article  Google Scholar 

  • Majthey A, Whinston A (1974) Quasi-concave minimization subject to linear constraints. Discrete Math 1:35–39

    Article  Google Scholar 

  • Mishra S (2007) Weighting method for bilevel linear fractional programming problems. Eur J Oper Res 183(1):296–302

    Google Scholar 

  • Murty KG (1969) Solving the fixed charge problem by ranking the extreme points. Oper Res 16:268–279

    Article  Google Scholar 

  • Rosen JB (1983) Global minimization of a linearly constrained concave function by partition of feasible domain. Math Oper Res 8:215–230

    Article  Google Scholar 

  • Saharidis GKD, Lerapetritou MG (2009) Resolution method for mixed integer bi-level linear problem based on decomposition technique. J Glob Optim 44(1):29–51

    Article  Google Scholar 

  • Satty TL (1980) The analytical hierarchy process: planning, priority setting and resource allocation. RWS Publication, Pittsburg

    Google Scholar 

  • Satty TL (1994) Fundamentals of decision making and priority theory with the analytic hierarchy process. RWS Publications, Pittsburg

    Google Scholar 

  • Stackelberg H (1952) The theory of the market economy. Oxford University Press, New York

    Google Scholar 

  • Sun D, Benekohal RF, Waller ST (2006) Bilevel programming formulation and Heuristic solution approach for dynamic traffic signal optimization. Comput Aided Civil Infrastruct Eng 21(5):321–333

    Article  Google Scholar 

  • Thoi NV, Tuy H (1980) Convergent algorithms for minimizing a concave function. Math Oper Res 5:556–566

    Article  Google Scholar 

  • Vaidya OS, Kumar S (2006) Analytic hierarchy process: an overview of applications. Eur J Oper Res 169:1–29

    Article  Google Scholar 

  • White DJ, Anandalingam G (1993) A penalty function approach for solving bilevel linear programs. J Glob Optim 3:397–419

    Article  Google Scholar 

  • Yi P, Cheng G, Jiang L (2008) A sequential approximate programming strategy for performance measure-based probabilistic structural design optimization. Struct Saf 30(2):91–109

    Article  Google Scholar 

  • Zwart PB (1974) Global maximization of a convex function with linear inequality constraints. Oper Res 22:602–609

    Article  Google Scholar 

Download references

Acknowledgments

We are thankful to the referees for their valuable comments which helped us in improving the paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, Hansraj College, Delhi University, Delhi, India

    S. R. Arora

  2. Department of Mathematics, Keshav Mahavidyalaya, Delhi University, Delhi, India

    Ritu Arora

Authors
  1. S. R. Arora
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ritu Arora
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ritu Arora.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arora, S.R., Arora, R. A weighting method for 0–1 indefinite quadratic bilevel programming. Oper Res Int J 11, 311–324 (2011). https://doi.org/10.1007/s12351-010-0088-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-010-0088-9

Keywords

Mathematics Subject Classification (2010)

Search

Navigation