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

AVAILABILITY

76       The  latest version of the Parma Polyhedra Library and all the documen‐
77       tation is available at http://www.cs.unipr.it/ppl/ .
78

NOTES

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

AUTHOR

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

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

SEE ALSO

95       ppl-config(1)
96
97       Andrew Makhorin.  GNU Linear Programming Kit: Reference Manual (Version
98       4.31).
99
100
101
102ppl_lpsol 0.10.2                  April 2009                      PPL_LPSOL(1)
Impressum