Stochastic single period inventory decisions based on full quadratic cost functions
Padgett, Susan B.
Lindsay, Glenn F.
MetadataShow full item record
This study addresses a general class of decision situations whose solutions are directly applicable to inventory acquisitions and or disposals. Although optimal solutions are well known when subsequent costs are linear to the amount of surplus or shortage, the perhaps more realistic case of non-linear costs has not been extensively studied. The results of this study suggest the optimal solutions i.e., acquisition quantity or supply for both conditions of risk and uncertainty about demand when the associated cost function is non- linear, i.e., quadratic. For conditions of risk optimal solutions are found which will yield minimum expected costs for the two-piece cost function where surplus and shortage costs are quadratic. This is done for both discrete and continuous demand variable. When future need for the item is unknown and only the maximum value can be estimated, optimal solutions are obtained for goals of minimaxing cost, minimaxing regret, and the Laplace criteria using a uniform probability distribution. It is shown that these different approaches to determining acquisition quantities under conditions of uncertainty lead, for this general class of decision problems, to the same optimal result. Hopefully, this information will aid in the decision process while making affordability assessments of new acquisitions
Approved for public release; distribution unlimited.
Showing items related by title, author, creator and subject.
Guthrie, Katherine H. (Monterey, California: Naval Postgraduate School, 2017-06);A cascade heuristic appeals when we are faced with a monolithic optimization model exhibiting more decision variables and/or constraints than can be accommodated by computers and/or optimization software available. This ...
Smith, Douglas R. (Monterey, California. Naval Postgraduate School, 1980-02); NPS-52-80-004This paper investigates the conditions under which a discrete optimization problem can be formulated as a dynamic program. Following the terminology of (Karp and Held 1967), a discrete optimization problem is formalized ...
Kim, Kwang Bog (Monterey, California. Naval Postgraduate School, 1978-03);Decision makers are often confronted with problems for which there exist several distinct measures of success. Such problems can often be expressed in terms of linear or nonlinear programming models with several "criterion" ...