blob: 73b42b33979c886501172516bf55260116f1bdc7 (
plain)
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
/* $Id: ClpDualRowDantzig.hpp 1665 2011-01-04 17:55:54Z lou $ */
// Copyright (C) 2002, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
#ifndef ClpDualRowDantzig_H
#define ClpDualRowDantzig_H
#include "ClpDualRowPivot.hpp"
//#############################################################################
/** Dual Row Pivot Dantzig Algorithm Class
This is simplest choice - choose largest infeasibility
*/
class ClpDualRowDantzig : public ClpDualRowPivot {
public:
///@name Algorithmic methods
//@{
/// Returns pivot row, -1 if none
virtual int pivotRow();
/** Updates weights and returns pivot alpha.
Also does FT update */
virtual double updateWeights(CoinIndexedVector * input,
CoinIndexedVector * spare,
CoinIndexedVector * spare2,
CoinIndexedVector * updatedColumn);
/** Updates primal solution (and maybe list of candidates)
Uses input vector which it deletes
Computes change in objective function
*/
virtual void updatePrimalSolution(CoinIndexedVector * input,
double theta,
double & changeInObjective);
//@}
///@name Constructors and destructors
//@{
/// Default Constructor
ClpDualRowDantzig();
/// Copy constructor
ClpDualRowDantzig(const ClpDualRowDantzig &);
/// Assignment operator
ClpDualRowDantzig & operator=(const ClpDualRowDantzig& rhs);
/// Destructor
virtual ~ClpDualRowDantzig ();
/// Clone
virtual ClpDualRowPivot * clone(bool copyData = true) const;
//@}
//---------------------------------------------------------------------------
private:
///@name Private member data
//@}
};
#endif
|
