Optimality Conditions and Geometric Properties of a Linear Multilevel Programming Problem with Dominated Objective Functions

In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.     

Strong Vector Equilibrium Problems

In this paper, the existence of the solution for strong vector equilibrium problems is studied by using the separation theorem for convex sets. The arc-wise connectedness and the closedness of the strong solution set for vector equilibrium problems are discussed; and a necessary and sufficient condition for the strong solution is obtained.     

Continuous Selectors of Fixed Point Sets of Multifunctions with Decomposable Values

Existence theorems of continuous selectors whose values are fixed points of multivalued contractions are proved. As an application, the existence of continuous selectors to generalized solution sets of partial differential inclusions, depending on a parameter, is obtained.     

On the connectedness of partially balanced block designs

The necessary and sufficient conditions for m-associate partially balanced block (PBB) designs to be connected are given. This generalizes the criterion for m-associate partially balanced incomplete block (PBIB) designs, which has originally been established by Ogawa, Ikeda and Kageyama (1984, Proceedings of the Seminar on Combinatorics and Applications, 248–255, Statistical Publishing Society, Calcutta).This work was partially supported by the Polish Academy of Sciences Grant No. MR I.1-2/2.     

Efficiency of connected binary block designs when a single observation is unavailable

In this paper the problem of finding the design efficiency is considered when a single observation is unavailable in a connected binary block design. The explicit expression of efficiency is found for the resulting design when the original design is a balanced incomplete block design or a group divisible, singular or semiregular or regular with ₁>0, design. The efficiency does not depend on the position of the unavailable observation. For a regular group divisible design with ₁>0, the efficiency depends on the position of the unavailable observation. The bounds, both lower and upper, on the efficiency are given in this situation. The efficiencies of designs resulting from a balanced incomplete block design and a group divisible design are in fact high when a single observation is unavailable.The work of the first author is sponsored by the Air Force Office of Scientific Research under Grant AFOSR-90-0092.On leave from Indian Statistical Institute, Calcutta, India. The work of the third author was supported by a grant from the CMDS, Indian Institute of Management, Calcutta.     

含参广义集值强向量平衡问题的稳定性

本文借助集合极限的性质和弱f-性假设证明了含参广义集值强向量平衡问题解集映射的下半连续性,其方法不同于最近文献(Zhao,2016和Meng,2018).此外,建立了含参广义集值强向量平衡问题解集连通性的充分条件,并举例验证了所得结果的正确性.本文得结果推广和改进了已有文献(Gong,2008,Xu,2009,Chen,2010,Xu,2013和Zhao,2013)中相应结果.     

Simple connectedness of hyperplane complements in some geometries related to buildings

For a class of parapolar spaces that includes the geometries E6,4, E7,7, and E8,1 with lines of size at least three, the metasymplectic spaces with lines of size at least four, and the polar line Grassmannians with lines of size at least four except D4,2(3), we show that the subgraph of the point-collinearity graph induced on the complement of a hyperplane is simply connected. We also show that these parapolar spaces have Veldkamp lines.     

On the Connectedness of Probabilistic Constraint Sets

We prove a result on the connectedness of (abstract) probabilistic constraints P(h(x,)0)p without any assumption on the distribution of . An application to storage level constraints is discussed briefly. Illustrating examples are provided and a simple criterion for the required condition is given in the case of linear h.     

A Survey on Topological Properties of Tiles Related to Number Systems

In the present paper we give an overview of topological properties of self-affine tiles. After reviewing some basic results on self-affine tiles and their boundary we give criteria for their local connectivity and connectivity. Furthermore, we study the connectivity of the interior of a family of tiles associated to quadratic number systems and give results on their fundamental group. If a self-affine tile tessellates the space the structure of the set of its ‘neighbors’ is discussed.