Local search in a quadratic-linear bilevel programming problem

zbMATH Open1212.90331MaRDI QIDQ3162007FDOQ3162007

Authors A. S. Strekalovskiĭ, Andrey Vasil'evich Orlov, A. V. Malyshev 

Publication date 18 October 2010

zbMATH Keywords

local searchbilevel programmingcomputational simulationnon-convex optimization problemsoptimistic solutiontest problems generating

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26)

Recommendations

• Numerical solution of a class of bilevel programming problems
• On computational search for optimistic solutions in bilevel problems
• Numerical solution of a linear bilevel problem
• Global search for guaranteed solutions in quadratic-linear bilevel optimization problems
• scientific article; zbMATH DE number 2052985

Cited in

(9)

• Connection of some bilevel and nonlinear optimization problems
• Global search for guaranteed solutions in quadratic-linear bilevel optimization problems
• Numerical solution of a class of bilevel programming problems
• Efficient local search procedures for quadratic fractional programming problems
• On computational search for optimistic solutions in bilevel problems
• Numerical solution of a linear bilevel problem
• Checking local optimality in constrained quadratic programming is NP- hard
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Breakout local search for the quadratic assignment problem

This page was built for publication: Local search in a quadratic-linear bilevel programming problem

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