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.
No takes yet. Share an insight, caveat, or question.
Shimizu et al. (1995) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: