A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A fundamental problem in linear inequalities with applications to the travelling salesman problem
1972
Mathematical programming
We consider a system of m linearly independent equality constraints in n nonnegative vari- The fundamental problem that we discuss is the following: suppose we are given a set of r linearly independent column vectors of A, known as the special column vectors. The problem is to develop an efficient algorithm to determine whether there exists a feasible basis which contains all the special column vectors as basic column vectors and to find such a basis if one exists. Such an algorithm has several
doi:10.1007/bf01584550
fatcat:bjmpi3ramfcwlblnkp2aackese