ACM

Communications of the ACM

Home/Magazine Archive/November 1966 (Vol. 9, No. 11)/Techniques for automatic tolerance control in linear.../Abstract

Techniques for automatic tolerance control in linear programming

By R. J. Clasen
Communications of the ACM, November 1966, Vol. 9 No. 11, Pages 802-803
10.1145/365876.365909
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

In this technical note, the numerical steps for the simplex method of linear programming are reviewed and the tolerances needed in the numerical procedure are defined. Objective criteria are given for accomplishing the numerical steps of the method and the calculation of necessary tolerances.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.