.png){kind=icon}
.png){kind=icon}
Return
Bi-level programming problem in the supply chain and its solution algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-019-03930-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Enterprise-wide supply chain planning problems naturally exhibit a multi-level decision network structure, where the upper level of a hierarchy may have his objective function and decision space partly determined by other levels. In addition, each planner's control instruments may allow him to influence the policies at other levels and thereby to improve his own objective function. As a tool, bi-level programming is applied for modeling decentralized decisions in which two decision makers make decisions successively. In this paper, we specifically address bi-level decision-making problems with budget constraint as an attractive feature in the context of enterprise-wide supply chain. We first describe the typical bi-level linear programming problem (BLLPP) and its optimal solution to the penalty function problem, and then, a cooperative decision-making problem in supply chain is modeled as BLLPP. A particle swarm optimization-based computational algorithm is designed to solve the problem, and the numerical example is presented to illustrate the proposed framework.
Keywords:
Decentralized supply chain
Bi-level linear programming
Budget constraint
Particle swarm optimization algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.