Partially Smoothing and Gradient-Based Algorithm for Optimizing the VMI System with Competitive Retailers under Random Demands

2020 
Vendor managed inventory (VMI) is an improved sustainable inventory management system, but it is difficult to establish and solve an integrated Stackelberg game model under the complicated practical environment. In this paper, a bilevel programming model is proposed to formulate the VMI system by taking into account the uncertainty of demand, the competition among retailers, the cooperative advertising, the shortage and holding costs, and the practical constraints. For the established stochastic model being associated with continuously random demands, a deterministic mathematical program with complementarity constraints (MPCC) is first derived by expectation method and the first-order optimality conditions of the lower-level problem. Then, with a partially smoothing technique, the MPCC is solved by transforming it into a series of standard smooth optimization subproblems. Finally, owing to complexity caused by evaluating the integrals with unknown decision variables in the objective function, an efficient algorithm is developed to solve the problem based on the gradient information of model. Sensitivity analysis has been employed to reveal a number of managerial implications from the constructed model and algorithm. (1) The participation rate depends on advertising expenditures from both the manufacturer and the retailer. There exists an optimal threshold of participation rate for the manufacturer, which can be provided by the intersection point of the manufacturer and retailer’s cost-profit curves. (2) The manufacturer’s advertising policy is less sensitive to uncertainty of demand than the change of the retailer’s advertising policy. (3) The manufacturer in the VMI system should concern about the differences caused by symmetric or asymmetric retailers.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    46
    References
    1
    Citations
    NaN
    KQI
    []