Known properties of ‘‘canonical connections’’ from database theory and of ‘‘closed sets’’ from statistics implicitly define a hypergraph convexity, here called canonical convexity (cconvexity), and provide an efficient algorithm to compute c-convex hulls. We characterize the class of hypergraphs in which c-convexity enjoys the Minkowski–Krein–Milman property. Moreover, we compare c-convexity wi...

The following integer analogue of a Radon partition in affine space rd is studied: A partition (S, T) of a set of integer points in ,]d is an integral Radon partition if the convex hulls of S and T have an integer point in common. The Radon number r(d) of an appropriate convexity space on the integer lattice Zd is then the infimum over those natural numbers n such that any set of n points or mo...

9 Abstract 10 We formulate two pairs of second order symmetric duality for nonlinear multiobjective mixed integer programs for 11 arbitrary cones. By using the concept of efficiency and second order invexity, we establish the weak, strong, converse 12 and self-duality theorems for our dual models. Several known results are obtained as special cases. 17 Following the earlier works of Dorn [5], D...

Abstract. The Bayesian approach has proved to be a coherent approach to handle ill posed Inverse problems. However, the Bayesian calculations need either an optimization or an integral calculation. The maximum a posteriori (MAP) estimation requires the minimization of a compound criterion which, in general, has two parts: a data fitting part and a prior part. In many situations the criterion to...

Problem of defining convexity of a digital region is considered. Definition of DL− (digital line) convexity is proposed, and it is shown to be stronger than the other two definitions, T−(triangle) convexity and L−(line) convexity. In attempt to connect the convexity of digital sets, to the fact that digital set can be a fuzzy set, the notion of convexity of the membership function is introduced...