Introduction to Linear Optimization

线性优化简介

运筹学

原   价:
855
售   价:
684.00
优惠
平台大促 低至8折优惠
发货周期:国外库房发货,通常付款后3-5周到货!
作      者
出  版 社
出版时间
2024年01月29日
装      帧
平装
ISBN
9789811278730
复制
页      码
570 pp
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
The book presents a graduate level, rigorous, and self-contained introduction to linear optimization (LO), the presented topics being expressive abilities of LO; geometry of LO — structure of polyhedral sets, LO duality and its applications; traditional LO algorithms — primal and dual simplex methods, and network simplex method; polynomial time solvability of LO via ellipsoid algorithm; conic programming with emphasis on expressing abilities of second order and semidefinite optimization, and polynomial time primal-dual interior point algorithms for linear and semidefinite optimization.Key FeaturesLinear optimization has wide application in decision making, engineering, and data scienceThe author is a renowned expert on the topicSelf-contained with background information summarized in the appendicesRigorous presentation of all the essential but avoid heavy technical detail wherever possibleNovel approach or results: (1)presenting "calculus" of problems reducible to LO (something which traditionally is taught via a sample of instructive examples) including, in particular, the results on polynomial time reducibility of Conic Quadratic Optimization to LO; (2) Another novelty is in presenting the basic theory of contemporary extension of LO — Conic Programming, primarily, Conic Quadratic and Semidefinite Optimization, with emphasis on expressive abilities of these generic problems and on Conic Programming Duality; (3)In addition, we describe basic versions of polynomial time primal-dual path-following algorithms for LO and SDO and carry out rigorous complexity analysis of these algorithms
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个