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.011zbMATH Open1145.90433OpenAlexW2067223240MaRDI QIDQ932709FDOQ932709
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
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
- Title not available (Why is that?)
- On the quasiconcave bilevel programming problem
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear multiplicative programming
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Two-Level Linear Programming
- Characterizing an optimal solution to the linear bilevel programming problem
- Title not available (Why is that?)
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- On a class of quadratic programs
- Solving linear fractional bilevel programs.
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)
