This paper studies a nonstationary inventory and pricing problem. We consider a two-echelon supply chain with one supplier and two retailers, in which the supplier carries all inventory to supply the retailers. Both the reserved and pooled inventory systems are analyzed. Results with normally...

This paper studies a nonstationary inventory and pricing problem. We consider a two-echelon supply chain with one supplier and two retailers, in which the supplier carries all inventory to supply the retailers. Both the reserved and pooled inventory systems are analyzed. Results with normally...

We consider a single-period distribution system with one supplier and two retailers. The supplier may have infinite or finite capacity. The demand at each retailer is random. When a stockout occurs at one retailer the customer may go to the other retailer. We study both the decentralized and...

In this paper, an interior-point based global filtering algorithm is proposed to solve linear programming problems with the right-hand-side and cost vectors being stochastic. Previous results on the limiting properties of the Kalman filtering process have been extended to handle some...

Univariate cubic L 1 splines provide C 1 -smooth, shape-preserving interpolation of arbitrary data, including data with abrupt changes in spacing and magnitude. The minimization principle for univariate cubic L 1 splines results in a nondifferentiable convex optimization problem. In order to...

Univariate cubic L <Subscript>1</Subscript> splines provide C <Superscript>1</Superscript>-smooth, shape-preserving interpolation of arbitrary data, including data with abrupt changes in spacing and magnitude. The minimization principle for univariate cubic L <Subscript>1</Subscript> splines results in a nondifferentiable convex optimization problem. In order to...</subscript></superscript></subscript>

Consider a min-max problem in the form of min<Subscript> xεX </Subscript>max<Subscript>1≤i≤m </Subscript>{f <Subscript> i </Subscript>(x)}. It is well-known that the non-differentiability of the max functionF(x) ≡ max<Subscript>1≤i≤m </Subscript>{f <Subscript> i </Subscript>(x)} presents difficulty in finding an optimal solution. An entropic regularization procedure provides a smooth...</subscript></subscript></subscript></subscript></subscript>

A quadratic optimization problem with one nonconvex quadratic constraint is studied using the canonical dual approach. Under the dual Slater's condition, we show that the canonical dual has a smooth concave objective function over a convex feasible domain, and this dual has a finite supremum...