An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning

DOI10.1016/j.ejor.2006.09.072zbMath1127.90344OpenAlexW2017014148MaRDI QIDQ2370363

Aiying Rong, Risto Lahdelma

Publication date: 25 June 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.072

zbMATH Keywords

branch-and-boundmixed integer programmingenvelopecombined heat and power productionenergy optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30)

Related Items (9)

An improved unit decommitment algorithm for combined heat and power systems ⋮ Application of the stochastic fractal search algorithm and compromise programming to combined heat and power economic–emission dispatch ⋮ An efficient two-stage algorithm for decentralized scheduling of micro-CHP units ⋮ Operational planning of combined heat and power plants through genetic algorithms for mixed 0-1 nonlinear programming ⋮ Study of wind‐solar based combined heat and power economic dispatch problem using quasi‐oppositional‐based whale optimization technique ⋮ Decentralized operation strategies for an integrated building energy system using a memetic algorithm ⋮ A variant of the dynamic programming algorithm for unit commitment of combined heat and power systems ⋮ Lagrangian relaxation based algorithm for trigeneration planning with storages ⋮ An efficient model and algorithm for the transmission-constrained multi-site combined heat and power system

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Non-convex power plant modelling in energy optimisation
• Efficient algorithms for combined heat and power production planning under the deregulated electricity market
• \(\text{CO}_{2} \) emissions trading planning in combined heat and power production via multi-period stochastic optimization
• A scheduling model for the daily operation of an electric power system
• Joint planning of combined heat and power and electric power systems: An efficient model formulation
• An efficient linear programming algorithm for combined heat and power production.
• Lagrangian relaxation based algorithm for trigeneration planning with storages
• An efficient linear model and optimisation algorithm for multi-site combined heat and power production
• An Automatic Method of Solving Discrete Programming Problems
• Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
• A Computational Study of Search Strategies for Mixed Integer Programming
• An Algorithm for the Traveling Salesman Problem
• On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions

This page was built for publication: An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning