LIFTING PROJECTIONS OF CONVEX POLYHEDRA

被引:61
作者
WALKUP, DW
WETS, RJB
机构
[1] Boeing Scientific Research Labs, Greensboro
关键词
D O I
10.2140/pjm.1969.28.465
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
If τ is a projection of a closed convex polyhedron P onto a convex polyhedron Q, then a liftingof Q into P is defined to be a single-valued inverse τ* of τ such that τ* (Q) is the union of closed faces of P. The main result of this paper, designated the Lifting Theorem, asserts that there always exists a liftingrτ*, provided only that there exists at least one face of P on whichτ acts one-to-one. The liftingtheoremrep esents a unifying generalization of a number of results in the theory of convex polyhedra and should prove useful as an investigative as well as a conceptual tool. In the course of the proof, a special case of the Lifting Theorem is translated into linear programming terms and stated as the Basis Decomposition Theorem, which summarizes the behavior of a linear program as a function of its right-hand sides. In particular, the fact that a lifting is necessarily a piecewise linear homeomorphism is reflected in the Basis Decomposition Theorem as the observation that the optimal solution of a linear program can always be chosen as a continuous function of the right-hand sides. © 1969 by Pacific Journal of Mathematics.
引用
收藏
页码:465 / &
相关论文
共 6 条
[1]   ON CONTINUITY OF MINIMUM SET OF A CONTINUOUS FUNCTION [J].
DANTZIG, GB ;
FOLKMAN, J ;
SHAPIRO, N .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1967, 17 (03) :519-&
[2]  
Eggleston H.G., 1964, COMMENT MATH HELV, V39
[3]  
WALKUP DW, TO BE PUBLISHED
[4]  
WALKUP DW, 1968, D1820792 BOEING SCIE
[5]  
WALKUP DW, 1968, D1820728 BOEING SCIE
[6]   PROGRAMMING UNDER UNCERTAINTY - EQUIVALENT CONVEX PROGRAM [J].
WETS, RJB .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1966, 14 (01) :89-&