Thumbnail
Access Restriction
Subscribed

Author Orden, A. ♦ Nalbandian, V.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1968
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1968-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 15
Issue Number 2
Page Count 15
Starting Page 221
Ending Page 235


Open content in new tab

   Open content in new tab
Source: ACM Digital Library