Abstract
We present an O( n 3) noniterative heuristic algorithm and describe an implementation of p-adic arithmetic to solve the linear programming problems error-free. An optimality test as well as numerical examples depict the scope of such an algorithm. In the few cases where it did not lead to the optimal solution, it did provide a nonnegative solution of the system A x = b , which could be used as the basic feasible solution for any one of the widely used simplex methods, say, the revised simplex algorithm without the need to include artificial variables in A x = b for consistency check. Thus the algorithm could be at least a pre-processor for any simplex algorithm and avoids the enhancement of dimensions of the constraint matrix A and consequent additional space, computational complexities, and errors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
