clp(1)

clp1

Linear program solver

Usage

clp filename [options] solutionfile

Overview

This manual page documents briefly the clp command.

clp -- interface to the coin linear programming solver. clp solves the following linear optimization program:

minimize c^t x
such that: row_lb <= Ax <= row_ub
column_lb <= x <= column_ub

Options

When no options are given clp enters the interactive command line mode. Otherwise the program enters a batch mode, for which a summary of options is included below. For a complete description, see /usr/share/doc/coinor-libclp-doc.

-help

Show summary of options.

-primalsimplex

solve the problem using the primal simplex method

-dualsimplex

solve the problem using the dual simplex method

-maximize

maximize the problem

Releases

9 releases since Debian 5.0 (Lenny); the text changed 1 time.

  1. 5.0
  2. 6.0–13

Author

clp was written by John J. Forrest <[email protected]> et.al.

This manual page was written by Soeren Sonnenburg <[email protected]>, for the Debian project (but may be used by others).

From coinor-clp 1.17.10+ds-1 in Debian 13 (Trixie). Parsed by carta from the page's man source.