Based on the convex simplex method for nonlinear programming, a sensitivity analysis of consumption coefficient matrix in linear fractional programming is presented.

The optimization problem can be solved based on the density-stiffness interpolation scheme and the method of moving asymptotes belonging to sequential convex programming approaches.

In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.