Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.

 INCLUDE_DIRECTORIES(

   ${CMAKE_SOURCE_DIR}

   ${CMAKE_BINARY_DIR}

 )

 LINK_DIRECTORIES(${CMAKE_BINARY_DIR}/lemon)

 SET(DEMOS

   arg_parser_demo

   graph_to_eps_demo

   lgf_demo)

 FOREACH(DEMO_NAME ${DEMOS})

   ADD_EXECUTABLE(${DEMO_NAME} ${DEMO_NAME}.cc)

   TARGET_LINK_LIBRARIES(${DEMO_NAME} lemon)

 ENDFOREACH(DEMO_NAME)