source: trunk/Clp/src/Clp_C_Interface.cpp @ 1926

Last change on this file since 1926 was 1926, checked in by forrest, 6 years ago

try to fix infeasibility ray,
changes as in stable (for presolve),
stuff for Cbc parameters

  • Property svn:eol-style set to native
  • Property svn:keywords set to Id
File size: 38.2 KB
Line 
1// $Id: Clp_C_Interface.cpp 1926 2013-03-26 15:23:38Z forrest $
2// Copyright (C) 2003, International Business Machines
3// Corporation and others.  All Rights Reserved.
4// This code is licensed under the terms of the Eclipse Public License (EPL).
5
6
7#include "CoinPragma.hpp"
8
9#include <cmath>
10#include <cstring>
11
12#include "CoinHelperFunctions.hpp"
13#include "ClpSimplex.hpp"
14#include "ClpInterior.hpp"
15#ifndef SLIM_CLP
16#include "Idiot.hpp"
17#endif
18#include <cfloat>
19// Get C stuff but with extern C
20#define CLP_EXTERN_C
21#include "Coin_C_defines.h"
22
23/// To allow call backs
24class CMessageHandler : public CoinMessageHandler {
25
26public:
27     /**@name Overrides */
28     //@{
29     virtual int print();
30     //@}
31     /**@name set and get */
32     //@{
33     /// Model
34     const Clp_Simplex * model() const;
35     void setModel(Clp_Simplex * model);
36     /// Call back
37     void setCallBack(clp_callback callback);
38     //@}
39
40     /**@name Constructors, destructor */
41     //@{
42     /** Default constructor. */
43     CMessageHandler();
44     /// Constructor with pointer to model
45     CMessageHandler(Clp_Simplex * model,
46                     FILE * userPointer = NULL);
47     /** Destructor */
48     virtual ~CMessageHandler();
49     //@}
50
51     /**@name Copy method */
52     //@{
53     /** The copy constructor. */
54     CMessageHandler(const CMessageHandler&);
55     /** The copy constructor from an CoinSimplexMessageHandler. */
56     CMessageHandler(const CoinMessageHandler&);
57
58     CMessageHandler& operator=(const CMessageHandler&);
59     /// Clone
60     virtual CoinMessageHandler * clone() const ;
61     //@}
62
63
64protected:
65     /**@name Data members
66        The data members are protected to allow access for derived classes. */
67     //@{
68     /// Pointer back to model
69     Clp_Simplex * model_;
70     /// call back
71     clp_callback callback_;
72     //@}
73};
74
75
76//-------------------------------------------------------------------
77// Default Constructor
78//-------------------------------------------------------------------
79CMessageHandler::CMessageHandler ()
80     : CoinMessageHandler(),
81       model_(NULL),
82       callback_(NULL)
83{
84}
85
86//-------------------------------------------------------------------
87// Copy constructor
88//-------------------------------------------------------------------
89CMessageHandler::CMessageHandler (const CMessageHandler & rhs)
90     : CoinMessageHandler(rhs),
91       model_(rhs.model_),
92       callback_(rhs.callback_)
93{
94}
95
96CMessageHandler::CMessageHandler (const CoinMessageHandler & rhs)
97     : CoinMessageHandler(rhs),
98       model_(NULL),
99       callback_(NULL)
100{
101}
102
103// Constructor with pointer to model
104CMessageHandler::CMessageHandler(Clp_Simplex * model,
105                                 FILE * )
106     : CoinMessageHandler(),
107       model_(model),
108       callback_(NULL)
109{
110}
111
112//-------------------------------------------------------------------
113// Destructor
114//-------------------------------------------------------------------
115CMessageHandler::~CMessageHandler ()
116{
117}
118
119//----------------------------------------------------------------
120// Assignment operator
121//-------------------------------------------------------------------
122CMessageHandler &
123CMessageHandler::operator=(const CMessageHandler& rhs)
124{
125     if (this != &rhs) {
126          CoinMessageHandler::operator=(rhs);
127          model_ = rhs.model_;
128          callback_ = rhs.callback_;
129     }
130     return *this;
131}
132//-------------------------------------------------------------------
133// Clone
134//-------------------------------------------------------------------
135CoinMessageHandler * CMessageHandler::clone() const
136{
137     return new CMessageHandler(*this);
138}
139
140int
141CMessageHandler::print()
142{
143     if (callback_) {
144          int messageNumber = currentMessage().externalNumber();
145          if (currentSource() != "Clp")
146               messageNumber += 1000000;
147          int i;
148          int nDouble = numberDoubleFields();
149          assert (nDouble <= 10);
150          double vDouble[10];
151          for (i = 0; i < nDouble; i++)
152               vDouble[i] = doubleValue(i);
153          int nInt = numberIntFields();
154          assert (nInt <= 10);
155          int vInt[10];
156          for (i = 0; i < nInt; i++)
157               vInt[i] = intValue(i);
158          int nString = numberStringFields();
159          assert (nString <= 10);
160          char * vString[10];
161          for (i = 0; i < nString; i++) {
162               std::string value = stringValue(i);
163               vString[i] = CoinStrdup(value.c_str());
164          }
165          callback_(model_, messageNumber,
166                    nDouble, vDouble,
167                    nInt, vInt,
168                    nString, vString);
169          for (i = 0; i < nString; i++)
170               free(vString[i]);
171
172     }
173     return CoinMessageHandler::print();
174}
175const Clp_Simplex *
176CMessageHandler::model() const
177{
178     return model_;
179}
180void
181CMessageHandler::setModel(Clp_Simplex * model)
182{
183     model_ = model;
184}
185// Call back
186void
187CMessageHandler::setCallBack(clp_callback callback)
188{
189     callback_ = callback;
190}
191
192#include "Clp_C_Interface.h"
193#include <string>
194#include <stdio.h>
195#include <iostream>
196
197#if defined(__MWERKS__)
198#pragma export on
199#endif
200/* Default constructor */
201COINLIBAPI Clp_Simplex *  COINLINKAGE
202Clp_newModel()
203{
204     Clp_Simplex * model = new Clp_Simplex;
205     model->model_ = new ClpSimplex();
206     model->handler_ = NULL;
207     return model;
208}
209/* Destructor */
210COINLIBAPI void COINLINKAGE
211Clp_deleteModel(Clp_Simplex * model)
212{
213     delete model->model_;
214     delete model->handler_;
215     delete model;
216}
217
218/* Loads a problem (the constraints on the
219    rows are given by lower and upper bounds). If a pointer is NULL then the
220    following values are the default:
221    <ul>
222    <li> <code>colub</code>: all columns have upper bound infinity
223    <li> <code>collb</code>: all columns have lower bound 0
224    <li> <code>rowub</code>: all rows have upper bound infinity
225    <li> <code>rowlb</code>: all rows have lower bound -infinity
226    <li> <code>obj</code>: all variables have 0 objective coefficient
227    </ul>
228*/
229/* Just like the other loadProblem() method except that the matrix is
230   given in a standard column major ordered format (without gaps). */
231COINLIBAPI void COINLINKAGE
232Clp_loadProblem (Clp_Simplex * model,  const int numcols, const int numrows,
233                 const CoinBigIndex * start, const int* index,
234                 const double* value,
235                 const double* collb, const double* colub,
236                 const double* obj,
237                 const double* rowlb, const double* rowub)
238{
239     const char prefix[] = "Clp_c_Interface::Clp_loadProblem(): ";
240     const int  verbose = 0;
241     if (verbose > 1) {
242          printf("%s numcols = %i, numrows = %i\n",
243                 prefix, numcols, numrows);
244          printf("%s model = %p, start = %p, index = %p, value = %p\n",
245                 prefix, reinterpret_cast<const void *>(model), reinterpret_cast<const void *>(start), reinterpret_cast<const void *>(index), reinterpret_cast<const void *>(value));
246          printf("%s collb = %p, colub = %p, obj = %p, rowlb = %p, rowub = %p\n",
247                 prefix, reinterpret_cast<const void *>(collb), reinterpret_cast<const void *>(colub), reinterpret_cast<const void *>(obj), reinterpret_cast<const void *>(rowlb), reinterpret_cast<const void *>(rowub));
248     }
249     model->model_->loadProblem(numcols, numrows, start, index, value,
250                                collb, colub, obj, rowlb, rowub);
251}
252/* read quadratic part of the objective (the matrix part) */
253COINLIBAPI void COINLINKAGE
254Clp_loadQuadraticObjective(Clp_Simplex * model,
255                           const int numberColumns,
256                           const CoinBigIndex * start,
257                           const int * column,
258                           const double * element)
259{
260
261     model->model_->loadQuadraticObjective(numberColumns,
262                                           start, column, element);
263
264}
265/* Read an mps file from the given filename */
266COINLIBAPI int COINLINKAGE
267Clp_readMps(Clp_Simplex * model, const char *filename,
268            int keepNames,
269            int ignoreErrors)
270{
271     return model->model_->readMps(filename, keepNames != 0, ignoreErrors != 0);
272}
273/* Copy in integer informations */
274COINLIBAPI void COINLINKAGE
275Clp_copyInIntegerInformation(Clp_Simplex * model, const char * information)
276{
277     model->model_->copyInIntegerInformation(information);
278}
279/* Drop integer informations */
280COINLIBAPI void COINLINKAGE
281Clp_deleteIntegerInformation(Clp_Simplex * model)
282{
283     model->model_->deleteIntegerInformation();
284}
285/* Resizes rim part of model  */
286COINLIBAPI void COINLINKAGE
287Clp_resize (Clp_Simplex * model, int newNumberRows, int newNumberColumns)
288{
289     model->model_->resize(newNumberRows, newNumberColumns);
290}
291/* Deletes rows */
292COINLIBAPI void COINLINKAGE
293Clp_deleteRows(Clp_Simplex * model, int number, const int * which)
294{
295     model->model_->deleteRows(number, which);
296}
297/* Add rows */
298COINLIBAPI void COINLINKAGE
299Clp_addRows(Clp_Simplex * model, int number, const double * rowLower,
300            const double * rowUpper,
301            const int * rowStarts, const int * columns,
302            const double * elements)
303{
304     model->model_->addRows(number, rowLower, rowUpper, rowStarts, columns, elements);
305}
306
307/* Deletes columns */
308COINLIBAPI void COINLINKAGE
309Clp_deleteColumns(Clp_Simplex * model, int number, const int * which)
310{
311     model->model_->deleteColumns(number, which);
312}
313/* Add columns */
314COINLIBAPI void COINLINKAGE
315Clp_addColumns(Clp_Simplex * model, int number, const double * columnLower,
316               const double * columnUpper,
317               const double * objective,
318               const int * columnStarts, const int * rows,
319               const double * elements)
320{
321     model->model_->addColumns(number, columnLower, columnUpper, objective,
322                               columnStarts, rows, elements);
323}
324/* Change row lower bounds */
325COINLIBAPI void COINLINKAGE
326Clp_chgRowLower(Clp_Simplex * model, const double * rowLower)
327{
328     model->model_->chgRowLower(rowLower);
329}
330/* Change row upper bounds */
331COINLIBAPI void COINLINKAGE
332Clp_chgRowUpper(Clp_Simplex * model, const double * rowUpper)
333{
334     model->model_->chgRowUpper(rowUpper);
335}
336/* Change column lower bounds */
337COINLIBAPI void COINLINKAGE
338Clp_chgColumnLower(Clp_Simplex * model, const double * columnLower)
339{
340     model->model_->chgColumnLower(columnLower);
341}
342/* Change column upper bounds */
343COINLIBAPI void COINLINKAGE
344Clp_chgColumnUpper(Clp_Simplex * model, const double * columnUpper)
345{
346     model->model_->chgColumnUpper(columnUpper);
347}
348/* Change objective coefficients */
349COINLIBAPI void COINLINKAGE
350Clp_chgObjCoefficients(Clp_Simplex * model, const double * objIn)
351{
352     model->model_->chgObjCoefficients(objIn);
353}
354/* Drops names - makes lengthnames 0 and names empty */
355COINLIBAPI void COINLINKAGE
356Clp_dropNames(Clp_Simplex * model)
357{
358     model->model_->dropNames();
359}
360/* Copies in names */
361COINLIBAPI void COINLINKAGE
362Clp_copyNames(Clp_Simplex * model, const char * const * rowNamesIn,
363              const char * const * columnNamesIn)
364{
365     int iRow;
366     std::vector<std::string> rowNames;
367     int numberRows = model->model_->numberRows();
368     rowNames.reserve(numberRows);
369     for (iRow = 0; iRow < numberRows; iRow++) {
370          rowNames.push_back(rowNamesIn[iRow]);
371     }
372
373     int iColumn;
374     std::vector<std::string> columnNames;
375     int numberColumns = model->model_->numberColumns();
376     columnNames.reserve(numberColumns);
377     for (iColumn = 0; iColumn < numberColumns; iColumn++) {
378          columnNames.push_back(columnNamesIn[iColumn]);
379     }
380     model->model_->copyNames(rowNames, columnNames);
381}
382
383/* Number of rows */
384COINLIBAPI int COINLINKAGE
385Clp_numberRows(Clp_Simplex * model)
386{
387     return model->model_->numberRows();
388}
389/* Number of columns */
390COINLIBAPI int COINLINKAGE
391Clp_numberColumns(Clp_Simplex * model)
392{
393     return model->model_->numberColumns();
394}
395/* Primal tolerance to use */
396COINLIBAPI double COINLINKAGE
397Clp_primalTolerance(Clp_Simplex * model)
398{
399     return model->model_->primalTolerance();
400}
401COINLIBAPI void COINLINKAGE
402Clp_setPrimalTolerance(Clp_Simplex * model,  double value)
403{
404     model->model_->setPrimalTolerance(value);
405}
406/* Dual tolerance to use */
407COINLIBAPI double COINLINKAGE
408Clp_dualTolerance(Clp_Simplex * model)
409{
410     return model->model_->dualTolerance();
411}
412COINLIBAPI void COINLINKAGE
413Clp_setDualTolerance(Clp_Simplex * model,  double value)
414{
415     model->model_->setDualTolerance(value);
416}
417/* Dual objective limit */
418COINLIBAPI double COINLINKAGE
419Clp_dualObjectiveLimit(Clp_Simplex * model)
420{
421     return model->model_->dualObjectiveLimit();
422}
423COINLIBAPI void COINLINKAGE
424Clp_setDualObjectiveLimit(Clp_Simplex * model, double value)
425{
426     model->model_->setDualObjectiveLimit(value);
427}
428/* Objective offset */
429COINLIBAPI double COINLINKAGE
430Clp_objectiveOffset(Clp_Simplex * model)
431{
432     return model->model_->objectiveOffset();
433}
434COINLIBAPI void COINLINKAGE
435Clp_setObjectiveOffset(Clp_Simplex * model, double value)
436{
437     model->model_->setObjectiveOffset(value);
438}
439/* Fills in array with problem name  */
440COINLIBAPI void COINLINKAGE
441Clp_problemName(Clp_Simplex * model, int maxNumberCharacters, char * array)
442{
443     std::string name = model->model_->problemName();
444     maxNumberCharacters = CoinMin(maxNumberCharacters,
445                                   ((int) strlen(name.c_str()))+1) ;
446     strncpy(array, name.c_str(), maxNumberCharacters - 1);
447     array[maxNumberCharacters-1] = '\0';
448}
449/* Sets problem name.  Must have \0 at end.  */
450COINLIBAPI int COINLINKAGE
451Clp_setProblemName(Clp_Simplex * model, int /*maxNumberCharacters*/, char * array)
452{
453     return model->model_->setStrParam(ClpProbName, array);
454}
455/* Number of iterations */
456COINLIBAPI int COINLINKAGE
457Clp_numberIterations(Clp_Simplex * model)
458{
459     return model->model_->numberIterations();
460}
461COINLIBAPI void COINLINKAGE
462Clp_setNumberIterations(Clp_Simplex * model, int numberIterations)
463{
464     model->model_->setNumberIterations(numberIterations);
465}
466/* Maximum number of iterations */
467COINLIBAPI int maximumIterations(Clp_Simplex * model)
468{
469     return model->model_->maximumIterations();
470}
471COINLIBAPI void COINLINKAGE
472Clp_setMaximumIterations(Clp_Simplex * model, int value)
473{
474     model->model_->setMaximumIterations(value);
475}
476/* Maximum time in seconds (from when set called) */
477COINLIBAPI double COINLINKAGE
478Clp_maximumSeconds(Clp_Simplex * model)
479{
480     return model->model_->maximumSeconds();
481}
482COINLIBAPI void COINLINKAGE
483Clp_setMaximumSeconds(Clp_Simplex * model, double value)
484{
485     model->model_->setMaximumSeconds(value);
486}
487/* Returns true if hit maximum iteratio`ns (or time) */
488COINLIBAPI int COINLINKAGE
489Clp_hitMaximumIterations(Clp_Simplex * model)
490{
491     return model->model_->hitMaximumIterations() ? 1 : 0;
492}
493/* Status of problem:
494   0 - optimal
495   1 - primal infeasible
496   2 - dual infeasible
497   3 - stopped on iterations etc
498   4 - stopped due to errors
499*/
500COINLIBAPI int COINLINKAGE
501Clp_status(Clp_Simplex * model)
502{
503     return model->model_->status();
504}
505/* Set problem status */
506COINLIBAPI void COINLINKAGE
507Clp_setProblemStatus(Clp_Simplex * model, int problemStatus)
508{
509     model->model_->setProblemStatus(problemStatus);
510}
511/* Secondary status of problem - may get extended
512   0 - none
513   1 - primal infeasible because dual limit reached
514   2 - scaled problem optimal - unscaled has primal infeasibilities
515   3 - scaled problem optimal - unscaled has dual infeasibilities
516   4 - scaled problem optimal - unscaled has both dual and primal infeasibilities
517*/
518COINLIBAPI int COINLINKAGE
519Clp_secondaryStatus(Clp_Simplex * model)
520{
521     return model->model_->secondaryStatus();
522}
523COINLIBAPI void COINLINKAGE
524Clp_setSecondaryStatus(Clp_Simplex * model, int status)
525{
526     model->model_->setSecondaryStatus(status);
527}
528/* Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore */
529COINLIBAPI double COINLINKAGE
530Clp_optimizationDirection(Clp_Simplex * model)
531{
532     return model->model_->optimizationDirection();
533}
534COINLIBAPI void COINLINKAGE
535Clp_setOptimizationDirection(Clp_Simplex * model, double value)
536{
537     model->model_->setOptimizationDirection(value);
538}
539/* Primal row solution */
540COINLIBAPI double * COINLINKAGE
541Clp_primalRowSolution(Clp_Simplex * model)
542{
543     return model->model_->primalRowSolution();
544}
545/* Primal column solution */
546COINLIBAPI double * COINLINKAGE
547Clp_primalColumnSolution(Clp_Simplex * model)
548{
549     return model->model_->primalColumnSolution();
550}
551/* Dual row solution */
552COINLIBAPI double * COINLINKAGE
553Clp_dualRowSolution(Clp_Simplex * model)
554{
555     return model->model_->dualRowSolution();
556}
557/* Reduced costs */
558COINLIBAPI double * COINLINKAGE
559Clp_dualColumnSolution(Clp_Simplex * model)
560{
561     return model->model_->dualColumnSolution();
562}
563/* Row lower */
564COINLIBAPI double* COINLINKAGE
565Clp_rowLower(Clp_Simplex * model)
566{
567     return model->model_->rowLower();
568}
569/* Row upper  */
570COINLIBAPI double* COINLINKAGE
571Clp_rowUpper(Clp_Simplex * model)
572{
573     return model->model_->rowUpper();
574}
575/* Objective */
576COINLIBAPI double * COINLINKAGE
577Clp_objective(Clp_Simplex * model)
578{
579     return model->model_->objective();
580}
581/* Column Lower */
582COINLIBAPI double * COINLINKAGE
583Clp_columnLower(Clp_Simplex * model)
584{
585     return model->model_->columnLower();
586}
587/* Column Upper */
588COINLIBAPI double * COINLINKAGE
589Clp_columnUpper(Clp_Simplex * model)
590{
591     return model->model_->columnUpper();
592}
593/* Number of elements in matrix */
594COINLIBAPI int COINLINKAGE
595Clp_getNumElements(Clp_Simplex * model)
596{
597     return model->model_->getNumElements();
598}
599// Column starts in matrix
600COINLIBAPI const CoinBigIndex * COINLINKAGE Clp_getVectorStarts(Clp_Simplex * model)
601{
602     CoinPackedMatrix * matrix;
603     matrix = model->model_->matrix();
604     return (matrix == NULL) ? NULL : matrix->getVectorStarts();
605}
606
607// Row indices in matrix
608COINLIBAPI const int * COINLINKAGE Clp_getIndices(Clp_Simplex * model)
609{
610     CoinPackedMatrix * matrix = model->model_->matrix();
611     return (matrix == NULL) ? NULL : matrix->getIndices();
612}
613
614// Column vector lengths in matrix
615COINLIBAPI const int * COINLINKAGE Clp_getVectorLengths(Clp_Simplex * model)
616{
617     CoinPackedMatrix * matrix = model->model_->matrix();
618     return (matrix == NULL) ? NULL : matrix->getVectorLengths();
619}
620
621// Element values in matrix
622COINLIBAPI const double * COINLINKAGE Clp_getElements(Clp_Simplex * model)
623{
624     CoinPackedMatrix * matrix = model->model_->matrix();
625     return (matrix == NULL) ? NULL : matrix->getElements();
626}
627/* Objective value */
628COINLIBAPI double COINLINKAGE
629Clp_objectiveValue(Clp_Simplex * model)
630{
631     return model->model_->objectiveValue();
632}
633/* Integer information */
634COINLIBAPI char * COINLINKAGE
635Clp_integerInformation(Clp_Simplex * model)
636{
637     return model->model_->integerInformation();
638}
639/* Infeasibility/unbounded ray (NULL returned if none/wrong)
640   Up to user to use free() on these arrays.  */
641COINLIBAPI double * COINLINKAGE
642Clp_infeasibilityRay(Clp_Simplex * model)
643{
644     const double * ray = model->model_->internalRay();
645     double * array = NULL;
646     int numberRows = model->model_->numberRows(); 
647     int status = model->model_->status();
648     if (status == 1 && ray) {
649          array = static_cast<double*>(malloc(numberRows*sizeof(double)));
650          memcpy(array,ray,numberRows*sizeof(double));
651#ifdef PRINT_RAY_METHOD
652          printf("Infeasibility ray obtained by algorithm %s\n",model->model_->algorithm()>0 ?
653              "primal" : "dual");
654#endif
655     }
656     return array;
657}
658COINLIBAPI double * COINLINKAGE
659Clp_unboundedRay(Clp_Simplex * model)
660{
661     const double * ray = model->model_->internalRay();
662     double * array = NULL;
663     int numberColumns = model->model_->numberColumns(); 
664     int status = model->model_->status();
665     if (status == 2 && ray) {
666          array = static_cast<double*>(malloc(numberColumns*sizeof(double)));
667          memcpy(array,ray,numberColumns*sizeof(double));
668     }
669     return array;
670}
671/* See if status array exists (partly for OsiClp) */
672COINLIBAPI int COINLINKAGE
673Clp_statusExists(Clp_Simplex * model)
674{
675     return model->model_->statusExists() ? 1 : 0;
676}
677/* Return address of status array (char[numberRows+numberColumns]) */
678COINLIBAPI unsigned char *  COINLINKAGE
679Clp_statusArray(Clp_Simplex * model)
680{
681     return model->model_->statusArray();
682}
683/* Copy in status vector */
684COINLIBAPI void COINLINKAGE
685Clp_copyinStatus(Clp_Simplex * model, const unsigned char * statusArray)
686{
687     model->model_->copyinStatus(statusArray);
688}
689
690/* User pointer for whatever reason */
691COINLIBAPI void COINLINKAGE
692Clp_setUserPointer (Clp_Simplex * model, void * pointer)
693{
694     model->model_->setUserPointer(pointer);
695}
696COINLIBAPI void * COINLINKAGE
697Clp_getUserPointer (Clp_Simplex * model)
698{
699     return model->model_->getUserPointer();
700}
701/* Pass in Callback function */
702COINLIBAPI void COINLINKAGE
703Clp_registerCallBack(Clp_Simplex * model,
704                     clp_callback userCallBack)
705{
706     // Will be copy of users one
707     delete model->handler_;
708     model->handler_ = new CMessageHandler(*(model->model_->messageHandler()));
709     model->handler_->setCallBack(userCallBack);
710     model->handler_->setModel(model);
711     model->model_->passInMessageHandler(model->handler_);
712}
713/* Unset Callback function */
714COINLIBAPI void COINLINKAGE
715Clp_clearCallBack(Clp_Simplex * model)
716{
717     delete model->handler_;
718     model->handler_ = NULL;
719}
720/* Amount of print out:
721   0 - none
722   1 - just final
723   2 - just factorizations
724   3 - as 2 plus a bit more
725   4 - verbose
726   above that 8,16,32 etc just for selective debug
727*/
728COINLIBAPI void COINLINKAGE
729Clp_setLogLevel(Clp_Simplex * model, int value)
730{
731     model->model_->setLogLevel(value);
732}
733COINLIBAPI int COINLINKAGE
734Clp_logLevel(Clp_Simplex * model)
735{
736     return model->model_->logLevel();
737}
738/* length of names (0 means no names0 */
739COINLIBAPI int COINLINKAGE
740Clp_lengthNames(Clp_Simplex * model)
741{
742     return model->model_->lengthNames();
743}
744/* Fill in array (at least lengthNames+1 long) with a row name */
745COINLIBAPI void COINLINKAGE
746Clp_rowName(Clp_Simplex * model, int iRow, char * name)
747{
748     std::string rowName = model->model_->rowName(iRow);
749     strcpy(name, rowName.c_str());
750}
751/* Fill in array (at least lengthNames+1 long) with a column name */
752COINLIBAPI void COINLINKAGE
753Clp_columnName(Clp_Simplex * model, int iColumn, char * name)
754{
755     std::string columnName = model->model_->columnName(iColumn);
756     strcpy(name, columnName.c_str());
757}
758
759/* General solve algorithm which can do presolve.
760   See  ClpSolve.hpp for options
761*/
762COINLIBAPI int COINLINKAGE
763Clp_initialSolve(Clp_Simplex * model)
764{
765     return model->model_->initialSolve();
766}
767/* Pass solve options. (Exception to direct analogue rule) */
768COINLIBAPI int COINLINKAGE
769Clp_initialSolveWithOptions(Clp_Simplex * model, Clp_Solve * s)
770{
771     return model->model_->initialSolve(s->options);
772}
773/* Barrier initial solve */
774COINLIBAPI int COINLINKAGE
775Clp_initialBarrierSolve(Clp_Simplex * model0)
776{
777     ClpSimplex *model = model0->model_;
778
779     return model->initialBarrierSolve();
780
781}
782/* Barrier initial solve */
783COINLIBAPI int COINLINKAGE
784Clp_initialBarrierNoCrossSolve(Clp_Simplex * model0)
785{
786     ClpSimplex *model = model0->model_;
787
788     return model->initialBarrierNoCrossSolve();
789
790}
791/* Dual initial solve */
792COINLIBAPI int COINLINKAGE
793Clp_initialDualSolve(Clp_Simplex * model)
794{
795     return model->model_->initialDualSolve();
796}
797/* Primal initial solve */
798COINLIBAPI int COINLINKAGE
799Clp_initialPrimalSolve(Clp_Simplex * model)
800{
801     return model->model_->initialPrimalSolve();
802}
803/* Dual algorithm - see ClpSimplexDual.hpp for method */
804COINLIBAPI int COINLINKAGE
805Clp_dual(Clp_Simplex * model, int ifValuesPass)
806{
807     return model->model_->dual(ifValuesPass);
808}
809/* Primal algorithm - see ClpSimplexPrimal.hpp for method */
810COINLIBAPI int COINLINKAGE
811Clp_primal(Clp_Simplex * model, int ifValuesPass)
812{
813     return model->model_->primal(ifValuesPass);
814}
815/* Sets or unsets scaling, 0 -off, 1 equilibrium, 2 geometric, 3, auto, 4 dynamic(later) */
816COINLIBAPI void COINLINKAGE
817Clp_scaling(Clp_Simplex * model, int mode)
818{
819     model->model_->scaling(mode);
820}
821/* Gets scalingFlag */
822COINLIBAPI int COINLINKAGE
823Clp_scalingFlag(Clp_Simplex * model)
824{
825     return model->model_->scalingFlag();
826}
827/* Crash - at present just aimed at dual, returns
828   -2 if dual preferred and crash basis created
829   -1 if dual preferred and all slack basis preferred
830   0 if basis going in was not all slack
831   1 if primal preferred and all slack basis preferred
832   2 if primal preferred and crash basis created.
833
834   if gap between bounds <="gap" variables can be flipped
835
836   If "pivot" is
837   0 No pivoting (so will just be choice of algorithm)
838   1 Simple pivoting e.g. gub
839   2 Mini iterations
840*/
841COINLIBAPI int COINLINKAGE
842Clp_crash(Clp_Simplex * model, double gap, int pivot)
843{
844     return model->model_->crash(gap, pivot);
845}
846/* If problem is primal feasible */
847COINLIBAPI int COINLINKAGE
848Clp_primalFeasible(Clp_Simplex * model)
849{
850     return model->model_->primalFeasible() ? 1 : 0;
851}
852/* If problem is dual feasible */
853COINLIBAPI int COINLINKAGE
854Clp_dualFeasible(Clp_Simplex * model)
855{
856     return model->model_->dualFeasible() ? 1 : 0;
857}
858/* Dual bound */
859COINLIBAPI double COINLINKAGE
860Clp_dualBound(Clp_Simplex * model)
861{
862     return model->model_->dualBound();
863}
864COINLIBAPI void COINLINKAGE
865Clp_setDualBound(Clp_Simplex * model, double value)
866{
867     model->model_->setDualBound(value);
868}
869/* Infeasibility cost */
870COINLIBAPI double COINLINKAGE
871Clp_infeasibilityCost(Clp_Simplex * model)
872{
873     return model->model_->infeasibilityCost();
874}
875COINLIBAPI void COINLINKAGE
876Clp_setInfeasibilityCost(Clp_Simplex * model, double value)
877{
878     model->model_->setInfeasibilityCost(value);
879}
880/* Perturbation:
881   50  - switch on perturbation
882   100 - auto perturb if takes too long (1.0e-6 largest nonzero)
883   101 - we are perturbed
884   102 - don't try perturbing again
885   default is 100
886   others are for playing
887*/
888COINLIBAPI int COINLINKAGE
889Clp_perturbation(Clp_Simplex * model)
890{
891     return model->model_->perturbation();
892}
893COINLIBAPI void COINLINKAGE
894Clp_setPerturbation(Clp_Simplex * model, int value)
895{
896     model->model_->setPerturbation(value);
897}
898/* Current (or last) algorithm */
899COINLIBAPI int COINLINKAGE
900Clp_algorithm(Clp_Simplex * model)
901{
902     return model->model_->algorithm();
903}
904/* Set algorithm */
905COINLIBAPI void COINLINKAGE
906Clp_setAlgorithm(Clp_Simplex * model, int value)
907{
908     model->model_->setAlgorithm(value);
909}
910/* Sum of dual infeasibilities */
911COINLIBAPI double COINLINKAGE
912Clp_sumDualInfeasibilities(Clp_Simplex * model)
913{
914     return model->model_->sumDualInfeasibilities();
915}
916/* Number of dual infeasibilities */
917COINLIBAPI int COINLINKAGE
918Clp_numberDualInfeasibilities(Clp_Simplex * model)
919{
920     return model->model_->numberDualInfeasibilities();
921}
922/* Sum of primal infeasibilities */
923COINLIBAPI double COINLINKAGE
924Clp_sumPrimalInfeasibilities(Clp_Simplex * model)
925{
926     return model->model_->sumPrimalInfeasibilities();
927}
928/* Number of primal infeasibilities */
929COINLIBAPI int COINLINKAGE
930Clp_numberPrimalInfeasibilities(Clp_Simplex * model)
931{
932     return model->model_->numberPrimalInfeasibilities();
933}
934/* Save model to file, returns 0 if success.  This is designed for
935   use outside algorithms so does not save iterating arrays etc.
936   It does not save any messaging information.
937   Does not save scaling values.
938   It does not know about all types of virtual functions.
939*/
940COINLIBAPI int COINLINKAGE
941Clp_saveModel(Clp_Simplex * model, const char * fileName)
942{
943     return model->model_->saveModel(fileName);
944}
945/* Restore model from file, returns 0 if success,
946   deletes current model */
947COINLIBAPI int COINLINKAGE
948Clp_restoreModel(Clp_Simplex * model, const char * fileName)
949{
950     return model->model_->restoreModel(fileName);
951}
952
953/* Just check solution (for external use) - sets sum of
954   infeasibilities etc */
955COINLIBAPI void COINLINKAGE
956Clp_checkSolution(Clp_Simplex * model)
957{
958     model->model_->checkSolution();
959}
960/* Number of rows */
961COINLIBAPI int COINLINKAGE
962Clp_getNumRows(Clp_Simplex * model)
963{
964     return model->model_->getNumRows();
965}
966/* Number of columns */
967COINLIBAPI int COINLINKAGE
968Clp_getNumCols(Clp_Simplex * model)
969{
970     return model->model_->getNumCols();
971}
972/* Number of iterations */
973COINLIBAPI int COINLINKAGE
974Clp_getIterationCount(Clp_Simplex * model)
975{
976     return model->model_->getIterationCount();
977}
978/* Are there a numerical difficulties? */
979COINLIBAPI int COINLINKAGE
980Clp_isAbandoned(Clp_Simplex * model)
981{
982     return model->model_->isAbandoned() ? 1 : 0;
983}
984/* Is optimality proven? */
985COINLIBAPI int COINLINKAGE
986Clp_isProvenOptimal(Clp_Simplex * model)
987{
988     return model->model_->isProvenOptimal() ? 1 : 0;
989}
990/* Is primal infeasiblity proven? */
991COINLIBAPI int COINLINKAGE
992Clp_isProvenPrimalInfeasible(Clp_Simplex * model)
993{
994     return model->model_->isProvenPrimalInfeasible() ? 1 : 0;
995}
996/* Is dual infeasiblity proven? */
997COINLIBAPI int COINLINKAGE
998Clp_isProvenDualInfeasible(Clp_Simplex * model)
999{
1000     return model->model_->isProvenDualInfeasible() ? 1 : 0;
1001}
1002/* Is the given primal objective limit reached? */
1003COINLIBAPI int COINLINKAGE
1004Clp_isPrimalObjectiveLimitReached(Clp_Simplex * model)
1005{
1006     return model->model_->isPrimalObjectiveLimitReached() ? 1 : 0;
1007}
1008/* Is the given dual objective limit reached? */
1009COINLIBAPI int COINLINKAGE
1010Clp_isDualObjectiveLimitReached(Clp_Simplex * model)
1011{
1012     return model->model_->isDualObjectiveLimitReached() ? 1 : 0;
1013}
1014/* Iteration limit reached? */
1015COINLIBAPI int COINLINKAGE
1016Clp_isIterationLimitReached(Clp_Simplex * model)
1017{
1018     return model->model_->isIterationLimitReached() ? 1 : 0;
1019}
1020/* Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore */
1021COINLIBAPI double COINLINKAGE
1022Clp_getObjSense(Clp_Simplex * model)
1023{
1024     return model->model_->getObjSense();
1025}
1026/* Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore */
1027COINLIBAPI void COINLINKAGE
1028Clp_setObjSense(Clp_Simplex * model, double objsen)
1029{
1030     model->model_->setOptimizationDirection(objsen);
1031}
1032/* Primal row solution */
1033COINLIBAPI const double * COINLINKAGE
1034Clp_getRowActivity(Clp_Simplex * model)
1035{
1036     return model->model_->getRowActivity();
1037}
1038/* Primal column solution */
1039COINLIBAPI const double * COINLINKAGE
1040Clp_getColSolution(Clp_Simplex * model)
1041{
1042     return model->model_->getColSolution();
1043}
1044COINLIBAPI void COINLINKAGE
1045Clp_setColSolution(Clp_Simplex * model, const double * input)
1046{
1047     model->model_->setColSolution(input);
1048}
1049/* Dual row solution */
1050COINLIBAPI const double * COINLINKAGE
1051Clp_getRowPrice(Clp_Simplex * model)
1052{
1053     return model->model_->getRowPrice();
1054}
1055/* Reduced costs */
1056COINLIBAPI const double * COINLINKAGE
1057Clp_getReducedCost(Clp_Simplex * model)
1058{
1059     return model->model_->getReducedCost();
1060}
1061/* Row lower */
1062COINLIBAPI const double* COINLINKAGE
1063Clp_getRowLower(Clp_Simplex * model)
1064{
1065     return model->model_->getRowLower();
1066}
1067/* Row upper  */
1068COINLIBAPI const double* COINLINKAGE
1069Clp_getRowUpper(Clp_Simplex * model)
1070{
1071     return model->model_->getRowUpper();
1072}
1073/* Objective */
1074COINLIBAPI const double * COINLINKAGE
1075Clp_getObjCoefficients(Clp_Simplex * model)
1076{
1077     return model->model_->getObjCoefficients();
1078}
1079/* Column Lower */
1080COINLIBAPI const double * COINLINKAGE
1081Clp_getColLower(Clp_Simplex * model)
1082{
1083     return model->model_->getColLower();
1084}
1085/* Column Upper */
1086COINLIBAPI const double * COINLINKAGE
1087Clp_getColUpper(Clp_Simplex * model)
1088{
1089     return model->model_->getColUpper();
1090}
1091/* Objective value */
1092COINLIBAPI double COINLINKAGE
1093Clp_getObjValue(Clp_Simplex * model)
1094{
1095     return model->model_->getObjValue();
1096}
1097/* Get variable basis info */
1098COINLIBAPI int COINLINKAGE
1099Clp_getColumnStatus(Clp_Simplex * model, int sequence)
1100{
1101     return (int) model->model_->getColumnStatus(sequence);
1102}
1103/* Get row basis info */
1104COINLIBAPI int COINLINKAGE
1105Clp_getRowStatus(Clp_Simplex * model, int sequence)
1106{
1107     return (int) model->model_->getRowStatus(sequence);
1108}
1109/* Set variable basis info */
1110COINLIBAPI void COINLINKAGE
1111Clp_setColumnStatus(Clp_Simplex * model, int sequence, int value)
1112{
1113     if (value >= 0 && value <= 5) {
1114          model->model_->setColumnStatus(sequence, (ClpSimplex::Status) value );
1115          if (value == 3 || value == 5)
1116               model->model_->primalColumnSolution()[sequence] =
1117                    model->model_->columnLower()[sequence];
1118          else if (value == 2)
1119               model->model_->primalColumnSolution()[sequence] =
1120                    model->model_->columnUpper()[sequence];
1121     }
1122}
1123/* Set row basis info */
1124COINLIBAPI void COINLINKAGE
1125Clp_setRowStatus(Clp_Simplex * model, int sequence, int value)
1126{
1127     if (value >= 0 && value <= 5) {
1128          model->model_->setRowStatus(sequence, (ClpSimplex::Status) value );
1129          if (value == 3 || value == 5)
1130               model->model_->primalRowSolution()[sequence] =
1131                    model->model_->rowLower()[sequence];
1132          else if (value == 2)
1133               model->model_->primalRowSolution()[sequence] =
1134                    model->model_->rowUpper()[sequence];
1135     }
1136}
1137/* Small element value - elements less than this set to zero,
1138   default is 1.0e-20 */
1139COINLIBAPI double COINLINKAGE
1140Clp_getSmallElementValue(Clp_Simplex * model)
1141{
1142     return model->model_->getSmallElementValue();
1143}
1144COINLIBAPI void COINLINKAGE
1145Clp_setSmallElementValue(Clp_Simplex * model, double value)
1146{
1147     model->model_->setSmallElementValue(value);
1148}
1149/* Print model */
1150COINLIBAPI void COINLINKAGE
1151Clp_printModel(Clp_Simplex * model, const char * prefix)
1152{
1153     ClpSimplex *clp_simplex = model->model_;
1154     int numrows    = clp_simplex->numberRows();
1155     int numcols    = clp_simplex->numberColumns();
1156     int numelem    = clp_simplex->getNumElements();
1157     const CoinBigIndex *start = clp_simplex->matrix()->getVectorStarts();
1158     const int *index     = clp_simplex->matrix()->getIndices();
1159     const double *value  = clp_simplex->matrix()->getElements();
1160     const double *collb  = model->model_->columnLower();
1161     const double *colub  = model->model_->columnUpper();
1162     const double *obj    = model->model_->objective();
1163     const double *rowlb  = model->model_->rowLower();
1164     const double *rowub  = model->model_->rowUpper();
1165     printf("%s numcols = %i, numrows = %i, numelem = %i\n",
1166            prefix, numcols, numrows, numelem);
1167     printf("%s model = %p, start = %p, index = %p, value = %p\n",
1168            prefix, reinterpret_cast<const void *>(model), reinterpret_cast<const void *>(start), reinterpret_cast<const void *>(index), reinterpret_cast<const void *>(value));
1169     clp_simplex->matrix()->dumpMatrix(NULL);
1170     {
1171          int i;
1172          for (i = 0; i <= numcols; i++)
1173               printf("%s start[%i] = %i\n", prefix, i, start[i]);
1174          for (i = 0; i < numelem; i++)
1175               printf("%s index[%i] = %i, value[%i] = %g\n",
1176                      prefix, i, index[i], i, value[i]);
1177     }
1178
1179     printf("%s collb = %p, colub = %p, obj = %p, rowlb = %p, rowub = %p\n",
1180            prefix, reinterpret_cast<const void *>(collb), reinterpret_cast<const void *>(colub), reinterpret_cast<const void *>(obj), reinterpret_cast<const void *>(rowlb), reinterpret_cast<const void *>(rowub));
1181     printf("%s optimization direction = %g\n", prefix, Clp_optimizationDirection(model));
1182     printf("  (1 - minimize, -1 - maximize, 0 - ignore)\n");
1183     {
1184          int i;
1185          for (i = 0; i < numcols; i++)
1186               printf("%s collb[%i] = %g, colub[%i] = %g, obj[%i] = %g\n",
1187                      prefix, i, collb[i], i, colub[i], i, obj[i]);
1188          for (i = 0; i < numrows; i++)
1189               printf("%s rowlb[%i] = %g, rowub[%i] = %g\n",
1190                      prefix, i, rowlb[i], i, rowub[i]);
1191     }
1192}
1193
1194#ifndef SLIM_CLP
1195/** Solve the problem with the idiot code */
1196/* tryhard values:
1197   tryhard & 7:
1198      0: NOT lightweight, 105 iterations within a pass (when mu stays fixed)
1199      1: lightweight, but focus more on optimality (mu is high)
1200         (23 iters in a pass)
1201      2: lightweight, but focus more on feasibility (11 iters in a pass)
1202      3: lightweight, but focus more on feasibility (23 iters in a pass, so it
1203         goes closer to opt than option 2)
1204   tryhard >> 3:
1205      number of passes, the larger the number the closer it gets to optimality
1206*/
1207COINLIBAPI void COINLINKAGE
1208Clp_idiot(Clp_Simplex * model, int tryhard)
1209{
1210     ClpSimplex *clp = model->model_;
1211     Idiot info(*clp);
1212     int numberpass = tryhard >> 3;
1213     int lightweight = tryhard & 7;
1214     info.setLightweight(lightweight);
1215     info.crash(numberpass, clp->messageHandler(), clp->messagesPointer(), false);
1216}
1217#endif
1218
1219COINLIBAPI Clp_Solve * COINLINKAGE
1220ClpSolve_new() 
1221{ 
1222    return new Clp_Solve(); 
1223}
1224
1225COINLIBAPI void COINLINKAGE
1226ClpSolve_delete(Clp_Solve * solve) 
1227{ 
1228    delete solve; 
1229}
1230
1231// space- and error-saving macros
1232#define ClpSolveGetIntProperty(prop) \
1233COINLIBAPI int COINLINKAGE \
1234ClpSolve_ ## prop (Clp_Solve *s) \
1235{ \
1236    return s->options.prop(); \
1237}
1238
1239#define ClpSolveSetIntProperty(prop) \
1240COINLIBAPI void COINLINKAGE \
1241ClpSolve_ ## prop (Clp_Solve *s, int val) \
1242{ \
1243    s->options.prop(val); \
1244}
1245
1246COINLIBAPI void COINLINKAGE
1247ClpSolve_setSpecialOption(Clp_Solve * s, int which, int value, int extraInfo) 
1248{
1249    s->options.setSpecialOption(which,value,extraInfo);
1250}
1251
1252COINLIBAPI int COINLINKAGE
1253ClpSolve_getSpecialOption(Clp_Solve * s, int which)
1254{
1255    return s->options.getSpecialOption(which);
1256}
1257
1258COINLIBAPI void COINLINKAGE
1259ClpSolve_setSolveType(Clp_Solve * s, int method, int extraInfo)
1260{
1261    s->options.setSolveType(static_cast<ClpSolve::SolveType>(method), extraInfo);
1262}
1263
1264ClpSolveGetIntProperty(getSolveType)
1265
1266COINLIBAPI void COINLINKAGE ClpSolve_setPresolveType(Clp_Solve * s, int amount, int extraInfo)
1267{
1268    s->options.setPresolveType(static_cast<ClpSolve::PresolveType>(amount),extraInfo);
1269}
1270
1271ClpSolveGetIntProperty(getPresolveType)
1272
1273ClpSolveGetIntProperty(getPresolvePasses)
1274
1275
1276COINLIBAPI int COINLINKAGE
1277ClpSolve_getExtraInfo(Clp_Solve * s, int which) {
1278     return s->options.getExtraInfo(which);
1279}
1280
1281ClpSolveSetIntProperty(setInfeasibleReturn)
1282ClpSolveGetIntProperty(infeasibleReturn)
1283
1284ClpSolveGetIntProperty(doDual)
1285ClpSolveSetIntProperty(setDoDual)
1286
1287ClpSolveGetIntProperty(doSingleton)
1288ClpSolveSetIntProperty(setDoSingleton)
1289
1290ClpSolveGetIntProperty(doDoubleton)
1291ClpSolveSetIntProperty(setDoDoubleton)
1292
1293ClpSolveGetIntProperty(doTripleton)
1294ClpSolveSetIntProperty(setDoTripleton)
1295
1296ClpSolveGetIntProperty(doTighten)
1297ClpSolveSetIntProperty(setDoTighten)
1298
1299ClpSolveGetIntProperty(doForcing)
1300ClpSolveSetIntProperty(setDoForcing)
1301
1302ClpSolveGetIntProperty(doImpliedFree)
1303ClpSolveSetIntProperty(setDoImpliedFree)
1304
1305ClpSolveGetIntProperty(doDupcol)
1306ClpSolveSetIntProperty(setDoDupcol)
1307
1308ClpSolveGetIntProperty(doDuprow)
1309ClpSolveSetIntProperty(setDoDuprow)
1310
1311ClpSolveGetIntProperty(doSingletonColumn)
1312ClpSolveSetIntProperty(setDoSingletonColumn)
1313
1314ClpSolveGetIntProperty(presolveActions)
1315ClpSolveSetIntProperty(setPresolveActions)
1316
1317ClpSolveGetIntProperty(substitution)
1318ClpSolveSetIntProperty(setSubstitution)
1319
1320#if defined(__MWERKS__)
1321#pragma export off
1322#endif
1323
Note: See TracBrowser for help on using the repository browser.