A Robust Pricing/Lot-sizing Model and A Solution Method Based on Geometric Programming

초록

The pricing/lot-sizing problem of determining the robust optimal order quantity and selling price is discussed. The uncertainty of parameters characterized by an ellipsoid is explicitly incorporated into the problem. An approximation scheme is proposed to transform the problem into a geometric pro-gram, which can be efficiently and reliably solved using interior-point methods.

키워드