Theoretically, operational research generally refers to integer linear programming, unless otherwise specified. Integer linear programming models can be roughly divided into two categories:

1, when all variables are limited to integers, it is called pure (complete) integer programming.

2. If the variables are limited to integers, it is called mixed integer programming.

Classification of theoretical solutions:

(i) Branch-and-bound method-You can find pure integer or mixed integer linear programming.

(2) Cutting plane method-can find pure or mixed integer linear programming.

(3) implicit enumeration method-solving "0- 1" integer programming: ① filtering implicit enumeration method; ② Branch implicit enumeration method.

(4) Hungarian law solves the assignment problem (a special case of "0- 1" programming).

(v) Monte Carlo method-solving various types of planning.

Linprog function can be used for integer linear programming, which is explained in super detail in the help. bintprog function can be used for integer programming of 0- 1.