SOLVING EXTREMUM PROBLEMS WITH LINEAR FRACTIONAL OBJECTIVE FUNCTIONS ON THE COMBINATORIAL CONFIGURATION OF PERMUTATIONS UNDER MULTICRITERIALITY

摘要

The authors consider the extremum optimization problem with linear fractional objective functions on combinatorial configuration of permutations under multicriteria condition. Solution methods for linear fractional problems are analyzed to choose the approach to problem's solution. A solution technique based on graph theory is proposed. The algorithm of the modified coordinate method's subprogram with search optimization is described. It forms a set of points that satisfy additional constraints of the problem. The general solution algorithm without linearization of the objective function and it's block diagram are proposed. Examples of the algorithm are described.