
运筹学
Operations Research
Wayne L. Winston · 初版 1987 年
3人推荐
4位读者提及
4次提及
本书旨在作为运筹学(operations research)、管理科学(management science)或数学规划(mathematical programming)领域的高级初阶或中阶教材。
Hacker News 上怎么说
正在加载完整评论……

Operations Research
Wayne L. Winston · 初版 1987 年
本书旨在作为运筹学(operations research)、管理科学(management science)或数学规划(mathematical programming)领域的高级初阶或中阶教材。
正在加载完整评论……
……好用的搜索关键词包括 "management science"(管理科学)、"operational research"(运筹学,英式)、"advanced analytics"(高级分析),当然还有 "optimi(s||z)ation"(最优化)。如果你想要一本入门教材,我推荐韦恩·温斯顿的《运筹学:应用与算法》(Operations Research: Applications and Algorithms),第 4 版,ISBN-13: 978-0534380588。
…useful search terms include "management science", "operational research" (UK), "advanced analytics", and of course "optimi(s||z)ation". If you're after an introductory text I can recommend Wayne Winston's Operations Research: Applications and Algorithms. 4th edition. ISBN-13: 978-0534380588
听起来你找的更偏优化理论,但如果你想要一本数学平易近人、包含大量实例的应用向温和入门书,我强烈推荐韦恩·温斯顿的《运筹学:应用与算法(第 4 版)》。这是一本很扎实的本科教材,涵盖了基础线性优化、混合整数线性规划以及非线性优化。
Sounds like you're looking more for optimization theory, but if you want a gentle introduction to applications with approachable math and lots of examples, I highly recommend "Operations Research: Applications and Algorithms (4E)" by Wayne Winston. It's a solid undergrad level text covering basic linear optimization, mixed integer linear programs, and non-linear optimization.
据我所知,温斯顿的《运筹学:应用与算法》是这个领域的权威教材。网上随便搜搜就能找到老版本。
Winston's "Operations Research: Applications and Algorithms" is the authority so far as I can tell. Trivial to find old editions online.
……在做经典的梯度下降时,梯度方向能带来函数值的最大降幅。本质上这只是为了强调背后的微积分原理。韦恩·温斯顿在他的《运筹学:应用与算法》一书中有一段很有意思的论述,讨论了梯度是增长最快的方向(当时他看的是最速上升)。
…performing the classic gradient descent, the gradient will yield the greatest reduction in the function value. Essentially it was a point to highlight the underlying calculus. Wayne Winston in his book Operations Research: Applications and Algorithms has an interesting passage where he discusses the gradient being the direction of maximum increase (he was looking as steepest ascent).