S.Y. HUSEYNOV
METHODS FOR SELECTING UNKNOWNS IN TWOS FOR CONSTRUCTING A SUBOPTIMAL SOLUTION TO INTEGER PROGRAMMING PROBLEMS
Two methods for constructing a suboptimal solution of integer programming problems are developed. The basic principle of these methods is the simultaneous selection and assignment of two unknowns. Such a selection being impossible, the criterion of selecting unknowns by one is applied. The numerous computational experiments again confirm the effectiveness of this approach.
Keywords: integer programming problem, geometrical representation, suboptimal solution, selection on unknowns by relative increment, computational experiments
METHODS FOR SELECTING UNKNOWNS IN TWOS FOR CONSTRUCTING A SUBOPTIMAL SOLUTION TO INTEGER PROGRAMMING PROBLEMS
Two methods for constructing a suboptimal solution of integer programming problems are developed. The basic principle of these methods is the simultaneous selection and assignment of two unknowns. Such a selection being impossible, the criterion of selecting unknowns by one is applied. The numerous computational experiments again confirm the effectiveness of this approach.
Keywords: integer programming problem, geometrical representation, suboptimal solution, selection on unknowns by relative increment, computational experiments