Optimality and duality results for bilevel programming problem using convexifactors (Q637559)

From MaRDI portal
Revision as of 08:20, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Optimality and duality results for bilevel programming problem using convexifactors
scientific article

    Statements

    Optimality and duality results for bilevel programming problem using convexifactors (English)
    0 references
    0 references
    0 references
    6 September 2011
    0 references
    The bilevel programming problem is reformulated as a single mathematical programming problem by using the nonconvex value function of the lower level problem. Sufficient optimality conditions for the bilevel programming problem are obtained, as well as duality results corresponding to Wolfe and Mond-Weier type duals, respectively. To this end the authors consider convexificators and define \(\partial^*\)-convex, \(\partial^*\)-pseudoconvex and \(\partial^*\)-quasiconvex bifunctions based on the work of \textit{J. Dutta} and \textit{S. Chandra} [Optimization 53, No. 1, 77--94 (2004; Zbl 1079.90104)] and \textit{X. F. Li} and \textit{J. Z. Zhang} [J. Optim. Theory Appl. 131, No. 3, 429--452 (2006; Zbl 1143.90035)].
    0 references
    bilevel optimization
    0 references
    value function
    0 references
    convexifactor
    0 references
    optimality and duality
    0 references

    Identifiers