Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm

DOI10.1016/J.CAM.2007.01.011MaRDI QIDQ932709zbMATH OpenOpenAlexFDO

Authors Herminia I. Calvete, Carmen Galé

Publication date 11 July 2008

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2007.01.011

zbMATH Keywords

bilevel programmingcutting planepenalty approachmultiplicative programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• A PENALTY METHOD FOR SOLVING BILEVEL LINEAR FRACTIONAL/LINEAR PROGRAMMING PROBLEMS
• An objective penalty function of bilevel programming
• A cutting plane algorithm for solving linear bilevel programs
• A cutting plane approach for solving linear bilevel programming problems
• Linear bilevel programs with multiple objectives at the upper level

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 757680 (Why is no real title available?)
• scientific article; zbMATH DE number 914364 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Characterizing an optimal solution to the linear bilevel programming problem
• Foundations of bilevel programming
• Linear multiplicative programming
• Multiplicative programming problems: Analysis and efficient point search heuristic
• On a class of quadratic programs
• On the quasiconcave bilevel programming problem
• Practical bilevel optimization. Algorithms and applications
• Solving linear fractional bilevel programs.
• Two-Level Linear Programming

Cited in

(12)

• An objective penalty function of bilevel programming
• A cutting plane method for bilevel linear programming with interval coefficients
• A novel penalty function method for semivectorial bilevel programming problem
• A class of integer linear fractional bilevel programming problems
• A quadratic objective penalty function for bilevel programming
• On the use of intersection cuts for bilevel optimization
• A cutting plane approach for solving linear bilevel programming problems
• AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
• An objective penalty function algorithm for bilevel programming based on multi-parameters
• Bilevel optimization: theory, algorithms, applications and a bibliography
• A cutting plane algorithm for solving linear bilevel programs

This page was built for publication: Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm

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