Pages that link to "Item:Q1207038"
From MaRDI portal
The following pages link to A global optimization approach for the linear two-level program (Q1207038):
Displayed 18 items.
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
- The complementary convex structure in global optimization (Q1187368) (← links)
- On the quasiconcave bilevel programming problem (Q1273913) (← links)
- A quasiconcave minimization method for solving linear two-level programs (Q1318264) (← links)
- Linear programs with an additional rank two reverse convex constraint (Q1327432) (← links)
- Bilevel and multilevel programming: A bibliography review (Q1338535) (← links)
- Test problem construction for linear bilevel programming problems (Q1815062) (← links)
- Weak via strong Stackelberg problem: New results (Q1815064) (← links)
- Bilevel programming in traffic planning: Models, methods and challenge (Q1913607) (← links)
- Deriving the properties of linear bilevel programming via a penalty function approach (Q1962473) (← links)
- A novel approach to bilevel nonlinear programming (Q2465482) (← links)
- New branch-and-Cut algorithm for bilevel linear programming (Q2471104) (← links)
- An overview of bilevel optimization (Q2480262) (← links)
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience (Q2488050) (← links)
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (Q2564166) (← links)
- A method for solving bilevel linear programming problems (Q3602259) (← links)
- Minimizing the sum of a convex function and a specially structured nonconvex function (Q3835636) (← links)
- Exact penalty functions for convex bilevel programming problems. (Q5958092) (← links)