MPLRS(1) | mplrs 7.2 | MPLRS(1) |
NAME¶
mplrs - Convert between representations of convex polyhedra (parallel version).
SYNOPSIS¶
mpirun -np num_proc mplrs infile [outfile] [option...]
DESCRIPTION¶
A polyhedron can be described by a list of inequalities (H-representation) or as by a list of its vertices and extreme rays (V-representation). lrs is a C program that converts a H-representation of a polyhedron to its V-representation, and vice versa. These problems are known respectively at the vertex enumeration and convex hull problems.
USAGE¶
The number of processors num_proc specified to mpirun should be 4 or higher Unlike lrs (1), mplrs does not support options after the end statement of the input file.
OPTIONS¶
mplrs supports the following options.
EXAMPLE¶
Input file mp5.ine is run with 8 processors. The output file mp5.mplrs is in the distribution. This produced 378 subtrees that were enumerated in parallel using 6 producer cores, 1 core controlling the run and 1 core collecting the output.
mai20% mpirun -np 8 mplrs mp5.ine mp5.mplrs
*mplrs:lrslib v.6.0 2015.7.13(lrsgmp.h)8 processes
*Copyright (C) 1995,2015, David Avis avis@cs.mcgill.ca
*Input taken from mp5.ine
*Output written to: mp5.mplrs
*Starting depth of 2 maxcobases=50 maxdepth=0 lmin=3 lmax=3 scale=100
*Phase 1 time: 0 seconds.
*Total number of jobs: 378, L became empty 4 times
*Totals: vertices=32 rays=0 bases=9041 integer-vertices=16
*Elapsed time: 1 seconds.
2.285u 0.137s 0:01.86 129.5% 0+0k 0+9976io 36pf+0w
SEE ALSO¶
2020.7.28 | July 2020 |