Abstract
This chapter introduces some mathematical algorithms for solving interval linear equations, interval nonlinear equations, interval nonlinear equations and interval robust optimization models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Guessous N, Souhar O (2004) Recursive two-level ILU preconditioner for nonsymmetric M-matrices. J Appl Math Comput 16(1–2):19–35
Cui X, Hayami K (2009) Generalized approximate inverse preconditioners for least squares problems. Jpn J Ind Appl Math 26(1):1–14
Griffel DH (2002) Applied functional analysis. G. P. C. Press, Canada
Al-Khayyal FA, Larsen C, Van Voorhis T (1995) A relaxation method for nonconvex quadratically constrained quadratic programs. J Global Optim 6(3):215–230
Androulakis IP, Maranas CD, Floudas CA (1995) αBB: a global optimization method for general constrained nonconvex problems. J Global Optim 7(4):337–363
Maranas CD, Floudas CA (1995) Finding all solutions of nonlinearly constrained systems of equations. J Global Optim 7(2):143–182
Raber U (1998) A simplicial branch-and-bound method for solving nonconvex all-quadratic programs. J Global Optim 13(4):417–432
Linderoth J (2005) A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math Program 103(2):251–282
Floudas CA, Pardalos PM, Nahapetyan AG (2009) Bilinear programming. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization. Springer, US, pp 279–282
Shapiro JF (1984) A note on node aggregation and Benders’ decomposition. Math Program 29(1):113–119
Henry J, Yvon J, Lahdelma R et al (1994) A modified benders’ decomposition technique for solving large scale unit commitment problems. In: Henry J, Yvon J (eds) System modelling and optimization. Springer, Berlin, pp 737–745
Floudas CA, Pardalos PM, Floudas CA (2001) Generalized benders decomposition. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization. Springer, US, pp 747–758
Gass SI, Fu MC (2013) Benders decomposition method. In: Gass SI, Fu MC (eds) Encyclopedia of operations research and management science. Springer, US, p 115
Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper Res Lett 41(5):457–461
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media Singapore
About this chapter
Cite this chapter
Ding, T. (2017). Mathematics for Interval Algebra and Optimization. In: Power System Operation with Large Scale Stochastic Wind Power Integration. Springer Theses. Springer, Singapore. https://doi.org/10.1007/978-981-10-2561-7_2
Download citation
DOI: https://doi.org/10.1007/978-981-10-2561-7_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-2560-0
Online ISBN: 978-981-10-2561-7
eBook Packages: EnergyEnergy (R0)