A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
From MaRDI portal
Publication:2371493
DOI10.1016/j.amc.2006.10.045zbMath1137.90617OpenAlexW2061228544MaRDI QIDQ2371493
Publication date: 4 July 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.10.045
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Methods of reduced gradient type (90C52)
Related Items (26)
Solving linear bilevel multiobjective programming problem via exact penalty function approach ⋮ A quantum computing based numerical method for solving mixed-integer optimal control problems ⋮ An exact penalty function based on the projection matrix ⋮ A LINEAR BILEVEL PROGRAMMING PROBLEM FOR OBTAINING THE CLOSEST TARGETS AND MINIMUM DISTANCE OF A UNIT FROM THE STRONG EFFICIENT FRONTIER ⋮ A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm ⋮ Solution algorithm for an optimistic linear Stackelberg problem ⋮ A solution method for the optimistic linear semivectorial bilevel optimization problem ⋮ Infer objective function of glycerol metabolism in klebsiella pneumoniae basing on bilevel programming ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ A trajectory planning of redundant manipulators based on bilevel optimization ⋮ New Models for Computing the Distance of DMUs to the Weak Efficient Boundary of Convex and Nonconvex PPSs in DEA ⋮ A novel approach to solve multi-objective fuzzy stochastic bilevel programming using genetic algorithm ⋮ Solving quadratic convex bilevel programming problems using a smoothing method ⋮ An approach for solving a fuzzy bilevel programming problem through nearest interval approximation approach and KKT optimality conditions ⋮ An objective penalty function of bilevel programming ⋮ The backpropagation artificial neural network based on elite particle swam optimization algorithm for stochastic linear bilevel programming problem ⋮ A cooperative coevolution PSO technique for complex bilevel programming problems and application to watershed water trading decision making problems ⋮ A penalty function method for solving inverse optimal value problem ⋮ Integrating goal programming, Kuhn-Tucker conditions, and penalty function approaches to solve linear bi-level programming problems ⋮ A relaxation solving approach for the linear trilevel programming problem ⋮ Exact penalty method for the nonlinear bilevel programming problem ⋮ Bi-level vendor-buyer strategies for a time-varying product price ⋮ A penalty function method based on bilevel programming for solving inverse optimal value problems ⋮ Efficiently solving linear bilevel programming problems using off-the-shelf optimization software ⋮ A novel penalty function method for semivectorial bilevel programming problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Double penalty method for bilevel optimization problems
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- On the definition of linear bilevel programming solution
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- A study of local solutions in linear bilevel programming
- Computational Difficulties of Bilevel Linear Programming
- On two-level optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A solution method for the linear static Stackelberg problem using penalty functions
This page was built for publication: A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
