---

＜電子ブック＞
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization / by Stefan Rocktäschel
(BestMasters. ISSN:26253615)

版	1st ed. 2020.
出版者	(Wiesbaden : Springer Fachmedien Wiesbaden : Imprint: Springer Spektrum)
出版年	2020
本文言語	英語
大きさ	VIII, 70 p. 15 illus : online resource
著者標目	*Rocktäschel, Stefan author SpringerLink (Online service)
件　名	LCSH:Mathematics LCSH:Mathematics -- Data processing  全ての件名で検索 FREE:Applications of Mathematics FREE:Computational Mathematics and Numerical Analysis
一般注記	Theoretical basics for solving multiobjective mixed-integer convex optimization problems -- An algorithm for solving this class of optimization problems -- Test instances and numerical results Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances. Contents Theoretical basics for solving multiobjective mixed-integer convex optimization problems An algorithm for solving this class of optimization problems Test instances and numerical results Target Groups Students and Lecturers in the field of mathematics and economics Practitioners in the field of multiobjective mixed-integer convex optimization problems The Author Stefan Rocktäschel works as scientific assistant at the Institute forMathematics of Technische Universität Ilmenau, Germany HTTP:URL=https://doi.org/10.1007/978-3-658-29149-5

 類似資料