Accession Number : AD0736804

Title :   A Condensed Tableau for the Lambda-Form of Separable Programming,

Corporate Author : WASHINGTON UNIV ST LOUIS MO CONTROL SYSTEMS SCIENCE AND ENGINEERING

Personal Author(s) : Zwart,Philip B.

Report Date : 01 SEP 1971

Pagination or Media Count : 25

Abstract : The lambda-form for separable programming problems involves solving an LP problem (with a restricted basis entry conditon) which involves m + n constraints. The author assumes that there are n variables and m constraints in the original problem. The paper shows how the restricted basis entry condition enables one to apply revised simplex by maintaining a tableau of size (t+1) x t, where 0 < or = t < or = n, rather than of size (n+m+1) x (n+m). The results are also extended to the lambda-form for nonseparable problems. (Author)

Descriptors :   (*LINEAR PROGRAMMING, OPTIMIZATION), SIMPLEX METHOD, RANDOM VARIABLES, MATRICES(MATHEMATICS)

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE