清华大学-最优化理论与算法-ppt.rar

[{"title":"（ 18 个子文件 9.58MB ） 清华大学-最优化理论与算法-ppt.rar","children":[{"title":"清华大学-最优化理论与算法-ppt","children":[{"title":"第三章 单纯形法.ppt <span style='color:#111;'> 1.74MB </span>","children":null,"spread":false},{"title":"第九章 一维搜索.ppt <span style='color:#111;'> 973.50KB </span>","children":null,"spread":false},{"title":"第十二章 可行方向法.ppt <span style='color:#111;'> 1.09MB </span>","children":null,"spread":false},{"title":"第十五章 整数规划.ppt <span style='color:#111;'> 806.50KB </span>","children":null,"spread":false},{"title":"第一章 绪论.ppt <span style='color:#111;'> 1.38MB </span>","children":null,"spread":false},{"title":"第一章 凸集分离定理.ppt <span style='color:#111;'> 547.50KB </span>","children":null,"spread":false},{"title":"第八章 算法.ppt <span style='color:#111;'> 404.50KB </span>","children":null,"spread":false},{"title":"第十四章 二次规划.ppt <span style='color:#111;'> 1.01MB </span>","children":null,"spread":false},{"title":"第十章 使用导数的最优化方法.ppt <span style='color:#111;'> 1.24MB </span>","children":null,"spread":false},{"title":"第十三章 惩罚函数法.ppt <span style='color:#111;'> 965.50KB </span>","children":null,"spread":false},{"title":"第七章 最优性条件.ppt <span style='color:#111;'> 1.88MB </span>","children":null,"spread":false},{"title":"第四章 对偶理论.ppt <span style='color:#111;'> 1.92MB </span>","children":null,"spread":false},{"title":"第四章 灵敏度分析.ppt <span style='color:#111;'> 728.00KB </span>","children":null,"spread":false},{"title":"总复习.ppt <span style='color:#111;'> 765.00KB </span>","children":null,"spread":false},{"title":"第二章 线性规划基本性质.ppt <span style='color:#111;'> 1.42MB </span>","children":null,"spread":false},{"title":"第十章 使用导数的最优化方法 - 副本.ppt <span style='color:#111;'> 1.24MB </span>","children":null,"spread":false},{"title":"第五章 目标规划.ppt <span style='color:#111;'> 1.02MB </span>","children":null,"spread":false},{"title":"第六章 计算复杂性.ppt <span style='color:#111;'> 905.50KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]