Practical issues on the projection of polyhedral sets

DOI10.1007/BF01535523zbMath0875.68821OpenAlexW2017610243MaRDI QIDQ1356171

Catherine Lassez, Jean-Louis Lassez, Tien Huynh

Publication date: 9 November 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01535523

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (11)

Projection, consistency, and George Boole ⋮ The use of the optimal partition in a linear programming solution for postoptimal analysis ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Indirect adaptive model predictive control and its application to uncertain linear systems ⋮ Wald, QLR, and score tests when parameters are subject to linear inequality constraints ⋮ Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection ⋮ Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling ⋮ Projecting CLP(\({\mathcal R}\)) constraints ⋮ Adjustable Robust Optimization via Fourier–Motzkin Elimination ⋮ Projection onto simplicial cones by a semi-smooth Newton method ⋮ Projection onto simplicial cones by Picard's method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Fourier's algorithm for linear arithmetic constraints
• On the structure of the set bases of a degenerate point
• Degeneracy graphs and the neighbourhood problem
• A canonical form for generalized linear constraints
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• An algorithm for determining all extreme points of a convex polytope

This page was built for publication: Practical issues on the projection of polyhedral sets