module_lp_solver Namespace Reference

A solver module based on a linear programming algorithm. More...


Classes

class  LPSolver
 This class is a prototype of an Linear Programming (LP) Solver for the planning problem or a subset of it. More...

Functions

const char * initialize (const CommandLoadLibrary::ParameterList &z)

Detailed Description

A solver module based on a linear programming algorithm.

The module is currently in beta-mode: it is usable as a proof of concept, but isn't finished yet as an out-of-the-box integrated solver.

The linear programming problem definition is very flexible.
As a prototyping example, a capacity allocation problem is used. Different business problems will obviously require a different formulation.

The module uses the "Gnu Linear Programming Kit" library (aka GLPK) to solve the LP model.

The XML schema extension enabled by this module is (see mod_lpsolver.xsd): 

 <xsd:complexType name="solver_lp">
   <xsd:complexContent>
     <xsd:extension base="solver">
       <xsd:choice minOccurs="0" maxOccurs="unbounded">
         <xsd:element name="verbose" xsi:type="xsd:boolean" />
         <xsd:element name="calendar" xsi:type="calendar" />
       </xsd:choice>
     </xsd:extension>
   </xsd:complexContent>
 </xsd:complexType>

Function Documentation

const char * module_lp_solver::initialize ( const CommandLoadLibrary::ParameterList &  z  ) 

Initialization routine for the library.

Definition at line 35 of file lpsolver.cpp.

Documentation generated by  doxygen