Files @ r609:e6927fe719e6

Location: LEMON/LEMON-main/lemon/lp_base.cc

Load file history 
r609:e6927fe719e6
937 B
text/x-c++src
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
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.
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2008

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */



///\file

///\brief The implementation of the LP solver interface.



#include <lemon/lp_base.h>

namespace lemon {



  const LpBase::Value LpBase::INF =

    std::numeric_limits<LpBase::Value>::infinity();

  const LpBase::Value LpBase::NaN =

    std::numeric_limits<LpBase::Value>::quiet_NaN();



} //namespace lemon