This study considers pricing policies in a supply chain with one manufacturer, who sells a product to an independent retailer and directly to consumers through an Internet channel. In addition to the manufacturer’s product, the retailer sells a substitute product produced by another...

It is co-NP-complete to decide whether a given matrix is copositive or not. In this paper, this decision problem is transformed into a quadratic programming problem, which can be approximated by solving a sequence of linear conic programming problems defined on the dual cone of the cone of...

The advancement of Internet technology has enabled new formats for selling products in the B2C online auctions. At present, on the major online auction sites, there exist three popular selling formats, namely, the posted price, pure auction and buy-price auction formats. It is an important...

This paper provides a canonical dual approach for minimizing a general quadratic function over a set of linear constraints. We first perturb the feasible domain by a quadratic constraint, and then solve a “restricted” canonical dual program of the perturbed problem at each iteration to...

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...

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...

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