1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.11.
.TH PPL_PIPS "1" "February 2016" "ppl_pips 1.2" "User Commands"
.SH NAME
ppl_pips \- a PPL-based parametric integer programming problem solver
.SH SYNOPSIS
.B ppl_pips
[\fIOPTION\fR]... [\fIFILE\fR]
.SH DESCRIPTION
Reads the definition of a Parametric Integer Programming problem
and displays the lexicographic minimum in terms of the values of the
parameters.
.SH OPTIONS
.TP
\fB\-RMB\fR, \fB\-\-max\-memory\fR=\fIMB\fR
limits memory usage to MB megabytes
.TP
\fB\-h\fR, \fB\-\-help\fR
prints this help text to stdout
.TP
\fB\-oPATH\fR, \fB\-\-output\fR=\fIPATH\fR
appends output to PATH
.TP
\fB\-P\fR, \fB\-\-polylib\fR
reads problem in PolyLib format (default)
.TP
\fB\-p\fR, \fB\-\-piplib\fR
reads problem in PipLib format
.TP
\fB\-t\fR, \fB\-\-timings\fR
prints timings to stderr
.TP
\fB\-v\fR, \fB\-\-verbose\fR
produces lots of output
.TP
\fB\-i\fR, \fB\-\-iterations\fR=\fIN\fR
executes the resolution N times (default=1)
.TP
\fB\-V\fR, \fB\-\-version\fR
prints version information to stdout
.TP
\fB\-cPATH\fR, \fB\-\-check\fR=\fIPATH\fR
checks if the result is equal to what is in PATH
.SS "Cut generation options:"
.TP
\fB\-f\fR, \fB\-\-cut\-first\fR
uses the first non\-integer row (default)
.TP
\fB\-d\fR, \fB\-\-cut\-deepest\fR
tries to generate the deepest cut
.TP
\fB\-a\fR, \fB\-\-cut\-all\fR
always generates all possible cuts
.SS "Pivot row strategy options:"
.TP
\fB\-F\fR, \fB\-\-row\-first\fR
uses the first row with negative parameter (default)
.TP
\fB\-M\fR, \fB\-\-row\-max\fR
chooses row generating the lexico\-maximal pivot column
.SH AVAILABILITY
The latest version of the Parma Polyhedra Library and all the documentation
is available at \fBhttp://bugseng.com/products/ppl/\fR .
.SH NOTES
The options \fB\-CSECS\fR (\fB\-\-max\-cpu\fR=\fISECS\fR) and
\fB\-t\fR (\fB\-\-timings\fR) are not available on some platforms.
.sp
The PolyLib format is as follows:
.TP
-
The first row describes the context matrix (i.e., constraints on the
parameters). The first value is the number of rows (which can be zero)
and the second value is the number of columns. The number of parameters
is the number of columns minus 2.
.TP
-
Starting from the second row, there are the rows of the context matrix,
if any. Each row, which represents a constraint of the form
.B "c1*p1 + ... + cn*pn + c0 =/>= 0",
contains:
the value 0 if the constraint is an equality, 1 if it is an inequality;
the coefficients of the parameters
.B "c1, ..., cn";
the constant term
.B "c0".
For example, the inequality constraint on two parameters
.B "p1 + 2*p2 - 1 >= 0"
is encoded by the row
.B "1 1 2 -1".
.TP
-
The following row contains the parameter number for the so-called
.IR "big parameter".
If no big parameter is used, the value is -1.
.TP
-
The following rows encode the problem inequality matrix.
As for the context matrix, the first two values are the dimensions of the
matrix. The number of variables is the number of columns in the matrix
minus the number of parameters minus 2.
Each row, which represents a constraint of the form
.B "d1*v1 + ... + dm*vm + c1*p1 + ... + cn*pn + c0 =/>= 0",
contains:
the value 0 if the constraint is an equality, 1 if it is an inequality;
the coefficients of the variables
.B "d1, ..., dm";
the coefficients of the parameters
.B "c1, ..., cn";
the constant term
.B "c0".
.sp
The PipLib format is described in Section 2.2 of
.IR "PIP/PipLib: A Solver for Parametric Integer Programming Problems"
(see below).
.SH AUTHOR
See the file \fBCREDITS\fR in the source distribution or use the command
\fBppl\-config \-\-credits\fR for a list of contributors.
.SH "REPORTING BUGS"
Report bugs to <ppl\-devel@cs.unipr.it>.
.SH COPYRIGHT
Copyright (C) 2001\-2010 Roberto Bagnara <bagnara@cs.unipr.it>
Copyright (C) 2010\-2016 BUGSENG srl (http://bugseng.com)
.br
This is free software; see the file \fBCOPYING\fR in the source
distribution or use the command \fBppl\-config \-\-copying\fR to
obtain the copying conditions. There is NO warranty; not even for
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
.SH "SEE ALSO"
.BR ppl-config(1)
.sp
Paul Feautrier.
.IR "Parametric Integer Programming".
RAIRO Recherche Operationnelle, 22(3):243-268, 1988.
.sp
Paul Feautrier, Jean-Francois Collard, and Cedric Bastoul.
.IR "PIP/PipLib: A Solver for Parametric Integer Programming Problems",
5.0 edition, July 2007.
Distributed with PIP/PipLib 1.4.0.
|
