Lifting projections of convex polyhedra

DOI10.2140/pjm.1969.28.465zbMath0172.23702OpenAlexW2054110366MaRDI QIDQ2532111

Roger J.-B. Wets, David W. Walkup

Publication date: 1969

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1969.28.465

zbMATH Keywords

metric geometry, convex geometry, integral geometry

Related Items

Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity, Distribution sensitivity analysis for stochastic programs with complete recourse, Are quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?, Volumes of complementary projections of convex polytopes, Projection-based local and global Lipschitz moduli of the optimal value in linear programming, Strong convexity in stochastic programs with complete recourse, On the Lipschitz behavior of optimal solutions in parametric problems of quadratic optimization and linear complementarity, A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs, Limit laws for empirical optimal solutions in random linear programs, Weights on polytopes, Robust control Minkowski-Lyapunov functions, Carathéodory-type results for the sums and unions of convex sets, Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk, Designing optimization problems with diverse solutions, A Lipschitzian Characterization of Convex Polyhedra, Weak Continuity of Risk Functionals with Applications to Stochastic Programming, Characterization theorems for stochastic programs, Exact Quantization of Multistage Stochastic Linear Problems, Deviation measures in linear two-stage stochastic programming, On the spectral side of Arthur's trace formula -- combinatorial setup, Solving stochastic programs with network recourse, MSLiP: A computer code for the multistage stochastic linear programming problem, Unnamed Item, Unnamed Item, Resource sharing networks: Overview and an open problem, Quantitative stability of fully random mixed-integer two-stage stochastic programs, On decision rules in stochastic programming, Quasi-Monte Carlo methods for two-stage stochastic mixed-integer programs, A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models, Strong convexity in risk-averse stochastic programs with complete recourse, Subgradient decomposition and differentiability of the recourse function of a two stage stochastic linear program, Robust unit commitment with \(n-1\) security criteria, A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound, Control Minkowski-Lyapunov functions, The polytope algebra, A note on decision rules for stochastic programs, Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty, Support prices of activities in linear programming¹,², Unnamed Item, Unique representation in convex sets by extraction of marked components, Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector, Standard pairs and group relaxations in integer programming, Quasi-Monte Carlo methods for linear two-stage stochastic programming problems, Multiparametric demand transportation problem, On simple polytopes, Problem-based optimal scenario generation and reduction in stochastic programming