Large-scale unit commitment under uncertainty
From MaRDI portal
Publication:2351161
DOI10.1007/s10288-014-0279-yzbMath1321.90007OpenAlexW2082322377WikidataQ64026055 ScholiaQ64026055MaRDI QIDQ2351161
Wim van Ackooij, Fabrizio Lacalandra, Milad Tahanan, Antonio Frangioni
Publication date: 23 June 2015
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-014-0279-y
Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Production models (90B30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Decomposition algorithm for large-scale two-stage unit-commitment, Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, The min-up/min-down unit commitment polytope, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Strategic bidding in price coupled regions, Probabilistic optimization via approximate \(p\)-efficient points and bundle methods, Uncontrolled inexact information within bundle methods, A multiplicative weights update algorithm for MINLP, A comparison of four approaches from stochastic programming for large-scale unit-commitment, A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints, A polynomial-time algorithm with tight error bounds for single-period unit commitment problem, Incremental Bundle Methods using Upper Models, Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies, Large-scale unit commitment under uncertainty: an updated literature survey, Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages, Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment, Asynchronous Lagrangian scenario decomposition, A strongly convergent proximal bundle method for convex minimization in Hilbert spaces, Optimizing power generation in the presence of micro-grids, QPLIB: a library of quadratic programming instances, Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley, Flow-based formulations for operational fixed interval scheduling problems with random delays, Regularized decomposition of large scale block-structured robust optimization problems, 4OR comes of age. Editorial note, Preface, Ergodic approach to robust optimization and infinite programming problems, Tight MIP formulations of the power-based unit commitment problem, Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization, Demand response versus storage flexibility in energy: multi-objective programming considerations, Revisiting augmented Lagrangian duals, Operations research in optimal power flow: a guide to recent and emerging methodologies and applications, Optimization and sustainable development, Nonlinear chance-constrained problems with applications to hydro scheduling, Stochastic Lipschitz dynamic programming, Approximated perspective relaxations: a project and lift approach
Uses Software
Cites Work
- Primal-dual subgradient methods for convex problems
- Decomposition algorithm for large-scale two-stage unit-commitment
- Robust production management
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Complementarity modeling in energy markets
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment
- Optimizing financial and physical assets with chance-constrained programming in the electrical industry
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Tractable stochastic analysis in high dimensions via robust optimization
- Divide to conquer: decomposition methods for energy optimization
- Auxiliary problem principle and decomposition of optimization problems
- About Lagrangian methods in integer optimization
- Non-convex power plant modelling in energy optimisation
- Scenario reduction in stochastic programming with respect to discrepancy distances
- Oligopoly models for market price of electricity under demand uncertainty and unit reliability
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
- On probabilistic constraints induced by rectangular sets and multivariate normal distributions
- Decision making under uncertainty in electricity markets
- Discrepancy distances and scenario reduction in two-stage stochastic mixed-integer programming
- Two ``well-known properties of subgradient optimization
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- On improvements to the analytic center cutting plane method
- Robust solutions of uncertain linear programs
- Distribution sensitivity for certain classes of chance-constrained models with application to power dispatch
- Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
- Decomposition methods in stochastic programming
- The volume algorithm revisited: relation with bundle methods
- Scenario reduction in stochastic programming
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- The volume algorithm: Producing primal solutions with a subgradient method
- Solving the unit commitment problem by a unit decommitment method
- Robust solutions of linear programming problems contaminated with uncertain data
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Uncertain convex programs: randomized solutions and confidence levels
- Stochastic linear programming. Models, theory, and computation
- Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case
- An oligopolistic investment model of the Finnish electricity market
- A hybrid neural network and simulated annealing approach to the unit commitment problem
- A two-stage planning model for power scheduling in a hydro-thermal system under uncertainty
- Scenario reduction algorithms in stochastic programming
- Lagrangean relaxation. (With comments and rejoinder).
- Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints
- Optimal capacity allocation in multi-auction electricity markets under uncertainty
- New variants of bundle methods
- A new optimal electricity market bid model solved through perspective cuts
- Piecewise linear approximation of functions of two variables in MILP models
- Scenario tree reduction for multistage stochastic programs
- Joint chance constrained programming for hydro reservoir management
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A decomposition approach to the two-stage stochastic unit commitment problem
- Short-term hydropower production planning by stochastic programming
- Comparison of bundle and classical column generation
- A two-stage stochastic programming model for electric energy producers
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Unit commitment in electricity pool markets
- On a primal-proximal heuristic in discrete optimization
- A primal-proximal heuristic applied to the French unit-commitment problem
- Prices stabilization for inexact unit-commitment problems
- Robust Convex Optimization
- Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- A Gradient Formula for Linear Chance Constraints Under Gaussian Distribution
- Level bundle methods for oracles with on-demand accuracy
- Two-stage robust optimization, state-space representable uncertainty and applications
- Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
- Large Scale Integration of Wind Power Generation
- Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning
- Co-Optimization of Energy and Ancillary Service Markets
- Recent Developments in Optimal Power Flow Modeling Techniques
- Algorithms for Finding Optimal Flows in Dynamic Networks
- Short-term Forecasting in Power Systems: A Guided Tour
- State-of-the-Art of Electricity Price Forecasting in a Grid Environment
- Stochastic Optimization of Electricity Portfolios: Scenario Tree Modeling and Risk Management
- The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- A Soft Robust Model for Optimization Under Ambiguity
- Theory and Applications of Robust Optimization
- Linear programming with interval coefficients
- Nested Benders decomposition and dynamic programming for reservoir optimisation
- On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Piecewise-quadratic Approximations in Convex Numerical Optimization
- Decomposition Principle for Linear Programs
- The Cutting-Plane Method for Solving Convex Programs
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- A Robust Optimization Perspective on Stochastic Programming
- Robust mid-term power generation management
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Linear Programming Approach to Approximate Dynamic Programming
- The Price of Robustness
- Lectures on Stochastic Programming
- Light Robustness
- Optimal short-term scheduling of large-scale power systems
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
- Optimal scheduling of thermal generating units
- Robust Solutions to Uncertain Semidefinite Programs
- Introduction to Stochastic Programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Numerical solution technique for joint chance-constrained programming problem —An application to electric power capacity expansion
- Scenario Tree Generation for Multi-stage Stochastic Programs
- Stochastic unit commitment problem
- Generalized Bundle Methods
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- Reliable Decentralized Supervisors for Discrete‐Event Systems Under Communication Delays: Existence and Verification
- Convex Approximations of Chance Constrained Programs
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Optimal Offer Construction in Electricity Markets
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
- Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
