Name
Abstract | ||
|---|---|---|
A simplex type algorithm is presented which deals uniformly with (a) ordinary linear programming problems, (b) problems with upper bounded variables, and (c) problems with convex piecewise linear objective functions, e.g., absolute value terms. Problems of types (b) and (c) can be solved by suitable transformations into ordinary linear programming forms, but are handled by the unified algorithm without such transformations. Comparative computer runs indicate that direct solution by the unified algorithm is considerably more efficient than conversion into ordinary linear programming form followed by use of a regular simplex routine. Computer tests also show that the algorithm offers a worthwhile alternative to the use of artificial variables as a starting procedure for ordinary linear programming problems. |
Year | DOI | Venue |
|---|---|---|
1968 | 10.1145/321450.321455 | J. ACM |
Keywords | DocType | Volume |
artificial variable,simplex type algorithm,unified algorithm,convex programming,ordinary linear programming form,problems. key words and phrases: linear programming,nonlinear programming,computer test,simplex algorithm,constraints,convex piecewise linear objective,regular simplex routine,Bidirectional Simplex Algorithm,absolute value term,ordinary linear programming problem,comparative computer run | Journal | 15 |
Issue | ISSN | Citations |
2 | 0004-5411 | 4 |
PageRank | References | Authors |
1.83 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Orden | 1 | 4 | 1.83 |
| V. Nalbandian | 2 | 4 | 1.83 |