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

Last change on this file since 1901 was 1901, checked in by stefan, 7 years ago

patch by Miles Lubin to get malloc'ed arrays in C interface ray methods

  • Property svn:eol-style set to native
  • Property svn:keywords set to Id
File size: 35.6 KB
Line 
1// $Id: Clp_C_Interface.cpp 1901 2012-12-18 20:12:42Z stefan $
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#ifndef CLP_NO_SWAP_SIGN
652          // swap signs to be consistent with norm
653          for (int i = 0; i < numberRows; i++)
654               array[i] = -array[i];
655#endif
656     }
657     return array;
658}
659COINLIBAPI double * COINLINKAGE
660Clp_unboundedRay(Clp_Simplex * model)
661{
662     const double * ray = model->model_->internalRay();
663     double * array = NULL;
664     int numberColumns = model->model_->numberColumns(); 
665     int status = model->model_->status();
666     if (status == 2 && ray) {
667          array = static_cast<double*>(malloc(numberColumns*sizeof(double)));
668          memcpy(array,ray,numberColumns*sizeof(double));
669     }
670     return array;
671}
672/* See if status array exists (partly for OsiClp) */
673COINLIBAPI int COINLINKAGE
674Clp_statusExists(Clp_Simplex * model)
675{
676     return model->model_->statusExists() ? 1 : 0;
677}
678/* Return address of status array (char[numberRows+numberColumns]) */
679COINLIBAPI unsigned char *  COINLINKAGE
680Clp_statusArray(Clp_Simplex * model)
681{
682     return model->model_->statusArray();
683}
684/* Copy in status vector */
685COINLIBAPI void COINLINKAGE
686Clp_copyinStatus(Clp_Simplex * model, const unsigned char * statusArray)
687{
688     model->model_->copyinStatus(statusArray);
689}
690
691/* User pointer for whatever reason */
692COINLIBAPI void COINLINKAGE
693Clp_setUserPointer (Clp_Simplex * model, void * pointer)
694{
695     model->model_->setUserPointer(pointer);
696}
697COINLIBAPI void * COINLINKAGE
698Clp_getUserPointer (Clp_Simplex * model)
699{
700     return model->model_->getUserPointer();
701}
702/* Pass in Callback function */
703COINLIBAPI void COINLINKAGE
704Clp_registerCallBack(Clp_Simplex * model,
705                     clp_callback userCallBack)
706{
707     // Will be copy of users one
708     delete model->handler_;
709     model->handler_ = new CMessageHandler(*(model->model_->messageHandler()));
710     model->handler_->setCallBack(userCallBack);
711     model->handler_->setModel(model);
712     model->model_->passInMessageHandler(model->handler_);
713}
714/* Unset Callback function */
715COINLIBAPI void COINLINKAGE
716Clp_clearCallBack(Clp_Simplex * model)
717{
718     delete model->handler_;
719     model->handler_ = NULL;
720}
721/* Amount of print out:
722   0 - none
723   1 - just final
724   2 - just factorizations
725   3 - as 2 plus a bit more
726   4 - verbose
727   above that 8,16,32 etc just for selective debug
728*/
729COINLIBAPI void COINLINKAGE
730Clp_setLogLevel(Clp_Simplex * model, int value)
731{
732     model->model_->setLogLevel(value);
733}
734COINLIBAPI int COINLINKAGE
735Clp_logLevel(Clp_Simplex * model)
736{
737     return model->model_->logLevel();
738}
739/* length of names (0 means no names0 */
740COINLIBAPI int COINLINKAGE
741Clp_lengthNames(Clp_Simplex * model)
742{
743     return model->model_->lengthNames();
744}
745/* Fill in array (at least lengthNames+1 long) with a row name */
746COINLIBAPI void COINLINKAGE
747Clp_rowName(Clp_Simplex * model, int iRow, char * name)
748{
749     std::string rowName = model->model_->rowName(iRow);
750     strcpy(name, rowName.c_str());
751}
752/* Fill in array (at least lengthNames+1 long) with a column name */
753COINLIBAPI void COINLINKAGE
754Clp_columnName(Clp_Simplex * model, int iColumn, char * name)
755{
756     std::string columnName = model->model_->columnName(iColumn);
757     strcpy(name, columnName.c_str());
758}
759
760/* General solve algorithm which can do presolve.
761   See  ClpSolve.hpp for options
762*/
763COINLIBAPI int COINLINKAGE
764Clp_initialSolve(Clp_Simplex * model)
765{
766     return model->model_->initialSolve();
767}
768/* Barrier initial solve */
769COINLIBAPI int COINLINKAGE
770Clp_initialBarrierSolve(Clp_Simplex * model0)
771{
772     ClpSimplex *model = model0->model_;
773
774     return model->initialBarrierSolve();
775
776}
777/* Barrier initial solve */
778COINLIBAPI int COINLINKAGE
779Clp_initialBarrierNoCrossSolve(Clp_Simplex * model0)
780{
781     ClpSimplex *model = model0->model_;
782
783     return model->initialBarrierNoCrossSolve();
784
785}
786/* Dual initial solve */
787COINLIBAPI int COINLINKAGE
788Clp_initialDualSolve(Clp_Simplex * model)
789{
790     return model->model_->initialDualSolve();
791}
792/* Primal initial solve */
793COINLIBAPI int COINLINKAGE
794Clp_initialPrimalSolve(Clp_Simplex * model)
795{
796     return model->model_->initialPrimalSolve();
797}
798/* Dual algorithm - see ClpSimplexDual.hpp for method */
799COINLIBAPI int COINLINKAGE
800Clp_dual(Clp_Simplex * model, int ifValuesPass)
801{
802     return model->model_->dual(ifValuesPass);
803}
804/* Primal algorithm - see ClpSimplexPrimal.hpp for method */
805COINLIBAPI int COINLINKAGE
806Clp_primal(Clp_Simplex * model, int ifValuesPass)
807{
808     return model->model_->primal(ifValuesPass);
809}
810/* Sets or unsets scaling, 0 -off, 1 equilibrium, 2 geometric, 3, auto, 4 dynamic(later) */
811COINLIBAPI void COINLINKAGE
812Clp_scaling(Clp_Simplex * model, int mode)
813{
814     model->model_->scaling(mode);
815}
816/* Gets scalingFlag */
817COINLIBAPI int COINLINKAGE
818Clp_scalingFlag(Clp_Simplex * model)
819{
820     return model->model_->scalingFlag();
821}
822/* Crash - at present just aimed at dual, returns
823   -2 if dual preferred and crash basis created
824   -1 if dual preferred and all slack basis preferred
825   0 if basis going in was not all slack
826   1 if primal preferred and all slack basis preferred
827   2 if primal preferred and crash basis created.
828
829   if gap between bounds <="gap" variables can be flipped
830
831   If "pivot" is
832   0 No pivoting (so will just be choice of algorithm)
833   1 Simple pivoting e.g. gub
834   2 Mini iterations
835*/
836COINLIBAPI int COINLINKAGE
837Clp_crash(Clp_Simplex * model, double gap, int pivot)
838{
839     return model->model_->crash(gap, pivot);
840}
841/* If problem is primal feasible */
842COINLIBAPI int COINLINKAGE
843Clp_primalFeasible(Clp_Simplex * model)
844{
845     return model->model_->primalFeasible() ? 1 : 0;
846}
847/* If problem is dual feasible */
848COINLIBAPI int COINLINKAGE
849Clp_dualFeasible(Clp_Simplex * model)
850{
851     return model->model_->dualFeasible() ? 1 : 0;
852}
853/* Dual bound */
854COINLIBAPI double COINLINKAGE
855Clp_dualBound(Clp_Simplex * model)
856{
857     return model->model_->dualBound();
858}
859COINLIBAPI void COINLINKAGE
860Clp_setDualBound(Clp_Simplex * model, double value)
861{
862     model->model_->setDualBound(value);
863}
864/* Infeasibility cost */
865COINLIBAPI double COINLINKAGE
866Clp_infeasibilityCost(Clp_Simplex * model)
867{
868     return model->model_->infeasibilityCost();
869}
870COINLIBAPI void COINLINKAGE
871Clp_setInfeasibilityCost(Clp_Simplex * model, double value)
872{
873     model->model_->setInfeasibilityCost(value);
874}
875/* Perturbation:
876   50  - switch on perturbation
877   100 - auto perturb if takes too long (1.0e-6 largest nonzero)
878   101 - we are perturbed
879   102 - don't try perturbing again
880   default is 100
881   others are for playing
882*/
883COINLIBAPI int COINLINKAGE
884Clp_perturbation(Clp_Simplex * model)
885{
886     return model->model_->perturbation();
887}
888COINLIBAPI void COINLINKAGE
889Clp_setPerturbation(Clp_Simplex * model, int value)
890{
891     model->model_->setPerturbation(value);
892}
893/* Current (or last) algorithm */
894COINLIBAPI int COINLINKAGE
895Clp_algorithm(Clp_Simplex * model)
896{
897     return model->model_->algorithm();
898}
899/* Set algorithm */
900COINLIBAPI void COINLINKAGE
901Clp_setAlgorithm(Clp_Simplex * model, int value)
902{
903     model->model_->setAlgorithm(value);
904}
905/* Sum of dual infeasibilities */
906COINLIBAPI double COINLINKAGE
907Clp_sumDualInfeasibilities(Clp_Simplex * model)
908{
909     return model->model_->sumDualInfeasibilities();
910}
911/* Number of dual infeasibilities */
912COINLIBAPI int COINLINKAGE
913Clp_numberDualInfeasibilities(Clp_Simplex * model)
914{
915     return model->model_->numberDualInfeasibilities();
916}
917/* Sum of primal infeasibilities */
918COINLIBAPI double COINLINKAGE
919Clp_sumPrimalInfeasibilities(Clp_Simplex * model)
920{
921     return model->model_->sumPrimalInfeasibilities();
922}
923/* Number of primal infeasibilities */
924COINLIBAPI int COINLINKAGE
925Clp_numberPrimalInfeasibilities(Clp_Simplex * model)
926{
927     return model->model_->numberPrimalInfeasibilities();
928}
929/* Save model to file, returns 0 if success.  This is designed for
930   use outside algorithms so does not save iterating arrays etc.
931   It does not save any messaging information.
932   Does not save scaling values.
933   It does not know about all types of virtual functions.
934*/
935COINLIBAPI int COINLINKAGE
936Clp_saveModel(Clp_Simplex * model, const char * fileName)
937{
938     return model->model_->saveModel(fileName);
939}
940/* Restore model from file, returns 0 if success,
941   deletes current model */
942COINLIBAPI int COINLINKAGE
943Clp_restoreModel(Clp_Simplex * model, const char * fileName)
944{
945     return model->model_->restoreModel(fileName);
946}
947
948/* Just check solution (for external use) - sets sum of
949   infeasibilities etc */
950COINLIBAPI void COINLINKAGE
951Clp_checkSolution(Clp_Simplex * model)
952{
953     model->model_->checkSolution();
954}
955/* Number of rows */
956COINLIBAPI int COINLINKAGE
957Clp_getNumRows(Clp_Simplex * model)
958{
959     return model->model_->getNumRows();
960}
961/* Number of columns */
962COINLIBAPI int COINLINKAGE
963Clp_getNumCols(Clp_Simplex * model)
964{
965     return model->model_->getNumCols();
966}
967/* Number of iterations */
968COINLIBAPI int COINLINKAGE
969Clp_getIterationCount(Clp_Simplex * model)
970{
971     return model->model_->getIterationCount();
972}
973/* Are there a numerical difficulties? */
974COINLIBAPI int COINLINKAGE
975Clp_isAbandoned(Clp_Simplex * model)
976{
977     return model->model_->isAbandoned() ? 1 : 0;
978}
979/* Is optimality proven? */
980COINLIBAPI int COINLINKAGE
981Clp_isProvenOptimal(Clp_Simplex * model)
982{
983     return model->model_->isProvenOptimal() ? 1 : 0;
984}
985/* Is primal infeasiblity proven? */
986COINLIBAPI int COINLINKAGE
987Clp_isProvenPrimalInfeasible(Clp_Simplex * model)
988{
989     return model->model_->isProvenPrimalInfeasible() ? 1 : 0;
990}
991/* Is dual infeasiblity proven? */
992COINLIBAPI int COINLINKAGE
993Clp_isProvenDualInfeasible(Clp_Simplex * model)
994{
995     return model->model_->isProvenDualInfeasible() ? 1 : 0;
996}
997/* Is the given primal objective limit reached? */
998COINLIBAPI int COINLINKAGE
999Clp_isPrimalObjectiveLimitReached(Clp_Simplex * model)
1000{
1001     return model->model_->isPrimalObjectiveLimitReached() ? 1 : 0;
1002}
1003/* Is the given dual objective limit reached? */
1004COINLIBAPI int COINLINKAGE
1005Clp_isDualObjectiveLimitReached(Clp_Simplex * model)
1006{
1007     return model->model_->isDualObjectiveLimitReached() ? 1 : 0;
1008}
1009/* Iteration limit reached? */
1010COINLIBAPI int COINLINKAGE
1011Clp_isIterationLimitReached(Clp_Simplex * model)
1012{
1013     return model->model_->isIterationLimitReached() ? 1 : 0;
1014}
1015/* Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore */
1016COINLIBAPI double COINLINKAGE
1017Clp_getObjSense(Clp_Simplex * model)
1018{
1019     return model->model_->getObjSense();
1020}
1021/* Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore */
1022COINLIBAPI void COINLINKAGE
1023Clp_setObjSense(Clp_Simplex * model, double objsen)
1024{
1025     model->model_->setOptimizationDirection(objsen);
1026}
1027/* Primal row solution */
1028COINLIBAPI const double * COINLINKAGE
1029Clp_getRowActivity(Clp_Simplex * model)
1030{
1031     return model->model_->getRowActivity();
1032}
1033/* Primal column solution */
1034COINLIBAPI const double * COINLINKAGE
1035Clp_getColSolution(Clp_Simplex * model)
1036{
1037     return model->model_->getColSolution();
1038}
1039COINLIBAPI void COINLINKAGE
1040Clp_setColSolution(Clp_Simplex * model, const double * input)
1041{
1042     model->model_->setColSolution(input);
1043}
1044/* Dual row solution */
1045COINLIBAPI const double * COINLINKAGE
1046Clp_getRowPrice(Clp_Simplex * model)
1047{
1048     return model->model_->getRowPrice();
1049}
1050/* Reduced costs */
1051COINLIBAPI const double * COINLINKAGE
1052Clp_getReducedCost(Clp_Simplex * model)
1053{
1054     return model->model_->getReducedCost();
1055}
1056/* Row lower */
1057COINLIBAPI const double* COINLINKAGE
1058Clp_getRowLower(Clp_Simplex * model)
1059{
1060     return model->model_->getRowLower();
1061}
1062/* Row upper  */
1063COINLIBAPI const double* COINLINKAGE
1064Clp_getRowUpper(Clp_Simplex * model)
1065{
1066     return model->model_->getRowUpper();
1067}
1068/* Objective */
1069COINLIBAPI const double * COINLINKAGE
1070Clp_getObjCoefficients(Clp_Simplex * model)
1071{
1072     return model->model_->getObjCoefficients();
1073}
1074/* Column Lower */
1075COINLIBAPI const double * COINLINKAGE
1076Clp_getColLower(Clp_Simplex * model)
1077{
1078     return model->model_->getColLower();
1079}
1080/* Column Upper */
1081COINLIBAPI const double * COINLINKAGE
1082Clp_getColUpper(Clp_Simplex * model)
1083{
1084     return model->model_->getColUpper();
1085}
1086/* Objective value */
1087COINLIBAPI double COINLINKAGE
1088Clp_getObjValue(Clp_Simplex * model)
1089{
1090     return model->model_->getObjValue();
1091}
1092/* Get variable basis info */
1093COINLIBAPI int COINLINKAGE
1094Clp_getColumnStatus(Clp_Simplex * model, int sequence)
1095{
1096     return (int) model->model_->getColumnStatus(sequence);
1097}
1098/* Get row basis info */
1099COINLIBAPI int COINLINKAGE
1100Clp_getRowStatus(Clp_Simplex * model, int sequence)
1101{
1102     return (int) model->model_->getRowStatus(sequence);
1103}
1104/* Set variable basis info */
1105COINLIBAPI void COINLINKAGE
1106Clp_setColumnStatus(Clp_Simplex * model, int sequence, int value)
1107{
1108     if (value >= 0 && value <= 5) {
1109          model->model_->setColumnStatus(sequence, (ClpSimplex::Status) value );
1110          if (value == 3 || value == 5)
1111               model->model_->primalColumnSolution()[sequence] =
1112                    model->model_->columnLower()[sequence];
1113          else if (value == 2)
1114               model->model_->primalColumnSolution()[sequence] =
1115                    model->model_->columnUpper()[sequence];
1116     }
1117}
1118/* Set row basis info */
1119COINLIBAPI void COINLINKAGE
1120Clp_setRowStatus(Clp_Simplex * model, int sequence, int value)
1121{
1122     if (value >= 0 && value <= 5) {
1123          model->model_->setRowStatus(sequence, (ClpSimplex::Status) value );
1124          if (value == 3 || value == 5)
1125               model->model_->primalRowSolution()[sequence] =
1126                    model->model_->rowLower()[sequence];
1127          else if (value == 2)
1128               model->model_->primalRowSolution()[sequence] =
1129                    model->model_->rowUpper()[sequence];
1130     }
1131}
1132/* Small element value - elements less than this set to zero,
1133   default is 1.0e-20 */
1134COINLIBAPI double COINLINKAGE
1135Clp_getSmallElementValue(Clp_Simplex * model)
1136{
1137     return model->model_->getSmallElementValue();
1138}
1139COINLIBAPI void COINLINKAGE
1140Clp_setSmallElementValue(Clp_Simplex * model, double value)
1141{
1142     model->model_->setSmallElementValue(value);
1143}
1144/* Print model */
1145COINLIBAPI void COINLINKAGE
1146Clp_printModel(Clp_Simplex * model, const char * prefix)
1147{
1148     ClpSimplex *clp_simplex = model->model_;
1149     int numrows    = clp_simplex->numberRows();
1150     int numcols    = clp_simplex->numberColumns();
1151     int numelem    = clp_simplex->getNumElements();
1152     const CoinBigIndex *start = clp_simplex->matrix()->getVectorStarts();
1153     const int *index     = clp_simplex->matrix()->getIndices();
1154     const double *value  = clp_simplex->matrix()->getElements();
1155     const double *collb  = model->model_->columnLower();
1156     const double *colub  = model->model_->columnUpper();
1157     const double *obj    = model->model_->objective();
1158     const double *rowlb  = model->model_->rowLower();
1159     const double *rowub  = model->model_->rowUpper();
1160     printf("%s numcols = %i, numrows = %i, numelem = %i\n",
1161            prefix, numcols, numrows, numelem);
1162     printf("%s model = %p, start = %p, index = %p, value = %p\n",
1163            prefix, reinterpret_cast<const void *>(model), reinterpret_cast<const void *>(start), reinterpret_cast<const void *>(index), reinterpret_cast<const void *>(value));
1164     clp_simplex->matrix()->dumpMatrix(NULL);
1165     {
1166          int i;
1167          for (i = 0; i <= numcols; i++)
1168               printf("%s start[%i] = %i\n", prefix, i, start[i]);
1169          for (i = 0; i < numelem; i++)
1170               printf("%s index[%i] = %i, value[%i] = %g\n",
1171                      prefix, i, index[i], i, value[i]);
1172     }
1173
1174     printf("%s collb = %p, colub = %p, obj = %p, rowlb = %p, rowub = %p\n",
1175            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));
1176     printf("%s optimization direction = %g\n", prefix, Clp_optimizationDirection(model));
1177     printf("  (1 - minimize, -1 - maximize, 0 - ignore)\n");
1178     {
1179          int i;
1180          for (i = 0; i < numcols; i++)
1181               printf("%s collb[%i] = %g, colub[%i] = %g, obj[%i] = %g\n",
1182                      prefix, i, collb[i], i, colub[i], i, obj[i]);
1183          for (i = 0; i < numrows; i++)
1184               printf("%s rowlb[%i] = %g, rowub[%i] = %g\n",
1185                      prefix, i, rowlb[i], i, rowub[i]);
1186     }
1187}
1188
1189#ifndef SLIM_CLP
1190/** Solve the problem with the idiot code */
1191/* tryhard values:
1192   tryhard & 7:
1193      0: NOT lightweight, 105 iterations within a pass (when mu stays fixed)
1194      1: lightweight, but focus more on optimality (mu is high)
1195         (23 iters in a pass)
1196      2: lightweight, but focus more on feasibility (11 iters in a pass)
1197      3: lightweight, but focus more on feasibility (23 iters in a pass, so it
1198         goes closer to opt than option 2)
1199   tryhard >> 3:
1200      number of passes, the larger the number the closer it gets to optimality
1201*/
1202COINLIBAPI void COINLINKAGE
1203Clp_idiot(Clp_Simplex * model, int tryhard)
1204{
1205     ClpSimplex *clp = model->model_;
1206     Idiot info(*clp);
1207     int numberpass = tryhard >> 3;
1208     int lightweight = tryhard & 7;
1209     info.setLightweight(lightweight);
1210     info.crash(numberpass, clp->messageHandler(), clp->messagesPointer(), false);
1211}
1212#endif
1213
1214#if defined(__MWERKS__)
1215#pragma export off
1216#endif
1217
Note: See TracBrowser for help on using the repository browser.