Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
From MaRDI portal
Publication:932709
DOI10.1016/j.cam.2007.01.011zbMath1145.90433OpenAlexW2067223240MaRDI QIDQ932709
Carmen Galé, Herminia I. Calvete
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
Related Items (9)
A class of integer linear fractional bilevel programming problems ⋮ An objective penalty function of bilevel programming ⋮ A quadratic objective penalty function for bilevel programming ⋮ AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS ⋮ An Objective Penalty Function Algorithm for Bilevel Programming Based on Multi-Parameters ⋮ A cutting plane method for bilevel linear programming with interval coefficients ⋮ A novel penalty function method for semivectorial bilevel programming problem ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a class of quadratic programs
- Linear multiplicative programming
- On the quasiconcave bilevel programming problem
- Practical bilevel optimization. Algorithms and applications
- Characterizing an optimal solution to the linear bilevel programming problem
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Solving linear fractional bilevel programs.
- Foundations of bilevel programming
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Two-Level Linear Programming
This page was built for publication: Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
