Pages that link to "Item:Q1612678"
From MaRDI portal
The following pages link to Foundations of bilevel programming (Q1612678):
Displayed 50 items.
- On the competitive facility location problem with a free choice of suppliers (Q463373) (← links)
- Bilevel competitive facility location and pricing problems (Q463381) (← links)
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints (Q463746) (← links)
- Neural network for solving convex quadratic bilevel programming problems (Q470205) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (Q480824) (← links)
- Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property (Q481045) (← links)
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints (Q481046) (← links)
- Asymptotic behavior of semi-quasivariational optimistic bilevel problems in Banach spaces (Q481939) (← links)
- A quadratic objective penalty function for bilevel programming (Q488923) (← links)
- A smoothing method for solving bilevel multiobjective programming problems (Q489158) (← links)
- Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP) (Q492855) (← links)
- On a smooth dual gap function for a class of player convex generalized Nash equilibrium problems (Q493045) (← links)
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
- Estimation of distribution algorithm for a class of nonlinear bilevel programming problems (Q497954) (← links)
- Enhanced exact algorithms for discrete bilevel linear problems (Q499703) (← links)
- Set approach for set optimization with variable ordering structures. I: Set relations and relationship to vector approach (Q504807) (← links)
- Global efficiency for multiobjective bilevel programming problems under generalized invexity (Q513525) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints (Q526392) (← links)
- Direct search algorithm for bilevel programming problems (Q540635) (← links)
- An approximate programming method based on the simplex method for bilevel programming problem (Q604030) (← links)
- Constant-rank condition and second-order constraint qualification (Q604264) (← links)
- Three modeling paradigms in mathematical programming (Q607499) (← links)
- The budget constrained \(r\)-interdiction median problem with capacity expansion (Q623776) (← links)
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs (Q630017) (← links)
- Optimality and duality results for bilevel programming problem using convexifactors (Q637559) (← links)
- Constraint programming approach to a bilevel scheduling problem (Q647473) (← links)
- Connection of some bilevel and nonlinear optimization problems (Q647864) (← links)
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem (Q654062) (← links)
- A mathematical model for optimal functional disruption of biochemical networks (Q655173) (← links)
- Is bilevel programming a special case of a mathematical program with complementarity constraints? (Q662289) (← links)
- Solving bi-level linear programming problem through hybrid of immune genetic algorithm and particle swarm optimization algorithm (Q669445) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (Q683332) (← links)
- A sequential implicit function theorem for iterative solution of generalized equation involving point-based approximation (Q693207) (← links)
- Optimization problems with equilibrium constraints and their numerical solution. (Q703216) (← links)
- Bilevel model for production-distribution planning solved by using ant colony optimization (Q709146) (← links)
- Parametric integer programming algorithm for bilevel mixed integer programs (Q711715) (← links)
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
- Uniqueness and multiplicity of market equilibria on DC power flow networks (Q724072) (← links)
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software (Q724343) (← links)
- Extended antipodal theorems (Q725874) (← links)
- Optimization for signal setting problems using non-smooth techniques (Q730911) (← links)
- Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints (Q742306) (← links)
- A smoothing augmented Lagrangian method for solving simple bilevel programs (Q742311) (← links)
- On bilevel variational inequalities (Q743781) (← links)
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints (Q746815) (← links)
- Bilevel programming for price-based electricity auctions: a revenue-constrained case (Q748595) (← links)