By Topic

A global optimization method for the stackelberg problem with convex functions via problem transformation and concave programming

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

2 Author(s)
Kiyotaka Shimizu ; Faculty of Science and Technology, Keio University, Yokohama 223, Japan ; Min Lu

A global optimization method is proposed for solving the Stackelberg problem through problem transformation and concave programming. The proposed method is applicable to a broad class of the Stackelberg problem, in which each function in upper-level is convex or a difference of two convex functions, and that in lower-level is convex.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:25 ,  Issue: 12 )