二层规划可行解的存在性

Abstract

Abstract:

Bilevel programming is usually formulated with two optimization problems where the constraint set of the first one (upper level problem) is partially det ermined by the optimal reactions of the second one (lower level problem). The paper is devoted to study the existence of feasible solutions, which plays a fun damental and important role in bilevel programming, by means of the w pseu do mo notonicity of the Clarke's subdifferential mapping of the lower level objective function.

Key words: Bilevel programming, Variational inequality, Generalized pseudoconvexity, w pseudo monotonicity

FAN Li-Ya, LIU San-Yang. Existence of Feasible Solutions of Bilevel Programming[J].Acta mathematica scientia,Series A, 2003, 23(6): 739-744.

Trendmd

References

[1]Anandalingam G, Friesz T L. Hierarchical Optimization. Anals of Operations Research, 1992.34

[2]Bard J F. Optimality conditions for the bilevel programming problem. Naval Research Logistics Quarterly, 1984, 31: 13-26

[3]Clarke P, Westerberg A. A note on optimality conditions for the bilevel programming problem. Naval Research Logistics Quarterly, 1988, 35: 413-418

[4]Dempe S. A necessary and sufficient optimality condition for bilevel programming problems. Optimization, 1992, 25: 341-354

[5]Savard G, Gauvin J. The steepest descent direction for the nonlinear bilevel programming problem. Operations Research Letters, 1994, 15: 265-272

[6]Vicente L N, Calamai P H. Geometry and local optimality conditions for bilevel programs with quadratic strictly convex lower levels, minimax and applications. In: Dordrecht M H, ed. Nonconvex Optimization and Its Applications. Dordrecht, Holland：Kluwer Academic Publishers, 1995,373-386

[7]Chadli O, Chbani Z, Riahi H. Equilibrium problems with generalized monotone bifunctions and applications to variational inequalities. Journal of Optimization Theory and Applications, 2000, 105 : 299-323

[8]Ansari Q H, Lin Y C, Yao J C. General KKT theorem with applications to minimax and variational inequalities. Journal of Optimization Theory and Applications, 2000, 104: 41-57

[9]Klatte Diethard. Upper Lipschitz behavior of solutions to perturbed C^1,1 programs. Mathematical Programming, Series B, 2000, 88: 285-311

[10]Clarke F H. Optimization and Nonsmooth Analysis. New York: Wiley, 1983, 73-84

[11]Fan K. A generalization of Tychonoff's fixedpoint theorem. Mathematish e Annalen, 1961, 142: 305-310

[12]Kassay G, Kolumban J. Multivalued parametric variational inequalities with αpseudomonotone maps. Journal of Optimization Theory and Applications, 2000, 107: 35-50

[13]Berge C. Espaces Topologiques: Functions Maltivoques.Paris:Dunod, 1959.109-122

[1]	Wang Wujing, Zhu Meiling, Zhang Yongle. A New Projection Algorithm for Solving Quasimonotone Variational Inequality Problems and Fixed Point Problems [J]. Acta mathematica scientia,Series A, 2025, 45(1): 236-255.
[2]	Wang Ruyu, Zhao Wenling, Song Daojin. The Finite Termination of Feasible Solution Sequence for Optimization and Variational Inequality [J]. Acta mathematica scientia,Series A, 2024, 44(4): 1037-1051.
[3]	Yang Lanxiang, Chen Yi, Ye Minglu. Inertial Projection Algorithms for Quasimonotone Variational Inequalities [J]. Acta mathematica scientia,Series A, 2023, 43(2): 593-603.
[4]	Xia Pingjing, Cai Gang. Self Adaptive Viscosity Algorithm for Solving Variational Inequality Problem in Hilbert Spaces [J]. Acta mathematica scientia,Series A, 2023, 43(2): 581-592.
[5]	Liping Liu,Jianwen Peng. Modified Subgradient Extragradient Algorithms for Solving Common Elements of Variational Inequality and Fixed Point Problems [J]. Acta mathematica scientia,Series A, 2022, 42(5): 1517-1536.
[6]	Jing Yang,Xianjun Long. A New Projection Algorithm for Solving Pseudo-Monotone Variational Inequality and Fixed Point Problems [J]. Acta mathematica scientia,Series A, 2022, 42(3): 904-919.
[7]	Yuehong He,Xianjun Long. A Inertial Contraction and Projection Algorithm for Pseudomonotone Variational Inequality Problems [J]. Acta mathematica scientia,Series A, 2021, 41(6): 1897-1911.
[8]	Gang Cai. Viscosity Implicit Algorithms for a Variational Inequality Problem and Fixed Point Problem in Hilbert Spaces [J]. Acta mathematica scientia,Series A, 2020, 40(2): 395-407.
[9]	Xueping Luo, Mengtian Cui. Solvability of Directional Perturbed Generalized Mixed Variational Inequalities in Reflexive Banach Spaces [J]. Acta mathematica scientia,Series A, 2018, 38(6): 1144-1152.
[10]	Cai Gang, Yekini Shehu. Viscosity Iterative Algorithm for Variational Inequality Problems and Fixed Point Problems of Strict Pseudo-Contractions in q-Uniformly Smooth and Uniformly Convex Banach Spaces [J]. Acta mathematica scientia,Series A, 2016, 36(4): 623-638.
[11]	Cai Gang. Strong Convergence Theorems by A Viscosity Iterative Method for Fixed Point Problems of Nonexpansive Mappings in Banach Spaces [J]. Acta mathematica scientia,Series A, 2015, 35(3): 487-502.
[12]	WEN Dao-Jun. Strong Convergence of an General Iterative Method for a Finite Family of Pseudo-Contractive and Monotone Mappings [J]. Acta mathematica scientia,Series A, 2014, 34(5): 1123-1132.
[13]	PIAO Yong-Jie. Fixed Points and Variational Inequalities \|with Lower and Upper Bounds in Topological Spaces [J]. Acta mathematica scientia,Series A, 2012, 32(2): 364-372.
[14]	FU Jun-Yi. A Strong Vector Equilibrium Problem [J]. Acta mathematica scientia,Series A, 2011, 31(4): 923-929.
[15]	LIU Ying. Viscosity Approximation Methods for Strict Pseudo-contractions in q-uniformly Smooth Banach Spaces [J]. Acta mathematica scientia,Series A, 2011, 31(4): 998-1007.

Existence of Feasible Solutions of Bilevel Programming

PDF (PC)

Abstract

Cite this article

share this article

References

Related Articles 15

Metrics

Comments

Recommended 10