Weak via strong Stackelberg problem: New results

DOI10.1007/BF00121269zbMath0861.90151MaRDI QIDQ1815064

Pierre Loridan, Jacqueline Morgan

Publication date: 3 November 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

approximate solutionsdata perturbationsepiconvergencelimits of setsconvergence of marginal functionsMolodtsov's methodweak Stackelberg problems

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Nonsmooth analysis (49J52) Hierarchical systems (93A13) Programming in abstract spaces (90C48)

Related Items

A dynamic programming algorithm for the bilevel Knapsack problem ⋮ Semivectorial bilevel optimization problem: penalty approach ⋮ Linear bilevel programming with upper level constraints depending on the lower level solution ⋮ Solving ill-posed bilevel programs ⋮ Capacity expansion of stochastic power generation under two-stage electricity markets ⋮ Bilevel Optimization: Reformulation and First Optimality Conditions ⋮ SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs ⋮ Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems ⋮ Approximate values for mathematical programs with variational inequality constraints ⋮ Approximation algorithms for a bi-level knapsack problem ⋮ Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints? ⋮ An exact solution algorithm for integer bilevel programming with application in energy market optimization ⋮ A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent ⋮ Duality and optimality conditions for reverse convex programs via a convex decomposition ⋮ A pessimistic bilevel stochastic problem for elastic shape optimization ⋮ \(\alpha\)-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints ⋮ Maximum entropy approach for solving pessimistic bilevel programming problems ⋮ An exact algorithm for bilevel 0-1 knapsack problems ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ Min-max and min-min Stackelberg strategies with closed-loop information structure ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results ⋮ Asymptotic behavior of semi-quasivariational optimistic bilevel problems in Banach spaces ⋮ A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem ⋮ Variational principles for supinf problems with constraints ⋮ Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities ⋮ Mathematical structure of a bilevel strategic pricing model ⋮ A dynamic reformulation heuristic for generalized interdiction problems ⋮ Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting ⋮ An overview of bilevel optimization ⋮ Necessary optimality conditions in pessimistic bilevel programming ⋮ On the computation of relaxed pessimistic solutions to MPECs ⋮ A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience ⋮ Weak linear bilevel programming problems: existence of solutions via a penalty method ⋮ The bilevel knapsack problem with stochastic right-hand sides ⋮ Subgame perfect Nash equilibrium: a learning approach via costs to move ⋮ Exact penalty functions for convex bilevel programming problems. ⋮ An exact penalty method for weak linear bilevel programming problem ⋮ Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application ⋮ Bilevel programming and price setting problems ⋮ A new method for strong-weak linear bilevel programming problem ⋮ On the use of intersection cuts for bilevel optimization ⋮ Bilevel programming and price setting problems ⋮ A penalty function method for solving ill-posed bilevel programming problem via weighted summation ⋮ A solution approach to the weak linear bilevel programming problems ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ Optimality conditions for bilevel programming problems ⋮ The Standard Pessimistic Bilevel Problem ⋮ Pure competition, regulated and Stackelberg equilibria: Application to the energy system of Québec ⋮ A survey on networking games in telecommunications ⋮ Perturbations of supinf problems with constraints ⋮ Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization ⋮ Methods for Pessimistic Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Mixed integer parametric bilevel programming for optimal strategic bidding of energy producers in day-ahead electricity markets with indivisibilities ⋮ A partial cooperation model for non-unique linear two-level decision problems ⋮ Bundle trust-region algorithm for bilinear bilevel programming ⋮ Improved approximation algorithms for a bilevel knapsack problem ⋮ Optimality conditions for pessimistic semivectorial bilevel programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gamma-convergence and optimal control problems
• Dynamic noncooperative game theory
• Double penalty method for bilevel optimization problems
• A global optimization approach for the linear two-level program
• On generalized Stackelberg strategies
• Necessary optimality conditions for Stackelberg problems
• \(\epsilon\)-mixed strategies for static continuous-kernel Stackelberg games
• Stability of regularized bilevel programming problems
• On an algorithm solving two-level programming problems with nonunique lower level solutions
• Topological existence and stability for Stackelberg problems
• An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
• On the numerical solution of a class of Stackelberg problems
• A solution method for the static constrained Stackelberg problem via penalty method
• A simple algorithm for the-linear bilevel programming problem
• Existence theorems of equilibrium points in stackelberg
• Convergence analysis for two-level algorithms of mathematical programming
• Remark on the paper “The problem of finding a sequential maximin”
• The solution of a class of non-antagonistic games
• A method of solving linear hierarchical games
• Convergences of marginal functions with dependent constraints
• semi-continuities of marginal functions in a sequential setting
• A necessary and a sufficient optimality condition for bilevel programming problems
• New results on approximate solution in two-level optimization
• Optimality conditions for bilevel programming problems
• Non-Linear Programming Via Penalty Functions

This page was built for publication: Weak via strong Stackelberg problem: New results