Pages that link to "Item:Q1815064"

The following pages link to Weak via strong Stackelberg problem: New results (Q1815064):

Displaying 50 items.

• Optimality conditions for pessimistic semivectorial bilevel programming problems (Q257725) (← links)
• Solving ill-posed bilevel programs (Q330322) (← links)
• Approximation algorithms for a bi-level knapsack problem (Q391212) (← 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)
• Asymptotic behavior of semi-quasivariational optimistic bilevel problems in Banach spaces (Q481939) (← links)
• Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting (Q526391) (← links)
• Min-max and min-min Stackelberg strategies with closed-loop information structure (Q652647) (← links)
• A penalty function method for solving ill-posed bilevel programming problem via weighted summation (Q741866) (← links)
• A dynamic programming algorithm for the bilevel Knapsack problem (Q833584) (← links)
• Linear bilevel programming with upper level constraints depending on the lower level solution (Q850256) (← links)
• Mathematical structure of a bilevel strategic pricing model (Q958102) (← links)
• The bilevel knapsack problem with stochastic right-hand sides (Q991476) (← links)
• A theoretical approximation scheme for Stackelberg problems (Q1101360) (← links)
• Pure competition, regulated and Stackelberg equilibria: Application to the energy system of Québec (Q1578553) (← links)
• A partial cooperation model for non-unique linear two-level decision problems (Q1600980) (← links)
• Bundle trust-region algorithm for bilinear bilevel programming (Q1608138) (← links)
• Capacity expansion of stochastic power generation under two-stage electricity markets (Q1651629) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• Weak linear bilevel programming problems: existence of solutions via a penalty method (Q1772309) (← links)
• On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
• Approximate values for mathematical programs with variational inequality constraints (Q1928743) (← links)
• An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
• Variational principles for supinf problems with constraints (Q1980270) (← links)
• Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case (Q2059178) (← links)
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
• A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (Q2195296) (← links)
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
• Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities (Q2245701) (← links)
• Subgame perfect Nash equilibrium: a learning approach via costs to move (Q2280200) (← links)
• Perturbations of supinf problems with constraints (Q2330977) (← links)
• Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
• Semivectorial bilevel optimization problem: penalty approach (Q2370057) (← links)
• Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems (Q2401514) (← links)
• Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints? (Q2420795) (← links)
• \(\alpha\)-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints (Q2433930) (← links)
• An overview of bilevel optimization (Q2480262) (← links)
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience (Q2488050) (← links)
• An exact penalty method for weak linear bilevel programming problem (Q2511344) (← links)
• A new method for strong-weak linear bilevel programming problem (Q2514671) (← links)
• A survey on networking games in telecommunications (Q2567161) (← links)
• A pessimistic bilevel stochastic problem for elastic shape optimization (Q2693640) (← links)
• A solution approach to the weak linear bilevel programming problems (Q2817223) (← links)
• Mixed integer parametric bilevel programming for optimal strategic bidding of energy producers in day-ahead electricity markets with indivisibilities (Q2868917) (← links)
• Bilevel Optimization: Reformulation and First Optimality Conditions (Q4557871) (← links)
• On the computation of relaxed pessimistic solutions to MPECs (Q4924110) (← links)
• Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization (Q5014627) (← links)
• Methods for Pessimistic Bilevel Optimization (Q5014636) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)