Abstract
This note presents a new solution method for the static constrained Stackelberg problem. Through our approach, the Stackelberg problem is completely transformed into a one-level unconstrained problem such that the newly introduced overall augmented objective function is minimized with repect to the leader's and the follower's variables jointly. It can be proved that a sequence of solutions to the transformed problems converges to the solution of the original problem, when the penalty parameters are updated.
| Original language | English |
|---|---|
| Pages (from-to) | 1111-1114 |
| Number of pages | 4 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 29 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 1984 Dec |
| Externally published | Yes |
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering