文章目录
includes：
1、 theory and algorithms
2、 mathematical analysis, theorem
proving, algorithm design and numerical
methods
Prerequisites：
- Matrix Theory
- Linear Algebra
- Introduction to OR（OR建模）
一、What is Linear Programming?
Optimize a linear objective function of
decision variables subject to a set of linear constraints。
example：
二、Why to study Linear programming?
Passage to advanced subjects:
- Nonlinear Programming
- Network Flows
- Integer Programming
- Conic Programming
- Semidefinite Programming
- Robust Optimization
三、How to study Linear Programming?
- geometric intuition
- algebraic manipulation
- computer programming
四、History of Linear Programming
五、How to solve an LP problem?
此处的feasible domain=convex polyhedral set凸多边形
1、枚举法no
2、简单的方法no
3、no
类似二分法，如果检测到顶点在E1的左半球，在E1左边画出E2，E2的体积缩小一半，如果检测到顶点在E2的下面，就在E2下面画出E3，E3的体积缩小一半。
4、yes
of course yes