In this technical note we give a short proof based on standard results in convex analysis of some important characterization results listed in Theorem 3 and 4 of [1]. Actually our result is slightly general since we do not specify the convex set X. For clarity we use the same notation for the...

In this paper we will discuss a general framework for single item inventory models based on the theory of regenerative processes. After presenting without proof the main theorems for regenerative processes we analyze in detail how the different single item models can be embedded within this...

In this paper we discuss a general framework for single item inventory control models. This framework is based on the regenerative structure of these models. Using results from the theory of regenerative processes a unified presentation of those models is presented. Although most of the results...

We propose in this paper an algorithm for solving linearly constrained nondifferentiable convex programming problems. This algorithm combines the ideas of the affine scaling method with the subgradient method. It is a generalization of the dual and interior point method for min-max problems...

In this note we give an elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints.The proof avoids the implicit function theorem usually applied when dealing with equality constraints and...