Classification of integer linear programming models;
If I = {0, 1}, J = {1, …, n}, that is, all decision variables only take 0 or 1, it is called 0- 1 planning;
If J is a nonempty proper subset of {1, 2…n}, that is, only some decision variables need integers, it is called mixed integer linear programming;
If J={ 1, 2, …n}, that is, all decision variables take integers, it is called pure integer linear programming;
http://202 . 204 . 1 15.67:8080/files/files _ upload/content/material _ 227/chap _ HVj/33605 . PPT