By Topic

An investigation of the linear three level programming problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jonathan F. Bard ; Dept. of Mech. Eng., Texas Univ., Austin, TX, USA

The open-loop Stackelberg game is conceptually extended to p players by the multilevel programming problem (MLPP) and can thus be used as a model for a variety of hierarchical systems in which sequential planning is the norm. The rational reaction sets for each of the players is first developed, and then the geometric properties of the linear MLPP are stated. Next, first-order necessary conditions are derived, and the problem is recast as a standard nonlinear program. A cutting plane algorithm using a vertex search procedure at each iteration is proposed to solve the linear three-level case. An example is given to highlight the results, along with some computational experience.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-14 ,  Issue: 5 )