Version 11 (modified by Lou Hafer <lou@…>, 15 years ago) (diff)


dylp development

dylp is an implementation of the dynamic simplex algorithm. Briefly, dynamic simplex attempts to work with an active constraint system which is a subset of the full constraint system. It alternates between primal and dual simplex phases. Between simplex phases, it deactivates variables and constraints which are not currently useful, and scans the full constraint system to activate variables and constraints which have become useful. The dylp documentation describes dylp's algorithms in detail.

dylp is intended as a development code. The implementation puts more weight on clarity than efficiency and is heavily instrumented. It can be built with extensive statistics, informational printing, and consistency checks. It can also be built without any of these; fully optimised, it's decently fast. Run times range from 2.5 to 3.5 times that of clp, depending on the problem and the runtime environment.

dylp is a C code, and can be used in a pure C environment. It also has a COIN OSI interface, OsiDylp, which takes advantage of capabilities provided by COIN (mps input/output, constraint system preprocessing) and is recommended if you're working in a C++ environment.

Trac Help

If you're unfamiliar with Trac, TracGuide is the online documentation. In the row of buttons at the top of the page, !Timeline will get you a nice presentation of the repository commit log, and BrowseSource gets you into the repository.

For a complete list of local wiki pages, see TitleIndex.

Trac is brought to you by Edgewall Software, providing professional Linux and software development services to clients worldwide. Visit for more information.