blob: 7289ead18437870210986da09bfed730a61fc496 (
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
72
|
/* $Id: ClpPrimalColumnDantzig.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 ClpPrimalColumnDantzig_H
#define ClpPrimalColumnDantzig_H
#include "ClpPrimalColumnPivot.hpp"
//#############################################################################
/** Primal Column Pivot Dantzig Algorithm Class
This is simplest choice - choose largest infeasibility
*/
class ClpPrimalColumnDantzig : public ClpPrimalColumnPivot {
public:
///@name Algorithmic methods
//@{
/** Returns pivot column, -1 if none.
Lumbers over all columns - slow
The Packed CoinIndexedVector updates has cost updates - for normal LP
that is just +-weight where a feasibility changed. It also has
reduced cost from last iteration in pivot row
Can just do full price if you really want to be slow
*/
virtual int pivotColumn(CoinIndexedVector * updates,
CoinIndexedVector * spareRow1,
CoinIndexedVector * spareRow2,
CoinIndexedVector * spareColumn1,
CoinIndexedVector * spareColumn2);
/// Just sets model
virtual void saveWeights(ClpSimplex * model, int) {
model_ = model;
}
//@}
///@name Constructors and destructors
//@{
/// Default Constructor
ClpPrimalColumnDantzig();
/// Copy constructor
ClpPrimalColumnDantzig(const ClpPrimalColumnDantzig &);
/// Assignment operator
ClpPrimalColumnDantzig & operator=(const ClpPrimalColumnDantzig& rhs);
/// Destructor
virtual ~ClpPrimalColumnDantzig ();
/// Clone
virtual ClpPrimalColumnPivot * clone(bool copyData = true) const;
//@}
//---------------------------------------------------------------------------
private:
///@name Private member data
//@}
};
#endif
|
