| 書目名稱 | Quasiconvex Optimization and Location Theory |
| 編輯 | Jaoquim António Santos Gromicho |
| 視頻video | http://file.papertrans.cn/782/781626/781626.mp4 |
| 叢書名稱 | Applied Optimization |
| 圖書封面 |  |
| 描述 | grams of which the objective is given by the ratio of a convex by a positive (over a convex domain) concave function. As observed by Sniedovich (Ref. [102, 103]) most of the properties of fractional pro- grams could be found in other programs, given that the objective function could be written as a particular composition of functions. He called this new field C- programming, standing for composite concave programming. In his seminal book on dynamic programming (Ref. [104]), Sniedovich shows how the study of such com- positions can help tackling non-separable dynamic programs that otherwise would defeat solution. Barros and Frenk (Ref. [9]) developed a cutting plane algorithm capable of optimizing C-programs. More recently, this algorithm has been used by Carrizosa and Plastria to solve a global optimization problem in facility location (Ref. [16]). The distinction between global optimization problems (Ref. [54]) and generalized convex problems can sometimes be hard to establish. That is exactly the reason why so much effort has been placed into finding an exhaustive classification of the different weak forms of convexity, establishing a new definition just to satisfy some desirable |
| 出版日期 | Book 19981st edition |
| 關(guān)鍵詞 | algorithms; classification; complexity; computation; derivative; derivatives; dynamic programming; Facility |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4613-3326-5 |
| isbn_softcover | 978-1-4613-3328-9 |
| isbn_ebook | 978-1-4613-3326-5Series ISSN 1384-6485 |
| issn_series | 1384-6485 |
| copyright | Kluwer Academic Publishers 1998 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 01:39
發(fā)表于 2025-3-21 17:59:15
