TY - GEN
T1 - A robust pricing/lot-sizing model and a solution method based on geometric programming
AU - Lim, Sungmook
AU - Kim, Woo Je
PY - 2008
Y1 - 2008
N2 - 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 program, which can be efficiently and reliably solved using interior-point methods.
AB - 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 program, which can be efficiently and reliably solved using interior-point methods.
UR - http://www.scopus.com/inward/record.url?scp=54849426868&partnerID=8YFLogxK
U2 - 10.1109/INDIN.2008.4618213
DO - 10.1109/INDIN.2008.4618213
M3 - Conference contribution
AN - SCOPUS:54849426868
SN - 9781424421718
T3 - IEEE International Conference on Industrial Informatics (INDIN)
SP - 808
EP - 811
BT - Proceedings - IEEE INDIN 2008
T2 - IEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics
Y2 - 13 July 2008 through 16 July 2008
ER -