Lagrangian relaxation based algorithm for trigeneration planning with storages
From MaRDI portal
Publication:2469600
DOI10.1016/j.ejor.2007.04.008zbMath1135.90011OpenAlexW2008955944MaRDI QIDQ2469600
Aiying Rong, Risto Lahdelma, Peter B. Luh
Publication date: 6 February 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.04.008
Related Items (7)
An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning ⋮ A new mixed integer programming model for curriculum balancing: application to a Turkish university ⋮ Combined scheduling and capacity planning of electricity-based ammonia production to integrate renewable energies ⋮ An efficient two-stage algorithm for decentralized scheduling of micro-CHP units ⋮ Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound ⋮ Decentralized operation strategies for an integrated building energy system using a memetic algorithm ⋮ An efficient model and algorithm for the transmission-constrained multi-site combined heat and power system
Cites Work
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- 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 primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Using an interior point method for the master problem in a decomposition approach
- Joint planning of combined heat and power and electric power systems: An efficient model formulation
- The volume algorithm: Producing primal solutions with a subgradient method
- An efficient linear programming algorithm for combined heat and power production.
- An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning
- An efficient linear model and optimisation algorithm for multi-site combined heat and power production
- Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches
This page was built for publication: Lagrangian relaxation based algorithm for trigeneration planning with storages