The Linear-Quadratic Bilevel Programming Problem

DOI10.1080/03155986.1994.11732240MaRDI QIDQ4304827zbMATH OpenOpenAlexFDO

Authors Ana M. Faustino, Joaquim J. Júdice

Publication date 31 January 1995

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1994.11732240

zbMATH Keywords

linear bilevel programminglinear complementaritysparse matrices

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Hierarchical systems (93A13)

Recommendations

• Bilevel linear programming
• On the quasiconcave bilevel programming problem
• Optimality conditions and an algorithm for linear-quadratic bilevel programs$fr1:¹$f:¹partially supported by nsfc and madis. this paper was prepared during the first author's visiting universitat de barcelona. he is grateful to the f
• The Mixed Integer Linear Bilevel Programming Problem
• A method for solving bilevel linear programming problems
• scientific article; zbMATH DE number 817607
• Presolving linear bilevel optimization problems
• Efficient solutions for the linear bilevel programming problem
• The quadratic-linear bi-level programming with interval coefficients

Cited in

(20)

• A simple bilinear optimization problem
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• Descent approaches for quadratic bilevel programming
• Bilevel and multilevel programming: A bibliography review
• A new descent algorithm for solving quadratic bilevel programming problems.
• Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
• Feature selection for classification models via bilevel optimization
• Algorithms for linear programming with linear complementarity constraints
• A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
• Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem
• An overview of bilevel optimization
• Branch and cut method for solving integer indefinite quadratic bilevel programs
• A bi-level optimization model for the asset-liability management of insurance companies
• A computational study for bilevel quadratic programs using semidefinite relaxations
• Optimality conditions and an algorithm for linear-quadratic bilevel programs$fr1:¹$f:¹partially supported by nsfc and madis. this paper was prepared during the first author's visiting universitat de barcelona. he is grateful to the financial support provided by universitat de barcelona. the authors are very grateful to the referees for their valuable suggestions and comments
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Two-Level Linear Programming
• Tight SDP relaxations for cardinality-constrained problems
• A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
• On exact solution approaches for bilevel quadratic 0-1 knapsack problem

This page was built for publication: The Linear-Quadratic Bilevel Programming Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304827)