90C06 Large-scale problems in mathematical programming90C15 Stochastic programmingThis paper proposes an algorithm to efficiently solve large optimization problems which exhibit a column bounded block-diagonal structure, where subproblems differ in right-hand side and cost coefficients. Similar problems are ...
The market was formulated as a bi-level optimization problem, where the upper-level market operator aimed to maximize social welfare by optimizing resource allocation, while lower-level individual community members made decisions based on preferences and constraints. The Karush–Kuhn–Tucker (KKT) ...
Benders decomposition (BD) algorithm is devised. Three effective strategies named: valid inequalities, multiple generation cuts and strong high density cut are also employed to improve the convergence of the proposed BD algorithm. The performance of the accelerated BD algorithm is validated via applying...
In comparison with forward supply chains that have uncertainties in customer demand, price [13] and resource capacity levels, RL operations are confronted with a higher degree of uncertainty, such as collection rates, availability of recycled production inputs, disposal, and recycling rates [14]. ...