Porta- a software package for polyhedral transformations
Conference
·
OSTI ID:35906
In this talk we present an implementation of an algorithm for transforming the description of a polyhedron as convex hull and convex cone to its description by linear equations and inequalities. Making use of polarity, the same algorithm can be applied for performing the reverse transformation. Our algorithm is based on the Fourier-Motzkin elimination procedure. We give practicable criteria that ensure that the resulting description is a minimal one and point out how they can be implemented in an efficient way. Finally we give some computational results.
- OSTI ID:
- 35906
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A polyhedral study of production ramping
Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
Fourier-Motzkin elimination for mixed systems
Journal Article
·
Thu Jun 11 20:00:00 EDT 2015
· Mathematical Programming
·
OSTI ID:1455405
Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
Journal Article
·
Thu Mar 15 00:00:00 EDT 2018
· Computational and Applied Mathematics
·
OSTI ID:22769394
Fourier-Motzkin elimination for mixed systems
Technical Report
·
Mon Aug 01 00:00:00 EDT 1983
·
OSTI ID:5860090