Some KKM theorems and coincidence theorems involving admissible set-valued mappings and the set-valued mappings with compactly local intersection property are proved in L-convex: spaces. As applications, some new fixe...Some KKM theorems and coincidence theorems involving admissible set-valued mappings and the set-valued mappings with compactly local intersection property are proved in L-convex: spaces. As applications, some new fixed point theorems are obtained in L-convex spaces. These theorems improve and generalize many important known results in recent literature.展开更多
A polyomino P is called L-convex if for every two cells there exists a monotone path included in P with at most one change of direction. This paper is a theoretical step for the reconstruction of all L-convex polyomin...A polyomino P is called L-convex if for every two cells there exists a monotone path included in P with at most one change of direction. This paper is a theoretical step for the reconstruction of all L-convex polyominoes by using the geometrical paths. First we investigate the geometrical properties of all subclasses of non-directed L-convex polyominoes by giving nine geometries that characterize all non-directed L-convex polyominoes. Finally, we study the subclasses of directed L-convex polyominoes and we give necessary and sufficient conditions for polyominoes to be L-convex.展开更多
Two-stage problem of stochastic convex programming with fuzzy probability distribution is studied in this paper. Multicut L-shaped algorithm is proposed to solve the problem based on the fuzzy cutting and the minimax ...Two-stage problem of stochastic convex programming with fuzzy probability distribution is studied in this paper. Multicut L-shaped algorithm is proposed to solve the problem based on the fuzzy cutting and the minimax rule. Theorem of the convergence for the algorithm is proved. Finally, a numerical example about two-stage convex recourse problem shows the essential character and the efficiency.展开更多
基金the NNSF of China(19871059)and the NSF of Education Department of Sichuan Province([2000]25)
文摘Some KKM theorems and coincidence theorems involving admissible set-valued mappings and the set-valued mappings with compactly local intersection property are proved in L-convex: spaces. As applications, some new fixed point theorems are obtained in L-convex spaces. These theorems improve and generalize many important known results in recent literature.
文摘A polyomino P is called L-convex if for every two cells there exists a monotone path included in P with at most one change of direction. This paper is a theoretical step for the reconstruction of all L-convex polyominoes by using the geometrical paths. First we investigate the geometrical properties of all subclasses of non-directed L-convex polyominoes by giving nine geometries that characterize all non-directed L-convex polyominoes. Finally, we study the subclasses of directed L-convex polyominoes and we give necessary and sufficient conditions for polyominoes to be L-convex.
文摘Two-stage problem of stochastic convex programming with fuzzy probability distribution is studied in this paper. Multicut L-shaped algorithm is proposed to solve the problem based on the fuzzy cutting and the minimax rule. Theorem of the convergence for the algorithm is proved. Finally, a numerical example about two-stage convex recourse problem shows the essential character and the efficiency.
基金Supported by the Scientific Research Foundation of Science and Technologe Bureau of Bijie Prefecture of Guizhou Province(2008-06) the Scientific Research Foundation of Bijie University(20072001)
基金Supported by NSF of Science and Technologe Bureau of Bijie Prefecture of Guizhou Province and the Scientific Research Foundation of Bijie University(2008-06)
基金Supported by the Natural Science Research Foundation of Guizhou Provincial Education Department (2008072)the Natural Science Foundation of Science and Technology Bureau of Bijie Area(2008-06)
基金This work was supported by the Natural Scientific Research Foundation of Guizhou Provincial Education Department(2008072)the Natural Science Foundation of Science and Technology Bureau of Bijie Area(2008-06)~~
