Access the full text.
Sign up today, get DeepDyve free for 14 days.
N. Padhy (2004)
Unit commitment-a bibliographical surveyIEEE Transactions on Power Systems, 19
J. Arroyo, A. Conejo (2000)
Optimal response of a thermal unit to an electricity spot marketIEEE Transactions on Power Systems, 15
D. Rajan, S. Takriti (2005)
IBM Research Report Minimum Up/Down Polytopes of the Unit Commitment Problem with Start-Up Costs
A. Frangioni, C. Gentile, Fabrizio Lacalandra (2009)
Tighter Approximated MILP Formulations for Unit Commitment ProblemsIEEE Transactions on Power Systems, 24
M. Duran, I. Grossmann (1986)
An outer-approximation algorithm for a class of mixed-integer nonlinear programsMathematical Programming, 36
A. Grey, A. Sekar (2008)
Unified solution of security-constrained unit commitment problem using a linear programming methodologyIet Generation Transmission & Distribution, 2
D. Rajan, S. Takriti (2005)
Minimum up/down polytopes of the unit commitment problem with start‐up costs
Jing Wang, M. Shahidehpour, Zuyi Li (2009)
Contingency-Constrained Reserve Requirements in Joint Energy and Ancillary Services AuctionIEEE Transactions on Power Systems, 24
Michael Pinedo (2008)
Planning and Scheduling in Manufacturing and Services
J. Lyu, Mun-Kyeom Kim, Y. Yoon, Ju-won Park (2012)
A new approach to security-constrained generation scheduling of large-scale power systems with a piecewise linear ramping modelInternational Journal of Electrical Power & Energy Systems, 34
Cong Liu, M. Shahidehpour, Jianhui Wang (2010)
Application of augmented lagrangian relaxation to coordinated scheduling of interdependent hydrothermal power and natural gas systemsIet Generation Transmission & Distribution, 4
E. Balas (1979)
Disjunctive programming, 5
P. Bonami, M. Kilinc, J. Linderoth (2011)
Mixed integer nonlinear programming. Series: the IMA volumes in mathematics and its applications
J. Hooker (2000)
Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction
M. Shafie‐khah, M. Moghaddam, M. Sheikh‐El‐Eslami (2011)
Unified solution of a non-convex SCUC problem using combination of modified Branch-and-Bound method with Quadratic ProgrammingEnergy Conversion and Management, 52
N. Beaumont (1990)
An algorithm for disjunctive programsEuropean Journal of Operational Research, 48
Pierre Bonami, Mustafa Kilinç, Jeff Linderoth (2012)
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
Xiaoqing Bai, Hua Wei (2009)
Semi-definite programming-based method for security-constrained unit commitment with operational and optimal power flow constraintsIet Generation Transmission & Distribution, 3
R. Raman, I. Grossmann (1994)
Modelling and computational techniques for logic based integer programmingComputers & Chemical Engineering, 18
K. Chandrasekaran, S. Simon (2011)
Demand response scheduling in SCUC problem for solar integrated thermal system using firefly algorithm
H. Daneshi, A. Srivastava (2012)
Security-constrained unit commitment with wind generation and compressed air energy storageIet Generation Transmission & Distribution, 6
Robert Stubbs, Sanjay Mehrotra (1999)
A branch-and-cut method for 0-1 mixed convex programmingMathematical Programming, 86
Jon Lee, S. Leyffer (2011)
Mixed Integer Nonlinear ProgrammingIbm Journal of Research and Development
M. Carrión, J. Arroyo (2006)
A computationally efficient mixed-integer linear formulation for the thermal unit commitment problemIEEE Transactions on Power Systems, 21
Sebastián Ceria, J. Soares (1999)
Convex programming for disjunctive convex optimizationMathematical Programming, 86
M. Turkay, I.E. Grossmann (1996)
A logic‐based outer‐approximation algorithm for MINLP optimization of process flowsheets, 20
E. Balas (1998)
Disjunctive Programming: Properties of the Convex Hull of Feasible PointsDiscret. Appl. Math., 89
M. Shahidehpour, H. Yamin, Zuyi Li (2002)
Market operations in electric power systems
(2011)
GAMS Development Corporation
IET Generation, Transmission & Distribution – Wiley
Published: Nov 1, 2013
Keywords: ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ;
You can share this free article with as many people as you like with the url below! We hope you enjoy this feature!
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.