A new computational method for Stackelberg and min-max problems by use of a penalty method

DOI10.1109/TAC.1981.1102607zbMath0472.93004MaRDI QIDQ3927111

Publication date: 1981

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

numerical examples computational methods penalty method nonlinear programming problems competitive systems constrained parametric problem optimization of two-level systems Stackelberg and min-max problems

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (31)

A homotopy method for solving bilevel programming problem ⋮ Optimality conditions for bilevel programming problems ⋮ Model and algorithm for bilevel newsboy problem with fuzzy demands and discounts ⋮ Bilevel and multilevel programming: A bibliography review ⋮ A theoretical approximation scheme for Stackelberg problems ⋮ On bilevel programming. I: General nonlinear cases ⋮ Convex two-level optimization ⋮ On the numerical solution of a class of Stackelberg problems ⋮ Derivative evaluation and computational experience with large bilevel mathematical programs ⋮ A bilevel bottleneck programming problem ⋮ Optimal task allocation in multi-human multi-robot interaction ⋮ On bilevel fractional 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 ⋮ Double penalty method for bilevel optimization problems ⋮ Solving some optimal control problems using the barrier penalty function method ⋮ Model and extended Kuhn-Tucker approach for bilevel multi-follower decision making in a referential-uncooperative situation ⋮ Parametric global optimisation for bilevel programming ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping ⋮ An overview of bilevel optimization ⋮ Existence of solutions to two-level optimization problems with nonunique lower-level solutions ⋮ A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience ⋮ Bi-level programming for Stackelberg game with intuitionistic fuzzy number: a ranking approach ⋮ An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems ⋮ New results on approximate solution in two-level optimization ⋮ Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization ⋮ BOLIB: Bilevel Optimization LIBrary of Test Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A penalty function approach for solving bi-level linear programs ⋮ Necessary optimality conditions for Stackelberg problems

This page was built for publication: A new computational method for Stackelberg and min-max problems by use of a penalty method