This paper presents three algorithms for solving linear programming problems in which some or all of the objective function coefficients are specified in terms of intervals. Which algorithm is ...

The problem of applying Generalized Lagrange Multipliers (GLM) to 0-1 integer programming problems is investigated. It is shown that GLM can produce optimal solutions if and only if these solutions ...

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it. The traveling salesperson problem is one of the oldest ...