Linux Certif

Toute la documentation sur la certification Linux LPI

glpsol

NAME

GLPSOL - GLPK linear programming/MIP solver

SYNOPSIS

glpsol [options...] filename

DESCRIPTION

General options:

--mps

read LP/MIP problem in Fixed MPS format

--freemps

read LP/MIP problem in Free MPS format (default)

--cpxlp

read LP/MIP problem in CPLEX LP format

--math

read LP/MIP model written in GNU MathProg modeling language

-m filename, --model filename

read model section and optional data section from filename (the same as --math)

-d filename, --data filename

read data section from filename (for --math only); if data section follows model section in the same file, this option is ignored

-y filename, --display filename

send display output to filename (for --math only); by default the output is sent to stdout

--min

minimization

--max

maximization

--scale

scale the problem (default)

--noscale

do not scale the problem

--simplex

use simplex method (default)

--interior

use interior point method (for pure LP only)

-o filename, --output filename

write solution to filename in plain text format

-r filename

read solution from filename

-w filename

write solution to filename

--bounds filename

write sensitivity bounds to filename in plain text format (LP only)

--tmlim nnn

limit solution time to nnn seconds

--memlim nnn

limit available memory to nnn megabytes

--check

do not solve the problem, check input data only

--name probname

change problem name to probname

--plain

use plain names of rows and columns (default)

--orig

try using original names of rows and columns (default for --mps)

--wmps filename

write problem to filename in Fixed MPS format

--wfreemps filename

write problem to filename in Free MPS format

--wcpxlp filename

write problem to filename in CPLEX LP format

--wtxt filename

write problem to filename in plain text format

--log filename

write copy of screen output to filename

-h, --help

display this help information and exit

-v, --version

display program version and exit

Options specific to simplex method:

--std

use standard initial basis of all slacks

--adv

use advanced initial basis (default)

--bib

use Bixby's initial basis

--bas filename

read initial basis from filename in MPS format

--steep

use steepest edge technique (default)

--nosteep

use standard "textbook" pricing

--relax

use Harris' two-pass ratio test (default)

--norelax

use standard "textbook" ratio test

--presol

use presolver (default; assumes --scale and --adv)

--nopresol

do not use presolver

--wbas filename

write final basis to filename in MPS format

Options specific to MIP:

--nomip

consider all integer variables as continuous (allows solving MIP as pure LP)

--first

branch on first integer variable

--last

branch on last integer variable

--drtom

branch using heuristic by Driebeck and Tomlin (default)

--mostf

branch on most fractional variable

--dfs

backtrack using depth first search

--bfs

backtrack using breadth first search

--bestp

backtrack using the best projection heuristic (default)

--bestb

backtrack using node with best local bound

--intopt

use advanced MIP solver

--binarize

replace general integer variables by binary ones (assumes --intopt)

--cover

generate mixed cover cuts

--clique

generate clique cuts

--gomory

generate Gomory's mixed integer cuts

--cuts

generate all cuts above (assumes --intopt)

--mipgap tol

set relative MIP gap tolerance

REPORTING BUGS

Please report bugs to <bug-glpk@gnu.org>.

COPYRIGHT

Copyright © 2000, 2001, 2002, 2003, 2004, 2005 Andrew Makhorin <mao@gnu.org> This program is free software; you may redistribute it under the terms of the GNU General Public License. This program has absolutely no warranty.

SEE ALSO

/usr/share/doc/glpk/

Documentation about GLPK, its C API, the GNU MathProg modeling language, and MPS and LP file formats in PostScript format.

See also the official GNU webpage dedicated to GLPK at <http://www.gnu.org/software/glpk/glpk.html>.