Concentration profile for product

Discrete optimization problems involve discrete decision variables. Discrete optimization problems can be classified as integer programming (IP) problems, mixed integer linear programming (MILP), and mixed integer nonlinear programming (MINLP) problems. [Pg.75]

The commonly used mathematical programming method for solving IP, MILP, and MINLP is the branch and bound method which uses a tree structure to define the problem and the associated binary variables. The following example shows the tree structure for the problem. [Pg.75]

Example 5.3 Given a mixture of four components A, B, C, D for which separation technologies given in Table 5.1 are to be considered. [Pg.75]