
doi: 10.1057/jors.2011.13
This study attempts to optimize the operations of the Recycling Fund Management Board (RFMB), founded by the Environmental Protection Administration of the R.O.C. Government (on Taiwan), through the decision of a subsidy rate for the domestic glass recycling industry. The hierarchical and interactive nature between the two parties is modelled by bi-level programming, where the RFMB plays the upper-level decision unit while the recycling industry is the lower-level counterpart. In order to solve the problem by optimization software, the bi-level formulation is transformed to a single-level problem via Karush-Kuhn-Tucker optimality conditions and is further transformed to a 0−1 mixed integer programming problem by variable substitution. The problem is solved with real-world data, and the obtained solutions are analysed and compared with the RFMB’s current operations. The results suggest that the proposed approach can improve the operations of the RFMB.
subsidy rate;recycling and treatment fee;0−1 mixed integer programming;KKT conditions, 650, bi-level programming problem;glass recycling industry
subsidy rate;recycling and treatment fee;0−1 mixed integer programming;KKT conditions, 650, bi-level programming problem;glass recycling industry
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
