摘要
本文研究Ω-凸集的组合性质和结构性质.在一定条件下,证明关于Ω-凸集的Randon型定理,Helly型定理.Caratheodory型定理以及Minkowski型定理,并举例说明对一般的Ω-凸集这些定理不一定成立.文中所得结果是关于凸集的这些类型定理的推广,同时也为有关Ω-凸函数的研究提供了理论工具.
In this paper, we discuss the combinatorial and structural properties ofΩ-convex sets. Theorems of Radon's, Helly's, Caratheodory's and Minkowski's type for Ω-convex sets are proved under some conditions even if they are not valid for Ω-convex sets in general. These results are extensions and variations of the classical fundamental theorems of such types for convex sets,which at the same time provide some useful tools in the study on Ω-functions.
引文
[1] GUERRAGGIO A, MOLHO E. The origins of quasi-concavity:a development between mathematics and economics[J]. Historia Math., 2004, 31(1):62-75.
[2] JEYAKUMAR V, GWINNER J. Inequality systems and optimization[J]. J. of Math Anal.&Appl.,1991, 159(1):51-71.
[3] BLAGA L, KOLUMBAN I. Optimization on closely convex sets[M]//General. Conv., Lect. Notes in Econo. and Math. Systems, Berlin et al:Springer-Verlag, 1994, 405:19-34.
[4] CAMBINI A, MARTEIN L. Generalized Convexity and Optimization:Theory and Applications[M]//Lect. Notes in Econo. and Math. Systems, Berlin et al.:Springer-Verlag, 2009, 616:36-88.
[5] BOT R I, GRAD S-M, WANKA G. Almost convex functions:conjugacy and duality[M]//General.Conv. and Related Topics. Berlin Heidelberg:Springer, 2007:101-114.
[6] SACH P H. New generalized convexity notion for set-valued maps and application to vector optimization[J]. J. of Optim. Theo. and Appl., 2005,125(1):157-179.
[7] MASTROENI G, RAPCSAK T. On convex generalized systems[J]. J. of Optim. Theo. and Appl.,2000, 104(3):605-627.
[8] YANG X M, LI D, WAND S Y. Nearly-subconvexlikeness in vector optimization with set-valued functions[J]. J. Optim. Theo. and Appl., 2001, 110(3):413-427.
[9] YOUNESS E A. E-convex sets, E-convex functions, and E-convex programming[J]. J. of Optim.Theo. and Appl., 1999, 102(2):439-450.
[10] BI Q L, GUO Q. TheΩ-convexity of sets and its basic properities[J]. Mathematica Applicata, 2017,30(4):850-855.
[11] GAUBERT S, MEUNIER F. Caratheodory, Helly and the others in the Max-Plus world[J]. Discrete.Comput. Geom., 2010, 43:648-662.
[12] AMBRUS G, BEZDEK A, FODOR F. A Helly-type transveral theorem for n-dimensional unit balls[J].Arch. Math., 2006, 86:470-480.
[13] AMENTA N. Helly-type theorems and generalized linear programming[J]. Discrete. Comput. Geom.,1994, 12:241-261.
[14] ARONOV B, GOODMAN J E, POLLACK R, WENGER R. A Helly-type theorem for hyperplane transversals to well-separated convex sets[J]. Discrete. Comput. Geom; 2001, 25:507-517.
[15] BREEN M. A Helly-type theorem for intersections of orthogonally starshaped sets in R~d[J]. Period Math Hung, 2014, 68:45-53.
[16] DYER M, A Class of Convex Programs with Applications to Computational Geometry[C]. Proc. of the 8th Ann. Sympo. on Comput. Geom.,1992, 9-15.
[17] MATOUSEK J. A Helly-type theorem for unions of convex sets[J]. Discrete. Comput. Geom., 1997,18:1-12.
[18] BARVINOK A. A Course in Convexity[M]. Providence, Rhode Island:Amer. Math. Soc., 2002.
[19] YAN N. A set correlated with nearly convex set(in Chinese)[J]. J. of Bijie Univ., 2011, 29(4):59-63.
[20] HIRIART-URRUTY J B, LEMARECHAL C. Fundamentals of Convex Analysis[M]. Berlin/Heidelberg/New York:Springer-Verlag, 2001.