Parametric global optimization for polynomial bilevel programming

DOI10.16163/J.CNKI.22-1123/N.2015.03.002MaRDI QIDQ2992999zbMATH OpenFDO

Authors Junyan Xu, Zhuang Miao, Qinghuai Liu

Publication date 10 August 2016

Full work available at URL https://doi.org/10.16163/J.CNKI.22-1123/N.2015.03.002

zbMATH Keywords

global optimizationnonisolated optimal solutionpolynomial bilevel programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Parametric global optimisation for bilevel programming
• scientific article; zbMATH DE number 6452733
• scientific article; zbMATH DE number 2068075
• Bilevel polynomial programs and semidefinite relaxation methods
• A Lagrange multiplier expression method for bilevel polynomial optimization

Cited in

(9)

• scientific article; zbMATH DE number 2068075 (Why is no real title available?)
• A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
• Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
• A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
• Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
• Parametric integer programming algorithm for bilevel mixed integer programs
• A Lagrange multiplier expression method for bilevel polynomial optimization
• Parametric global optimisation for bilevel programming
• Bilevel polynomial programs and semidefinite relaxation methods

This page was built for publication: Parametric global optimization for polynomial bilevel programming

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