ppl_lpsol(1)

1PPL_LPSOL(1)                     User Commands                    PPL_LPSOL(1)
2
3
4

NAME

6       ppl_lpsol - a PPL-based mixed integer programming problem solver
7

SYNOPSIS

9       ppl_lpsol [OPTION]... [FILE]
10

DESCRIPTION

12       Reads a file in MPS format and attempts solution using the optimization
13       algorithms provided by the PPL.
14
15       See the GNU Linear Programming Kit: Reference Manual (Version 4.31) for
16       information on the MPS format.
17

OPTIONS

19       -c, --check[=THRESHOLD] checks the obtained results using GLPK;
20              optima  are  checked  with  a  tolerance  of  THRESHOLD (default
21              1e-09);  input data are also perturbed the same way as GLPK does
22
23       -i, --incremental
24              solves the problem incrementally
25
26       -m, --min
27              minimizes the objective function
28
29       -M, --max
30              maximizes the objective function (default)
31
32       -n, --no-optimization
33              checks for satisfiability only
34
35       -r, --no-mip
36              consider integer variables as real variables
37
38       -CSECS, --max-cpu=SECS
39              limits CPU usage to SECS seconds
40
41       -RMB, --max-memory=MB
42              limits memory usage to MB megabytes
43
44       -h, --help
45              prints this help text to stdout
46
47       -oPATH, --output=PATH
48              appends output to PATH
49
50       -e, --enumerate
51              use the (expensive!) enumeration method
52
53       -pM, --pricing=M
54              use pricing method M for simplex (assumes -s); M is an int  from
55              0  to  2,  default 0: 0 --> steepest-edge using floating point 1
56              --> steepest-edge using exact arithmetic 2 --> textbook
57
58       -s, --simplex
59              use the simplex method
60
61       -t, --timings
62              prints timings to stderr
63
64       -v, --verbosity=LEVEL
65              sets verbosity level (from 0 to 4, default 3): 0 -->  quiet:  no
66              output except for errors and
67
68              explicitly required notifications
69
70              1  --> solver state only 2 --> state + optimal value 3 --> state
71              + optimal value + optimum location 4 --> lots of output
72
73       -V, --version
74              prints version information to stdout
75

AVAILABILITY

77       The latest version of the Parma Polyhedra Library and all the  documen‐
78       tation is available at http://bugseng.com/products/ppl/ .
79

NOTES

81       The  options  -CSECS (--max-cpu=SECS) and -t (--timings) are not avail‐
82       able on some platforms.
83

AUTHOR

85       See the file CREDITS in the source  distribution  or  use  the  command
86       ppl-config --credits for a list of contributors.
87

COPYRIGHT

89       Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it> Copyright
90       (C) 2010-2016 BUGSENG srl (http://bugseng.com)
91       This is free software; see the file COPYING in the source  distribution
92       or  use  the  command ppl-config --copying to obtain the copying condi‐
93       tions.  There is NO warranty; not even for MERCHANTABILITY  or  FITNESS
94       FOR A PARTICULAR PURPOSE.
95