In this paper, we deal with the bi-objective non-convex combined heat and power (CHP) planning problem. A medium and long term planning problem decomposes into thousands of single period (hourly) subproblems and dynamic constraints can usually be ignored in this context. The hourly subproblem...

This paper presents two new dynamic programming (DP) algorithms to find the exact Pareto frontier for the bi-objective integer knapsack problem. First, a property of the traditional DP algorithm for the multi-objective integer knapsack problem is identified. The first algorithm is developed by...

This paper addresses the unit commitment in multi-period combined heat and power (CHP) production planning, considering the possibility to trade power on the spot market. In CHP plants (units), generation of heat and power follows joint characteristics, which means that production planning for...

The paper addresses the unit commitment in multi-period combined heat and power (CHP) production planning under the deregulated power market. In CHP plants (units), generation of heat and power follows joint characteristics, which means that production planning must be done in coordination. We...