1. OR-1 20151 Integer Programming ( 정수계획법 )

2. OR-1 20152

3. 3

4. 4

5. 5

6. 6

7.  Nonlinear Objective functions May approximate a nonlinear objective function by a continuous piecewise linear objective function. OR-1 20157 x

8. 8

9. 9

10. 10

11. OR-1 201511

12. Models with many constraints OR-1 201512

13. OR-1 201513

14. OR-1 201514  Integer programming significantly increases the modeling capability, but usually takes much more time to solve than linear programming. Theoretically, it is generally believed that there does not exist a polynomial time algorithm to solve general integer programming problems. However, recent advances in theory and software, combined with powerful computers makes it possible to solve many real world problems using integer programming.