K.Sh. Mammadov, N.N. Mammadov.
Construction of a guaranteed suboptimal solution to an integer programming problem with one constraint according to the coefficients of the constraint condition
The concepts of guaranteed solution and guaranteed suboptimal solution according to the coefficients of constraint condition are given for an integer linear programming problem. Based on an economic interpretation of the problem, a method is developed to find a guaranteed suboptimal solution. An algorithm for this method is written and computational experiments are conducted.
Keywords: An integer programming problem with one constraint, Guaranteed solution and guaranteed suboptimalsolution according to thecoefficientsofthe constraint condition, Principle of dichotomy, Computational experiments
Construction of a guaranteed suboptimal solution to an integer programming problem with one constraint according to the coefficients of the constraint condition
The concepts of guaranteed solution and guaranteed suboptimal solution according to the coefficients of constraint condition are given for an integer linear programming problem. Based on an economic interpretation of the problem, a method is developed to find a guaranteed suboptimal solution. An algorithm for this method is written and computational experiments are conducted.
Keywords: An integer programming problem with one constraint, Guaranteed solution and guaranteed suboptimalsolution according to thecoefficientsofthe constraint condition, Principle of dichotomy, Computational experiments