K-convexity in R
نویسندگان
چکیده
We generalize the concept of K-convexity to an n-dimensional Euclidean space. The resulting concept of K-convexity is useful in addressing production and inventory problems where there are individual product setup costs and/or joint setup costs. We derive some basic properties of K-convex functions. We use the concept to derive the optimal policy in a deterministic case of two products with a joint setup cost. We conclude the paper with some suggestions for future research.
منابع مشابه
A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity
In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...
متن کاملOn difference sequence spaces defined by Orlicz functions without convexity
In this paper, we first define spaces of single difference sequences defined by a sequence of Orlicz functions without convexity and investigate their properties. Then we extend this idea to spaces of double sequences and present a new matrix theoretic approach construction of such double sequence spaces.
متن کاملQuadratic Convexity and Sums of Squares
Quadratic Convexity and Sums of Squares Martin Ames Harrison The length of a sum of squares σ in a ring R is the smallest natural k such that σ can be realized as a sum of k squares in R. For a set S ⊆ R, the pythagoras number of S, denoted by P(S), is the maximum value of length over all σ ∈ S. This dissertation is motivated by the following simple question: if R = R[x1, . . . , xn] and S = R[...
متن کاملFast Verification of Convexity of Piecewise-linear Surfaces
We show that a PL-realization of a closed connected manifold of dimension n − 1 in R (n ≥ 3) is the boundary of a convex polyhedron if and only if the interior of each (n− 3)-face has a point, which has a neighborhood lying on the boundary of a convex n-dimensional body. This result is derived from a generalization of Van Heijenoort’s theorem on locally convex manifolds to the spherical case. N...
متن کاملOn locally convex PL-manifolds and fast verification of convexity
We show that a PL-realization of a closed connected manifold of dimension n − 1 in R (n ≥ 3) is the boundary of a convex polyhedron if and only if the interior of each (n− 3)-face has a point, which has a neighborhood lying on the boundary of a convex n-dimensional body. This result is derived from a generalization of Van Heijenoort’s theorem on locally convex manifolds to the spherical case. O...
متن کامل