Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A comparison of the primal-simplex and primal-dual algorithms for linear programming

A comparison of the primal-simplex and primal-dual algorithms for linear programming Tire above definilions are illustrated in the following example. COLUMN-COUNT = 2 f = 50 2 30 2 15 1 5 C4 tt~:we the minimum delta, test {heir (l ~sl> :~(m~is. Since all t h r e e eligib]e rows (2, 3 and 4) have {he minimum dashcount., selee, t any one of (}tem as (]k. COLUMN-COUNT = 4 f = 40 4 20 420 4 20 DASH-COUNT~ -- ml.....R2 C1 ma Y Y R4 N N Y ~C 130' 0 60 DELTA OASH-COUNT Y N Y N C2 C3 C1 lC2] C3 C4 Y Y Y Y N N N Y N 0 0 STEPS IN THE ALGORITi-i~f Y Y C5 - N " 160 4- Step 1. Same as for Algorithm 1. Step 2. Determine those rows that have a minimum weighted dash-count. Step 3. If two or more rows have a minimum WDC, select fi'om among them the row that has the minimum delta. If among these there still exists t.wo or more rows, select the row with the minimum dash-count. If there are more than two such rows, select any one of them. The test on dash-count does not affect computer running time, but http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

A comparison of the primal-simplex and primal-dual algorithms for linear programming

Communications of the ACM , Volume 8 (11) – Nov 1, 1965

Loading next page...
 
/lp/association-for-computing-machinery/a-comparison-of-the-primal-simplex-and-primal-dual-algorithms-for-DRgqFnqpEJ

References (5)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1965 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/365660.365682
Publisher site
See Article on Publisher Site

Abstract

Tire above definilions are illustrated in the following example. COLUMN-COUNT = 2 f = 50 2 30 2 15 1 5 C4 tt~:we the minimum delta, test {heir (l ~sl> :~(m~is. Since all t h r e e eligib]e rows (2, 3 and 4) have {he minimum dashcount., selee, t any one of (}tem as (]k. COLUMN-COUNT = 4 f = 40 4 20 420 4 20 DASH-COUNT~ -- ml.....R2 C1 ma Y Y R4 N N Y ~C 130' 0 60 DELTA OASH-COUNT Y N Y N C2 C3 C1 lC2] C3 C4 Y Y Y Y N N N Y N 0 0 STEPS IN THE ALGORITi-i~f Y Y C5 - N " 160 4- Step 1. Same as for Algorithm 1. Step 2. Determine those rows that have a minimum weighted dash-count. Step 3. If two or more rows have a minimum WDC, select fi'om among them the row that has the minimum delta. If among these there still exists t.wo or more rows, select the row with the minimum dash-count. If there are more than two such rows, select any one of them. The test on dash-count does not affect computer running time, but

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Nov 1, 1965

There are no references for this article.