On the indefinite quadratic bilevel programming problem.

DOI10.1007/BF03398849zbMath1218.90148OpenAlexW2773585166MaRDI QIDQ2477129

Ritu Narang, Getinet Alemayehu, Sant R. Arora

Publication date: 13 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398849

zbMATH Keywords

global optimizationinteger programmingbilevel programmingindefinite quadratic programming problemquasi-concave function

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Quadratic programming (90C20)

Related Items (2)

Branch and cut method for solving integer indefinite quadratic bilevel programs ⋮ Indefinite quadratic integer bilevel programming problem with bounded variables

Cites Work

• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• Solving a bilevel linear program when the inner decision maker control few variables
• Linear multiplicative programming
• On the quasiconcave bilevel programming problem
• Convergent Algorithms for Minimizing a Concave Function
• On two-level optimization
• A cutting plane algorithm for solving bilinear programs
• Convex Relaxations of (0, 1)-Quadratic Programming
• Two-Level Linear Programming
• An Algorithm for Separable Nonconvex Programming Problems
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
• Solving the Fixed Charge Problem by Ranking the Extreme Points

This page was built for publication: On the indefinite quadratic bilevel programming problem.