Accession Number : AD0436341

Title :   HEIGHTS OF CONVEX POLYTOPES,

Corporate Author : BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH

Personal Author(s) : Klee,Victor

Report Date : FEB 1964

Pagination or Media Count : 23

Abstract : Though phrased in geometric terms, this report is concerned with the comparative efficiency of various pivot rules for the simplex method of linear programming, in which one seeks to maximize a linear objective function by moving along the edges of the feasible region. The following three rules are considered: (1) from the vertex v, survey the adjacent vertices until a vertex w is found for which the linear function of v is less than that for w, then move to w and continue the process; (2) from the vertex v, survey all of the adjacent vertices in order to find one, say w, at which the linear function has the greatest value; then move to w and continue the process; (3) from the vertex v, survey all of the adjacent vertices in order to find one, say w, for which the slope has the greatest value; then move to w and continue the process. (Author)

Descriptors :   (*LINEAR PROGRAMMING, CONVEX SETS), COMBINATORIAL ANALYSIS, INEQUALITIES, OPTIMIZATION, SEQUENCES(MATHEMATICS), TOPOLOGY, SERIES(MATHEMATICS), MATHEMATICAL LOGIC

Distribution Statement : APPROVED FOR PUBLIC RELEASE