Bilevel programming problems are hierarchical optimization problems where the constraints of one problem (the so-called upper level problem) are defined in part by a second …
P Loridan, J Morgan - Journal of global Optimization, 1996 - Springer
We are concerned with weak Stackelberg problems such as those considered in [19],[23] and [25]. Based on a method due to Molodtsov, we present new results to approximate such …
The analysis, processing, evolution, optimization and/or regulation, and control of shapes and images appear naturally in engineering (shape optimization, image processing, visual …
MB Lignola, J Morgan - Journal of Optimization Theory and Applications, 1997 - Springer
A bilevel programming problem S is considered. First, sufficient conditions of minimal character are given on the data of the problem in order to guarantee the lower …
A Aboussoror, P Loridan - Serdica Math. J, 1995 - math.bas.bg
We are concerned with two-level optimization problems called strongweak Stackelberg problems, generalizing the class of Stackelberg problems in the strong and weak sense. In …
A Jofré, RJB Wets - Mathematical Programming, 2009 - Springer
We explore convergence notions for bivariate functions that yield convergence and stability results for their maxinf (or minsup) points. This lays the foundations for the study of the …
Let E be a Hausdorff topological vector space and let us consider, for any n∈ N, the following quasi-variational inequalities (in short qvi)[1]:(1.1) n find un∈ E such that fn (un …
A two-level optimization problem corresponding to a Stackelberg game in which one of the two players has the leadership in playing the game is considered. First, a review of previous …