Data visibility, sourcing flexibility, and pricing decisions in supply chains
本文研究了考虑采购信息可见性和采购灵活性的供应链规划问题，提出了一个几何指标来衡量采购可见性，并设计了一种外逼近算法来求解优化模型，实验表明该算法在解质量和计算时间上具有优势。
This article extends the supply chain planning problem under risk by including the visibility of purchasing information and sourcing flexibility. A novel geometric index is developed to measure purchasing visibility by including different attributes of the required data visibility level. The problem is formulated as a mixed integer non-linear optimisation model. We tailor an outer approximation (OA) algorithm as a decomposition-based algorithm to solve the resultant mathematical model. Our research experiments indicate how the basic OA algorithm could be applied in the non-convex models by utilising a reformulation-linearisation technique and a convexification scheme. Moreover, the superiority of our proposed OA algorithm is shown in terms of solution quality and CPU time.