Visit Our UNIX and Linux User Community

Linux and UNIX Man Pages

Test Your Knowledge in Computers #245
Difficulty: Easy
In 1971, Ray Tomlinson, of BBN sent the first network e-mail.
True or False?
Linux & Unix Commands - Search Man Pages

dsdp5(1) [suse man page]

DSDP(1) 						      General Commands Manual							   DSDP(1)

dsdp5 - semidefinite program solver SYNOPSIS
dsdp5 [options] filename maxcut [options] filename theta filename DESCRIPTION
This manual page documents briefly the dsdp5, theta and maxcut commands. dsdp5 -- interface to solve general semi-definite programs maxcut -- solves a SDP relaxation of the maximum cut problem theta -- solves the Lovasz thetha problem OPTIONS
A summary of options is included below. For a complete description, see /usr/share/doc/dsdp-doc. -help Show summary of options. -v, --version Show version of program. -print print information at each k iteration (default 10) -save filename of solution file in SDPA format -fout filename to print standard monitor to a file -y0 filename for initial solution file -benchmark filename to file containing names of SDPA files -directory path to directory containing benchmark SDPA files -suffix suffix to add to each benchmark problem name -dloginfo print more information for higher numbers (default 0) -dlogsummary print timing information (default 1 - enabled) -gaptol gap tolerance parameter, stop when relative duality gap less than this gap (default 1e-6) -r0 if nonnegative, initialize S by adding this multiple of the identity matrix (default -1) -penalty penalize dual infeasibility (default 1e10) -boundy bound for variables y (default 1e7) -maxit set maximum iterates (default 200) -zbar Upper bound for dual solution (default 1e10) -mu0 if positive, set initial barrier parameter (default -1) -rho Potential parameter as multiple of dimension (default 3) -drho Use dynamic rho strategy (default 1) -pnormtol stop only if pnorm less than (default 1e30) -reuse Reuse the Schur Matrix this many times (default 4) -dobjmin apply a known lower bound for the objective at solution as a constraint. -bigM if positive, modify algorithm to make dual infeasibility positive with a large associated cost (default 0) -dloginfo print more information for higher numbers (default 0) -params filename to read selected options from a file SEE ALSO
glpsol(1), The programs are documented fully in the accompanying .pdf and html documentation which can be found in /usr/share/doc/dsdp-doc if the dsdp-doc package is installed. AUTHOR
dsdp was written by Steven J. Benson <> and Yinyu Ye <> This manual page was written by Soeren Sonnenburg <>, for the Debian project (but may be used by others). August 1, 2007 DSDP(1)

Check Out this Related Man Page

GLPSOL(1)							   User Commands							 GLPSOL(1)

GLPSOL: - manual page for GLPSOL: GLPK LP/MIP Solver, v4.43 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) --lp read LP/MIP problem in CPLEX LP format --glp read LP/MIP problem in GLPK 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 (same as --math) -d filename, --data filename read data section from filename (for --math only); if model file also has data section, it is ignored -y filename, --display filename send display output to filename (for --math only); by default the output is sent to terminal --seed value initialize pseudo-random number generator used in MathProg model with specified seed (any integer); if seed value is ?, some random seed will be used --mincost read min-cost flow problem in DIMACS format --maxflow read maximum flow problem in DIMACS format --simplex use simplex method (default) --interior use interior point method (LP only) -r filename, --read filename read solution from filename rather to find it with the solver --min minimization --max maximization --scale scale problem (default) --noscale do not scale problem -o filename, --output filename write solution to filename in printable format -w filename, --write filename write solution to filename in plain text format --ranges filename write sensitivity analysis report to filename in printable format (simplex only) --tmlim nnn limit solution time to nnn seconds --memlim nnn limit available memory to nnn megabytes --check do not solve problem, check input data only --name probname change problem name to probname --wmps filename write problem to filename in fixed MPS format --wfreemps filename write problem to filename in free MPS format --wlp filename write problem to filename in CPLEX LP format --wglp filename write problem to filename in GLPK format --log filename write copy of terminal output to filename -h, --help display this help information and exit -v, --version display program version and exit LP basis factorization options: --luf LU + Forrest-Tomlin update (faster, less stable; default) --cbg LU + Schur complement + Bartels-Golub update (slower, more stable) --cgr LU + Schur complement + Givens rotation update (slower, more stable) Options specific to simplex solver: --primal use primal simplex (default) --dual use dual simplex --std use standard initial basis of all slacks --adv use advanced initial basis (default) --bib use Bixby's initial basis --ini filename use as initial basis previously saved with -w (disables LP presolver) --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 --exact use simplex method based on exact arithmetic --xcheck check final basis using exact arithmetic Options specific to interior-point solver: --nord use natural (original) ordering --qmd use quotient minimum degree ordering --amd use approximate minimum degree ordering (default) --symamd use approximate minimum degree ordering Options specific to MIP solver: --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 --mostf branch on most fractional variable --drtom branch using heuristic by Driebeck and Tomlin (default) --pcost branch using hybrid pseudocost heuristic (may be useful for hard instances) --dfs backtrack using depth first search --bfs backtrack using breadth first search --bestp backtrack using the best projection heuristic --bestb backtrack using node with best local bound (default) --intopt use MIP presolver (default) --nointopt do not use MIP presolver --binarize replace general integer variables by binary ones (assumes --intopt) --fpump apply feasibility pump heuristic --gomory generate Gomory's mixed integer cuts --mir generate MIR (mixed integer rounding) cuts --cover generate mixed cover cuts --clique generate clique cuts --cuts generate all cuts above --mipgap tol set relative mip gap tolerance to tol SEE ALSO
For description of the MPS and CPLEX LP formats see the Reference Manual at /usr/share/doc/glpk-doc/glpk.pdf For description of the modeling language see "GLPK: Modeling Language GNU MathProg" at /usr/share/doc/glpk-doc/gmpl.pdf COPYRIGHT
Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Andrew Makhorin, Department for Applied Informatics, Moscow Aviation Institute, Moscow, Russia. All rights reserved. This program has ABSOLUTELY NO WARRANTY. This program is free software; you may re-distribute it under the terms of the GNU General Public License version 3 or later. GLPSOL
: GLPK LP/MIP Solver, v4.43 March 2010 GLPSOL(1)

Featured Tech Videos