Login or Register to Ask a Question and Join Our Community

Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

mccs(1) [debian man page]

mccs(1) 						       Debian User's Manual							   mccs(1)

NAME

       mccs - package dependency solver

SYNOPSIS

       mccs [options]

DESCRIPTION

       mccs  (which  stands  for Multi Criteria CUDF Solver) is a solver for package dependency problems expressed in the CUDF format. By default,
       mccs reads a problem specification from standard input, and writes the solution to standard output.

OPTIONS FOR CONTROLLING INPUT
/OUTPUT
       -i file
	      Read input from file file instead of standard input.

       -o file
	      Write the solution to file instead of standard output.

       -fo    full solution output

       -v n   set verbosity level to n.

       -h     print this help

OPTIONS FOR SELECTING THE SOLVER ENGINE

       By default, mccs uses the cbc solving engine.

       -lpsolve
	      use lpsolve solver

       -lp lpsolver
	      specify a solving engine that takes the cplex input format. lpsolver is the path of a script that takes as input the file name  con-
	      taining	the   cplex   input,   and   that   produces   the  solution  on  standard  output  (an  example  for  scip  is  given	in
	      /usr/share/doc/mccs/engines/sciplp).

       -pblib pbsolver
	      use pseudo-Boolean solver pbsolver as solving engine.

       -nosolve
	      do not solve the problem (for debugging)

OPTIONS FOR CONTROLLING CONSTRAINT GENERATION

       -noreduce
	      do not reduce the initial problem

       -only-agregate-constraints
	      generate only agregate constraints

       -only-desagregate-constraints
	      generate only deagregate constraints (default)

       -all-constraints
	      generate all kind of constraints (ensure redundancy)

OPTIONS FOR CONTROLLING OPTIMIZATION

       See the file /usr/share/doc/mccs/README.optimization-criteria for a full grammar of optimization criteria.

EXAMPLES

       An example input file can be found at /usr/share/doc/mccs/examples/legacy.cudf.

	   mccs -i legacy.cudf

       calls mccs on examples/legacy.cudf and prints the solution on stdout. With such a call mccs will resort to the  default	underlying  solver
       cbc and use a default criterion to solve the problem.

	   mccs -i legacy.cudf -o sol -lexagregate[-removed,-changed]
	   -lpsolve

       Here,  mccs  puts the solution into the	file "sol" and solves the problem using the lpsolve solver with the paranoid criterion, which con-
       sists of first minimizing the number of removed packaged, and then the number of packages that change installation status or installed ver-
       sion.

	   mccs -i legacy.cudf -o sol 
	   -lexsemiagregate[-removed,-notuptodate,
	   -nunsat[recommends:,true],-new]

       The  criterion  used  here is the trendy criterion, which consists of first minimizing the number of package removals, then to minimize the
       number of installed packages that are installed in a version older the most recent available version, then to minimize the number of recom-
       mendations of installed packages that are not satisfied, and finally the number of newly installed packages.

AUTHOR

       mccs has been written by Claude Michel <cpjm@polytech.unice.fr>. The development of mccs has been partly supported by the European research
       project Mancoosi.

								    9 May 2011								   mccs(1)

Check Out this Related Man Page

DSDP(1) 						      General Commands Manual							   DSDP(1)

NAME

       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 <benson@mcs.anl.gov> and Yinyu Ye <yinyu-ye@stanford.edu>

       This manual page was written by Soeren Sonnenburg <sonne@debian.org>, for the Debian project (but may be used by others).

								  August  1, 2007							   DSDP(1)
Man Page