Clp 1.16.9
Loading...
Searching...
No Matches
Clp_C_Interface.h
Go to the documentation of this file.
1/* $Id: Clp_C_Interface.h 2019 2014-01-31 05:18:01Z stefan $ */
2/*
3 Copyright (C) 2002, 2003 International Business Machines Corporation
4 and others. All Rights Reserved.
5
6 This code is licensed under the terms of the Eclipse Public License (EPL).
7*/
8#ifndef ClpSimplexC_H
9#define ClpSimplexC_H
10
11/* include all defines and ugly stuff */
12#include "Coin_C_defines.h"
13
14#if defined (CLP_EXTERN_C)
15typedef struct {
16 ClpSolve options;
17} Clp_Solve;
18#else
19typedef void Clp_Solve;
20#endif
21
27#ifdef __cplusplus
28extern "C" {
29#endif
30
40 COINLIBAPI const char* COINLINKAGE Clp_Version(void);
42 COINLIBAPI int COINLINKAGE Clp_VersionMajor(void);
44 COINLIBAPI int COINLINKAGE Clp_VersionMinor(void);
46 COINLIBAPI int COINLINKAGE Clp_VersionRelease(void);
62
64 COINLIBAPI Clp_Simplex * COINLINKAGE Clp_newModel(void);
66 COINLIBAPI void COINLINKAGE Clp_deleteModel(Clp_Simplex * model);
68 COINLIBAPI Clp_Solve * COINLINKAGE ClpSolve_new();
70 COINLIBAPI void COINLINKAGE ClpSolve_delete(Clp_Solve * solve);
88 COINLIBAPI void COINLINKAGE Clp_loadProblem (Clp_Simplex * model, const int numcols, const int numrows,
89 const CoinBigIndex * start, const int* index,
90 const double* value,
91 const double* collb, const double* colub,
92 const double* obj,
93 const double* rowlb, const double* rowub);
94
95 /* read quadratic part of the objective (the matrix part) */
96 COINLIBAPI void COINLINKAGE
97 Clp_loadQuadraticObjective(Clp_Simplex * model,
98 const int numberColumns,
99 const CoinBigIndex * start,
100 const int * column,
101 const double * element);
103 COINLIBAPI int COINLINKAGE Clp_readMps(Clp_Simplex * model, const char *filename,
104 int keepNames,
105 int ignoreErrors);
107 COINLIBAPI void COINLINKAGE Clp_copyInIntegerInformation(Clp_Simplex * model, const char * information);
109 COINLIBAPI void COINLINKAGE Clp_deleteIntegerInformation(Clp_Simplex * model);
111 COINLIBAPI void COINLINKAGE Clp_resize (Clp_Simplex * model, int newNumberRows, int newNumberColumns);
113 COINLIBAPI void COINLINKAGE Clp_deleteRows(Clp_Simplex * model, int number, const int * which);
115 COINLIBAPI void COINLINKAGE Clp_addRows(Clp_Simplex * model, int number, const double * rowLower,
116 const double * rowUpper,
117 const int * rowStarts, const int * columns,
118 const double * elements);
119
121 COINLIBAPI void COINLINKAGE Clp_deleteColumns(Clp_Simplex * model, int number, const int * which);
123 COINLIBAPI void COINLINKAGE Clp_addColumns(Clp_Simplex * model, int number, const double * columnLower,
124 const double * columnUpper,
125 const double * objective,
126 const int * columnStarts, const int * rows,
127 const double * elements);
129 COINLIBAPI void COINLINKAGE Clp_chgRowLower(Clp_Simplex * model, const double * rowLower);
131 COINLIBAPI void COINLINKAGE Clp_chgRowUpper(Clp_Simplex * model, const double * rowUpper);
133 COINLIBAPI void COINLINKAGE Clp_chgColumnLower(Clp_Simplex * model, const double * columnLower);
135 COINLIBAPI void COINLINKAGE Clp_chgColumnUpper(Clp_Simplex * model, const double * columnUpper);
137 COINLIBAPI void COINLINKAGE Clp_chgObjCoefficients(Clp_Simplex * model, const double * objIn);
139 COINLIBAPI void COINLINKAGE Clp_dropNames(Clp_Simplex * model);
141 COINLIBAPI void COINLINKAGE Clp_copyNames(Clp_Simplex * model, const char * const * rowNames,
142 const char * const * columnNames);
143
148 COINLIBAPI int COINLINKAGE Clp_numberRows(Clp_Simplex * model);
150 COINLIBAPI int COINLINKAGE Clp_numberColumns(Clp_Simplex * model);
152 COINLIBAPI double COINLINKAGE Clp_primalTolerance(Clp_Simplex * model);
153 COINLIBAPI void COINLINKAGE Clp_setPrimalTolerance(Clp_Simplex * model, double value) ;
155 COINLIBAPI double COINLINKAGE Clp_dualTolerance(Clp_Simplex * model);
156 COINLIBAPI void COINLINKAGE Clp_setDualTolerance(Clp_Simplex * model, double value) ;
158 COINLIBAPI double COINLINKAGE Clp_dualObjectiveLimit(Clp_Simplex * model);
159 COINLIBAPI void COINLINKAGE Clp_setDualObjectiveLimit(Clp_Simplex * model, double value);
161 COINLIBAPI double COINLINKAGE Clp_objectiveOffset(Clp_Simplex * model);
162 COINLIBAPI void COINLINKAGE Clp_setObjectiveOffset(Clp_Simplex * model, double value);
164 COINLIBAPI void COINLINKAGE Clp_problemName(Clp_Simplex * model, int maxNumberCharacters, char * array);
165 /* Sets problem name. Must have \0 at end. */
166 COINLIBAPI int COINLINKAGE
167 Clp_setProblemName(Clp_Simplex * model, int maxNumberCharacters, char * array);
169 COINLIBAPI int COINLINKAGE Clp_numberIterations(Clp_Simplex * model);
170 COINLIBAPI void COINLINKAGE Clp_setNumberIterations(Clp_Simplex * model, int numberIterations);
172 COINLIBAPI int maximumIterations(Clp_Simplex * model);
173 COINLIBAPI void COINLINKAGE Clp_setMaximumIterations(Clp_Simplex * model, int value);
175 COINLIBAPI double COINLINKAGE Clp_maximumSeconds(Clp_Simplex * model);
176 COINLIBAPI void COINLINKAGE Clp_setMaximumSeconds(Clp_Simplex * model, double value);
178 COINLIBAPI int COINLINKAGE Clp_hitMaximumIterations(Clp_Simplex * model);
186 COINLIBAPI int COINLINKAGE Clp_status(Clp_Simplex * model);
188 COINLIBAPI void COINLINKAGE Clp_setProblemStatus(Clp_Simplex * model, int problemStatus);
196 COINLIBAPI int COINLINKAGE Clp_secondaryStatus(Clp_Simplex * model);
197 COINLIBAPI void COINLINKAGE Clp_setSecondaryStatus(Clp_Simplex * model, int status);
199 COINLIBAPI double COINLINKAGE Clp_optimizationDirection(Clp_Simplex * model);
200 COINLIBAPI void COINLINKAGE Clp_setOptimizationDirection(Clp_Simplex * model, double value);
202 COINLIBAPI double * COINLINKAGE Clp_primalRowSolution(Clp_Simplex * model);
204 COINLIBAPI double * COINLINKAGE Clp_primalColumnSolution(Clp_Simplex * model);
206 COINLIBAPI double * COINLINKAGE Clp_dualRowSolution(Clp_Simplex * model);
208 COINLIBAPI double * COINLINKAGE Clp_dualColumnSolution(Clp_Simplex * model);
210 COINLIBAPI double* COINLINKAGE Clp_rowLower(Clp_Simplex * model);
212 COINLIBAPI double* COINLINKAGE Clp_rowUpper(Clp_Simplex * model);
214 COINLIBAPI double * COINLINKAGE Clp_objective(Clp_Simplex * model);
216 COINLIBAPI double * COINLINKAGE Clp_columnLower(Clp_Simplex * model);
218 COINLIBAPI double * COINLINKAGE Clp_columnUpper(Clp_Simplex * model);
220 COINLIBAPI int COINLINKAGE Clp_getNumElements(Clp_Simplex * model);
221 /* Column starts in matrix */
222 COINLIBAPI const CoinBigIndex * COINLINKAGE Clp_getVectorStarts(Clp_Simplex * model);
223 /* Row indices in matrix */
224 COINLIBAPI const int * COINLINKAGE Clp_getIndices(Clp_Simplex * model);
225 /* Column vector lengths in matrix */
226 COINLIBAPI const int * COINLINKAGE Clp_getVectorLengths(Clp_Simplex * model);
227 /* Element values in matrix */
228 COINLIBAPI const double * COINLINKAGE Clp_getElements(Clp_Simplex * model);
230 COINLIBAPI double COINLINKAGE Clp_objectiveValue(Clp_Simplex * model);
232 COINLIBAPI char * COINLINKAGE Clp_integerInformation(Clp_Simplex * model);
239 COINLIBAPI double * COINLINKAGE Clp_infeasibilityRay(Clp_Simplex * model);
246 COINLIBAPI double * COINLINKAGE Clp_unboundedRay(Clp_Simplex * model);
248 COINLIBAPI void COINLINKAGE Clp_freeRay(Clp_Simplex * model, double * ray);
250 COINLIBAPI int COINLINKAGE Clp_statusExists(Clp_Simplex * model);
252 COINLIBAPI unsigned char * COINLINKAGE Clp_statusArray(Clp_Simplex * model);
254 COINLIBAPI void COINLINKAGE Clp_copyinStatus(Clp_Simplex * model, const unsigned char * statusArray);
255 /* status values are as in ClpSimplex.hpp i.e. 0 - free, 1 basic, 2 at upper,
256 3 at lower, 4 superbasic, (5 fixed) */
257 /* Get variable basis info */
258 COINLIBAPI int COINLINKAGE Clp_getColumnStatus(Clp_Simplex * model, int sequence);
259 /* Get row basis info */
260 COINLIBAPI int COINLINKAGE Clp_getRowStatus(Clp_Simplex * model, int sequence);
261 /* Set variable basis info (and value if at bound) */
262 COINLIBAPI void COINLINKAGE Clp_setColumnStatus(Clp_Simplex * model,
263 int sequence, int value);
264 /* Set row basis info (and value if at bound) */
265 COINLIBAPI void COINLINKAGE Clp_setRowStatus(Clp_Simplex * model,
266 int sequence, int value);
267
269 COINLIBAPI void COINLINKAGE Clp_setUserPointer (Clp_Simplex * model, void * pointer);
270 COINLIBAPI void * COINLINKAGE Clp_getUserPointer (Clp_Simplex * model);
276 COINLIBAPI void COINLINKAGE Clp_registerCallBack(Clp_Simplex * model,
277 clp_callback userCallBack);
279 COINLIBAPI void COINLINKAGE Clp_clearCallBack(Clp_Simplex * model);
288 COINLIBAPI void COINLINKAGE Clp_setLogLevel(Clp_Simplex * model, int value);
289 COINLIBAPI int COINLINKAGE Clp_logLevel(Clp_Simplex * model);
291 COINLIBAPI int COINLINKAGE Clp_lengthNames(Clp_Simplex * model);
293 COINLIBAPI void COINLINKAGE Clp_rowName(Clp_Simplex * model, int iRow, char * name);
295 COINLIBAPI void COINLINKAGE Clp_columnName(Clp_Simplex * model, int iColumn, char * name);
296
305 COINLIBAPI int COINLINKAGE Clp_initialSolve(Clp_Simplex * model);
307 COINLIBAPI int COINLINKAGE Clp_initialSolveWithOptions(Clp_Simplex * model, Clp_Solve *);
309 COINLIBAPI int COINLINKAGE Clp_initialDualSolve(Clp_Simplex * model);
311 COINLIBAPI int COINLINKAGE Clp_initialPrimalSolve(Clp_Simplex * model);
313 COINLIBAPI int COINLINKAGE Clp_initialBarrierSolve(Clp_Simplex * model);
315 COINLIBAPI int COINLINKAGE Clp_initialBarrierNoCrossSolve(Clp_Simplex * model);
317 COINLIBAPI int COINLINKAGE Clp_dual(Clp_Simplex * model, int ifValuesPass);
319 COINLIBAPI int COINLINKAGE Clp_primal(Clp_Simplex * model, int ifValuesPass);
320#ifndef SLIM_CLP
322 COINLIBAPI void COINLINKAGE Clp_idiot(Clp_Simplex * model, int tryhard);
323#endif
325 COINLIBAPI void COINLINKAGE Clp_scaling(Clp_Simplex * model, int mode);
327 COINLIBAPI int COINLINKAGE Clp_scalingFlag(Clp_Simplex * model);
342 COINLIBAPI int COINLINKAGE Clp_crash(Clp_Simplex * model, double gap, int pivot);
349 COINLIBAPI int COINLINKAGE Clp_primalFeasible(Clp_Simplex * model);
351 COINLIBAPI int COINLINKAGE Clp_dualFeasible(Clp_Simplex * model);
353 COINLIBAPI double COINLINKAGE Clp_dualBound(Clp_Simplex * model);
354 COINLIBAPI void COINLINKAGE Clp_setDualBound(Clp_Simplex * model, double value);
356 COINLIBAPI double COINLINKAGE Clp_infeasibilityCost(Clp_Simplex * model);
357 COINLIBAPI void COINLINKAGE Clp_setInfeasibilityCost(Clp_Simplex * model, double value);
366 COINLIBAPI int COINLINKAGE Clp_perturbation(Clp_Simplex * model);
367 COINLIBAPI void COINLINKAGE Clp_setPerturbation(Clp_Simplex * model, int value);
369 COINLIBAPI int COINLINKAGE Clp_algorithm(Clp_Simplex * model);
371 COINLIBAPI void COINLINKAGE Clp_setAlgorithm(Clp_Simplex * model, int value);
373 COINLIBAPI double COINLINKAGE Clp_sumDualInfeasibilities(Clp_Simplex * model);
375 COINLIBAPI int COINLINKAGE Clp_numberDualInfeasibilities(Clp_Simplex * model);
377 COINLIBAPI double COINLINKAGE Clp_sumPrimalInfeasibilities(Clp_Simplex * model);
379 COINLIBAPI int COINLINKAGE Clp_numberPrimalInfeasibilities(Clp_Simplex * model);
386 COINLIBAPI int COINLINKAGE Clp_saveModel(Clp_Simplex * model, const char * fileName);
389 COINLIBAPI int COINLINKAGE Clp_restoreModel(Clp_Simplex * model, const char * fileName);
390
393 COINLIBAPI void COINLINKAGE Clp_checkSolution(Clp_Simplex * model);
396 /******************** End of most useful part **************/
400 COINLIBAPI int COINLINKAGE Clp_getNumRows(Clp_Simplex * model);
402 COINLIBAPI int COINLINKAGE Clp_getNumCols(Clp_Simplex * model);
404 COINLIBAPI int COINLINKAGE Clp_getIterationCount(Clp_Simplex * model);
406 COINLIBAPI int COINLINKAGE Clp_isAbandoned(Clp_Simplex * model);
408 COINLIBAPI int COINLINKAGE Clp_isProvenOptimal(Clp_Simplex * model);
410 COINLIBAPI int COINLINKAGE Clp_isProvenPrimalInfeasible(Clp_Simplex * model);
412 COINLIBAPI int COINLINKAGE Clp_isProvenDualInfeasible(Clp_Simplex * model);
414 COINLIBAPI int COINLINKAGE Clp_isPrimalObjectiveLimitReached(Clp_Simplex * model) ;
416 COINLIBAPI int COINLINKAGE Clp_isDualObjectiveLimitReached(Clp_Simplex * model) ;
418 COINLIBAPI int COINLINKAGE Clp_isIterationLimitReached(Clp_Simplex * model);
420 COINLIBAPI double COINLINKAGE Clp_getObjSense(Clp_Simplex * model);
422 COINLIBAPI void COINLINKAGE Clp_setObjSense(Clp_Simplex * model, double objsen);
424 COINLIBAPI const double * COINLINKAGE Clp_getRowActivity(Clp_Simplex * model);
426 COINLIBAPI const double * COINLINKAGE Clp_getColSolution(Clp_Simplex * model);
427 COINLIBAPI void COINLINKAGE Clp_setColSolution(Clp_Simplex * model, const double * input);
429 COINLIBAPI const double * COINLINKAGE Clp_getRowPrice(Clp_Simplex * model);
431 COINLIBAPI const double * COINLINKAGE Clp_getReducedCost(Clp_Simplex * model);
433 COINLIBAPI const double* COINLINKAGE Clp_getRowLower(Clp_Simplex * model);
435 COINLIBAPI const double* COINLINKAGE Clp_getRowUpper(Clp_Simplex * model);
437 COINLIBAPI const double * COINLINKAGE Clp_getObjCoefficients(Clp_Simplex * model);
439 COINLIBAPI const double * COINLINKAGE Clp_getColLower(Clp_Simplex * model);
441 COINLIBAPI const double * COINLINKAGE Clp_getColUpper(Clp_Simplex * model);
443 COINLIBAPI double COINLINKAGE Clp_getObjValue(Clp_Simplex * model);
445 COINLIBAPI void COINLINKAGE Clp_printModel(Clp_Simplex * model, const char * prefix);
446 /* Small element value - elements less than this set to zero,
447 default is 1.0e-20 */
448 COINLIBAPI double COINLINKAGE Clp_getSmallElementValue(Clp_Simplex * model);
449 COINLIBAPI void COINLINKAGE Clp_setSmallElementValue(Clp_Simplex * model, double value);
456 COINLIBAPI void COINLINKAGE ClpSolve_setSpecialOption(Clp_Solve *, int which, int value, int extraInfo);
457 COINLIBAPI int COINLINKAGE ClpSolve_getSpecialOption(Clp_Solve *, int which);
458
468 COINLIBAPI void COINLINKAGE ClpSolve_setSolveType(Clp_Solve *, int method, int extraInfo);
469 COINLIBAPI int COINLINKAGE ClpSolve_getSolveType(Clp_Solve *);
470
477 COINLIBAPI void COINLINKAGE ClpSolve_setPresolveType(Clp_Solve *, int amount, int extraInfo);
478 COINLIBAPI int COINLINKAGE ClpSolve_getPresolveType(Clp_Solve *);
479
480 COINLIBAPI int COINLINKAGE ClpSolve_getPresolvePasses(Clp_Solve *);
481 COINLIBAPI int COINLINKAGE ClpSolve_getExtraInfo(Clp_Solve *, int which);
482 COINLIBAPI void COINLINKAGE ClpSolve_setInfeasibleReturn(Clp_Solve *, int trueFalse);
483 COINLIBAPI int COINLINKAGE ClpSolve_infeasibleReturn(Clp_Solve *);
484
485 COINLIBAPI int COINLINKAGE ClpSolve_doDual(Clp_Solve *);
486 COINLIBAPI void COINLINKAGE ClpSolve_setDoDual(Clp_Solve *, int doDual);
487
488 COINLIBAPI int COINLINKAGE ClpSolve_doSingleton(Clp_Solve *);
489 COINLIBAPI void COINLINKAGE ClpSolve_setDoSingleton(Clp_Solve *, int doSingleton);
490
491 COINLIBAPI int COINLINKAGE ClpSolve_doDoubleton(Clp_Solve *);
492 COINLIBAPI void COINLINKAGE ClpSolve_setDoDoubleton(Clp_Solve *, int doDoubleton);
493
494 COINLIBAPI int COINLINKAGE ClpSolve_doTripleton(Clp_Solve *);
495 COINLIBAPI void COINLINKAGE ClpSolve_setDoTripleton(Clp_Solve *, int doTripleton);
496
497 COINLIBAPI int COINLINKAGE ClpSolve_doTighten(Clp_Solve *);
498 COINLIBAPI void COINLINKAGE ClpSolve_setDoTighten(Clp_Solve *, int doTighten);
499
500 COINLIBAPI int COINLINKAGE ClpSolve_doForcing(Clp_Solve *);
501 COINLIBAPI void COINLINKAGE ClpSolve_setDoForcing(Clp_Solve *, int doForcing);
502
503 COINLIBAPI int COINLINKAGE ClpSolve_doImpliedFree(Clp_Solve *);
504 COINLIBAPI void COINLINKAGE ClpSolve_setDoImpliedFree(Clp_Solve *, int doImpliedFree);
505
506 COINLIBAPI int COINLINKAGE ClpSolve_doDupcol(Clp_Solve *);
507 COINLIBAPI void COINLINKAGE ClpSolve_setDoDupcol(Clp_Solve *, int doDupcol);
508
509 COINLIBAPI int COINLINKAGE ClpSolve_doDuprow(Clp_Solve *);
510 COINLIBAPI void COINLINKAGE ClpSolve_setDoDuprow(Clp_Solve *, int doDuprow);
511
512 COINLIBAPI int COINLINKAGE ClpSolve_doSingletonColumn(Clp_Solve *);
513 COINLIBAPI void COINLINKAGE ClpSolve_setDoSingletonColumn(Clp_Solve *, int doSingleton);
514
515 COINLIBAPI int COINLINKAGE ClpSolve_presolveActions(Clp_Solve *);
516 COINLIBAPI void COINLINKAGE ClpSolve_setPresolveActions(Clp_Solve *, int action);
517
518 COINLIBAPI int COINLINKAGE ClpSolve_substitution(Clp_Solve *);
519 COINLIBAPI void COINLINKAGE ClpSolve_setSubstitution(Clp_Solve *, int value);
520
522#ifdef __cplusplus
523}
524#endif
525#endif
COINLIBAPI int COINLINKAGE ClpSolve_doDoubleton(Clp_Solve *)
COINLIBAPI double COINLINKAGE Clp_sumDualInfeasibilities(Clp_Simplex *model)
Sum of dual infeasibilities.
COINLIBAPI double COINLINKAGE Clp_objectiveOffset(Clp_Simplex *model)
Objective offset.
COINLIBAPI const double *COINLINKAGE Clp_getRowLower(Clp_Simplex *model)
Row lower.
COINLIBAPI int COINLINKAGE Clp_logLevel(Clp_Simplex *model)
COINLIBAPI void COINLINKAGE ClpSolve_setDoDoubleton(Clp_Solve *, int doDoubleton)
COINLIBAPI int COINLINKAGE Clp_initialBarrierSolve(Clp_Simplex *model)
Barrier initial solve.
COINLIBAPI void COINLINKAGE Clp_chgRowLower(Clp_Simplex *model, const double *rowLower)
Change row lower bounds.
COINLIBAPI int COINLINKAGE ClpSolve_getPresolvePasses(Clp_Solve *)
COINLIBAPI void COINLINKAGE Clp_copyinStatus(Clp_Simplex *model, const unsigned char *statusArray)
Copy in status vector.
COINLIBAPI void COINLINKAGE Clp_setDualObjectiveLimit(Clp_Simplex *model, double value)
COINLIBAPI double COINLINKAGE Clp_dualBound(Clp_Simplex *model)
Dual bound.
COINLIBAPI int COINLINKAGE Clp_lengthNames(Clp_Simplex *model)
length of names (0 means no names0
COINLIBAPI void COINLINKAGE Clp_idiot(Clp_Simplex *model, int tryhard)
Solve the problem with the idiot code.
COINLIBAPI int COINLINKAGE ClpSolve_doTighten(Clp_Solve *)
COINLIBAPI int COINLINKAGE Clp_dual(Clp_Simplex *model, int ifValuesPass)
Dual algorithm - see ClpSimplexDual.hpp for method.
COINLIBAPI void COINLINKAGE Clp_setDualTolerance(Clp_Simplex *model, double value)
COINLIBAPI void COINLINKAGE ClpSolve_setSolveType(Clp_Solve *, int method, int extraInfo)
method: (see ClpSolve::SolveType) 0 - dual simplex 1 - primal simplex 2 - primal or sprint 3 - barrie...
COINLIBAPI double COINLINKAGE Clp_objectiveValue(Clp_Simplex *model)
Objective value.
COINLIBAPI int COINLINKAGE Clp_saveModel(Clp_Simplex *model, const char *fileName)
Save model to file, returns 0 if success.
COINLIBAPI void COINLINKAGE Clp_scaling(Clp_Simplex *model, int mode)
Sets or unsets scaling, 0 -off, 1 equilibrium, 2 geometric, 3, auto, 4 dynamic(later)
COINLIBAPI void COINLINKAGE Clp_setObjSense(Clp_Simplex *model, double objsen)
Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore.
COINLIBAPI double COINLINKAGE Clp_getSmallElementValue(Clp_Simplex *model)
COINLIBAPI int maximumIterations(Clp_Simplex *model)
Maximum number of iterations.
COINLIBAPI const int *COINLINKAGE Clp_getIndices(Clp_Simplex *model)
COINLIBAPI int COINLINKAGE Clp_algorithm(Clp_Simplex *model)
Current (or last) algorithm.
COINLIBAPI int COINLINKAGE ClpSolve_substitution(Clp_Solve *)
COINLIBAPI int COINLINKAGE Clp_isAbandoned(Clp_Simplex *model)
Are there a numerical difficulties?
COINLIBAPI int COINLINKAGE ClpSolve_infeasibleReturn(Clp_Solve *)
COINLIBAPI const double *COINLINKAGE Clp_getColLower(Clp_Simplex *model)
Column Lower.
COINLIBAPI Clp_Solve *COINLINKAGE ClpSolve_new()
Default constructor.
COINLIBAPI int COINLINKAGE Clp_initialDualSolve(Clp_Simplex *model)
Dual initial solve.
COINLIBAPI int COINLINKAGE ClpSolve_doSingletonColumn(Clp_Solve *)
COINLIBAPI void COINLINKAGE ClpSolve_setPresolveType(Clp_Solve *, int amount, int extraInfo)
amount: (see ClpSolve::PresolveType) 0 - presolve on 1 - presolve off 2 - presolve number 3 - presolv...
COINLIBAPI int COINLINKAGE Clp_restoreModel(Clp_Simplex *model, const char *fileName)
Restore model from file, returns 0 if success, deletes current model.
COINLIBAPI int COINLINKAGE Clp_readMps(Clp_Simplex *model, const char *filename, int keepNames, int ignoreErrors)
Read an mps file from the given filename.
COINLIBAPI void COINLINKAGE Clp_copyInIntegerInformation(Clp_Simplex *model, const char *information)
Copy in integer informations.
COINLIBAPI int COINLINKAGE Clp_isProvenOptimal(Clp_Simplex *model)
Is optimality proven?
COINLIBAPI int COINLINKAGE ClpSolve_getSpecialOption(Clp_Solve *, int which)
COINLIBAPI void COINLINKAGE ClpSolve_setPresolveActions(Clp_Solve *, int action)
COINLIBAPI double *COINLINKAGE Clp_infeasibilityRay(Clp_Simplex *model)
Gives Infeasibility ray.
COINLIBAPI double COINLINKAGE Clp_optimizationDirection(Clp_Simplex *model)
Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore.
COINLIBAPI int COINLINKAGE Clp_hitMaximumIterations(Clp_Simplex *model)
Returns true if hit maximum iterations (or time)
COINLIBAPI const double *COINLINKAGE Clp_getReducedCost(Clp_Simplex *model)
Reduced costs.
COINLIBAPI double *COINLINKAGE Clp_dualRowSolution(Clp_Simplex *model)
Dual row solution.
COINLIBAPI void COINLINKAGE Clp_setMaximumIterations(Clp_Simplex *model, int value)
COINLIBAPI int COINLINKAGE Clp_VersionMajor(void)
Major number of Clp library version.
COINLIBAPI const double *COINLINKAGE Clp_getRowUpper(Clp_Simplex *model)
Row upper
COINLIBAPI int COINLINKAGE Clp_isIterationLimitReached(Clp_Simplex *model)
Iteration limit reached?
COINLIBAPI void COINLINKAGE Clp_loadProblem(Clp_Simplex *model, const int numcols, const int numrows, const CoinBigIndex *start, const int *index, const double *value, const double *collb, const double *colub, const double *obj, const double *rowlb, const double *rowub)
Loads a problem (the constraints on the rows are given by lower and upper bounds).
COINLIBAPI double *COINLINKAGE Clp_rowUpper(Clp_Simplex *model)
Row upper
COINLIBAPI void COINLINKAGE Clp_deleteRows(Clp_Simplex *model, int number, const int *which)
Deletes rows.
COINLIBAPI void COINLINKAGE Clp_setRowStatus(Clp_Simplex *model, int sequence, int value)
COINLIBAPI double *COINLINKAGE Clp_unboundedRay(Clp_Simplex *model)
Gives ray in which the problem is unbounded.
COINLIBAPI double COINLINKAGE Clp_primalTolerance(Clp_Simplex *model)
Primal tolerance to use.
COINLIBAPI int COINLINKAGE Clp_statusExists(Clp_Simplex *model)
See if status array exists (partly for OsiClp)
COINLIBAPI int COINLINKAGE Clp_numberPrimalInfeasibilities(Clp_Simplex *model)
Number of primal infeasibilities.
COINLIBAPI int COINLINKAGE Clp_isProvenPrimalInfeasible(Clp_Simplex *model)
Is primal infeasiblity proven?
COINLIBAPI void COINLINKAGE ClpSolve_setSpecialOption(Clp_Solve *, int which, int value, int extraInfo)
COINLIBAPI void COINLINKAGE ClpSolve_setDoDupcol(Clp_Solve *, int doDupcol)
COINLIBAPI double *COINLINKAGE Clp_primalColumnSolution(Clp_Simplex *model)
Primal column solution.
COINLIBAPI double *COINLINKAGE Clp_columnUpper(Clp_Simplex *model)
Column Upper.
COINLIBAPI int COINLINKAGE Clp_primalFeasible(Clp_Simplex *model)
If problem is primal feasible.
COINLIBAPI void COINLINKAGE Clp_columnName(Clp_Simplex *model, int iColumn, char *name)
Fill in array (at least lengthNames+1 long) with a column name.
COINLIBAPI void COINLINKAGE Clp_clearCallBack(Clp_Simplex *model)
Unset Callback function.
COINLIBAPI double COINLINKAGE Clp_getObjValue(Clp_Simplex *model)
Objective value.
COINLIBAPI double COINLINKAGE Clp_sumPrimalInfeasibilities(Clp_Simplex *model)
Sum of primal infeasibilities.
COINLIBAPI int COINLINKAGE Clp_setProblemName(Clp_Simplex *model, int maxNumberCharacters, char *array)
COINLIBAPI void COINLINKAGE Clp_chgObjCoefficients(Clp_Simplex *model, const double *objIn)
Change objective coefficients.
COINLIBAPI int COINLINKAGE ClpSolve_doImpliedFree(Clp_Solve *)
COINLIBAPI void COINLINKAGE Clp_setColSolution(Clp_Simplex *model, const double *input)
COINLIBAPI void COINLINKAGE Clp_setObjectiveOffset(Clp_Simplex *model, double value)
COINLIBAPI void COINLINKAGE ClpSolve_setDoDual(Clp_Solve *, int doDual)
COINLIBAPI void COINLINKAGE Clp_setInfeasibilityCost(Clp_Simplex *model, double value)
COINLIBAPI int COINLINKAGE ClpSolve_getPresolveType(Clp_Solve *)
COINLIBAPI double COINLINKAGE Clp_getObjSense(Clp_Simplex *model)
Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore.
COINLIBAPI int COINLINKAGE Clp_VersionMinor(void)
Minor number of Clp library version.
COINLIBAPI void COINLINKAGE Clp_setSmallElementValue(Clp_Simplex *model, double value)
COINLIBAPI int COINLINKAGE Clp_perturbation(Clp_Simplex *model)
Perturbation: 50 - switch on perturbation 100 - auto perturb if takes too long (1....
COINLIBAPI void COINLINKAGE Clp_problemName(Clp_Simplex *model, int maxNumberCharacters, char *array)
Fills in array with problem name
COINLIBAPI void COINLINKAGE Clp_checkSolution(Clp_Simplex *model)
Just check solution (for external use) - sets sum of infeasibilities etc.
COINLIBAPI void COINLINKAGE ClpSolve_setDoForcing(Clp_Solve *, int doForcing)
COINLIBAPI void COINLINKAGE Clp_setMaximumSeconds(Clp_Simplex *model, double value)
COINLIBAPI void COINLINKAGE ClpSolve_setDoSingleton(Clp_Solve *, int doSingleton)
COINLIBAPI const int *COINLINKAGE Clp_getVectorLengths(Clp_Simplex *model)
COINLIBAPI double *COINLINKAGE Clp_rowLower(Clp_Simplex *model)
Row lower.
COINLIBAPI int COINLINKAGE Clp_dualFeasible(Clp_Simplex *model)
If problem is dual feasible.
COINLIBAPI int COINLINKAGE ClpSolve_presolveActions(Clp_Solve *)
COINLIBAPI void COINLINKAGE Clp_setAlgorithm(Clp_Simplex *model, int value)
Set algorithm.
COINLIBAPI int COINLINKAGE ClpSolve_doDual(Clp_Solve *)
COINLIBAPI const double *COINLINKAGE Clp_getObjCoefficients(Clp_Simplex *model)
Objective.
COINLIBAPI double COINLINKAGE Clp_infeasibilityCost(Clp_Simplex *model)
Infeasibility cost.
COINLIBAPI int COINLINKAGE Clp_isPrimalObjectiveLimitReached(Clp_Simplex *model)
Is the given primal objective limit reached?
COINLIBAPI const double *COINLINKAGE Clp_getRowPrice(Clp_Simplex *model)
Dual row solution.
COINLIBAPI int COINLINKAGE Clp_getNumRows(Clp_Simplex *model)
Number of rows.
COINLIBAPI void COINLINKAGE Clp_setLogLevel(Clp_Simplex *model, int value)
Amount of print out: 0 - none 1 - just final 2 - just factorizations 3 - as 2 plus a bit more 4 - ver...
COINLIBAPI void COINLINKAGE Clp_setColumnStatus(Clp_Simplex *model, int sequence, int value)
COINLIBAPI int COINLINKAGE Clp_VersionRelease(void)
Release number of Clp library version.
COINLIBAPI int COINLINKAGE Clp_numberRows(Clp_Simplex *model)
Number of rows.
COINLIBAPI const double *COINLINKAGE Clp_getRowActivity(Clp_Simplex *model)
Primal row solution.
COINLIBAPI double *COINLINKAGE Clp_columnLower(Clp_Simplex *model)
Column Lower.
COINLIBAPI int COINLINKAGE Clp_status(Clp_Simplex *model)
Status of problem: 0 - optimal 1 - primal infeasible 2 - dual infeasible 3 - stopped on iterations et...
COINLIBAPI void COINLINKAGE Clp_setPrimalTolerance(Clp_Simplex *model, double value)
COINLIBAPI void COINLINKAGE Clp_addRows(Clp_Simplex *model, int number, const double *rowLower, const double *rowUpper, const int *rowStarts, const int *columns, const double *elements)
Add rows.
COINLIBAPI int COINLINKAGE Clp_getIterationCount(Clp_Simplex *model)
Number of iterations.
COINLIBAPI const double *COINLINKAGE Clp_getColUpper(Clp_Simplex *model)
Column Upper.
COINLIBAPI void COINLINKAGE ClpSolve_setSubstitution(Clp_Solve *, int value)
COINLIBAPI int COINLINKAGE Clp_numberIterations(Clp_Simplex *model)
Number of iterations.
COINLIBAPI void COINLINKAGE Clp_setDualBound(Clp_Simplex *model, double value)
COINLIBAPI void COINLINKAGE Clp_resize(Clp_Simplex *model, int newNumberRows, int newNumberColumns)
Resizes rim part of model
COINLIBAPI void COINLINKAGE ClpSolve_setDoDuprow(Clp_Solve *, int doDuprow)
COINLIBAPI void COINLINKAGE Clp_setNumberIterations(Clp_Simplex *model, int numberIterations)
COINLIBAPI void COINLINKAGE Clp_setProblemStatus(Clp_Simplex *model, int problemStatus)
Set problem status.
COINLIBAPI void COINLINKAGE Clp_rowName(Clp_Simplex *model, int iRow, char *name)
Fill in array (at least lengthNames+1 long) with a row name.
COINLIBAPI int COINLINKAGE Clp_getRowStatus(Clp_Simplex *model, int sequence)
COINLIBAPI int COINLINKAGE ClpSolve_getSolveType(Clp_Solve *)
COINLIBAPI int COINLINKAGE ClpSolve_getExtraInfo(Clp_Solve *, int which)
COINLIBAPI int COINLINKAGE Clp_numberDualInfeasibilities(Clp_Simplex *model)
Number of dual infeasibilities.
COINLIBAPI double *COINLINKAGE Clp_dualColumnSolution(Clp_Simplex *model)
Reduced costs.
COINLIBAPI int COINLINKAGE Clp_isProvenDualInfeasible(Clp_Simplex *model)
Is dual infeasiblity proven?
COINLIBAPI void COINLINKAGE Clp_setSecondaryStatus(Clp_Simplex *model, int status)
COINLIBAPI int COINLINKAGE ClpSolve_doDuprow(Clp_Solve *)
COINLIBAPI int COINLINKAGE Clp_initialSolveWithOptions(Clp_Simplex *model, Clp_Solve *)
Pass solve options.
COINLIBAPI void COINLINKAGE Clp_setOptimizationDirection(Clp_Simplex *model, double value)
COINLIBAPI int COINLINKAGE Clp_secondaryStatus(Clp_Simplex *model)
Secondary status of problem - may get extended 0 - none 1 - primal infeasible because dual limit reac...
COINLIBAPI void COINLINKAGE ClpSolve_delete(Clp_Solve *solve)
Destructor.
COINLIBAPI void COINLINKAGE ClpSolve_setDoTripleton(Clp_Solve *, int doTripleton)
COINLIBAPI const double *COINLINKAGE Clp_getColSolution(Clp_Simplex *model)
Primal column solution.
COINLIBAPI int COINLINKAGE Clp_initialBarrierNoCrossSolve(Clp_Simplex *model)
Barrier initial solve, no crossover.
COINLIBAPI double COINLINKAGE Clp_dualObjectiveLimit(Clp_Simplex *model)
Dual objective limit.
COINLIBAPI void COINLINKAGE Clp_copyNames(Clp_Simplex *model, const char *const *rowNames, const char *const *columnNames)
Copies in names.
COINLIBAPI void COINLINKAGE Clp_loadQuadraticObjective(Clp_Simplex *model, const int numberColumns, const CoinBigIndex *start, const int *column, const double *element)
COINLIBAPI void COINLINKAGE ClpSolve_setInfeasibleReturn(Clp_Solve *, int trueFalse)
COINLIBAPI void COINLINKAGE Clp_deleteColumns(Clp_Simplex *model, int number, const int *which)
Deletes columns.
COINLIBAPI void COINLINKAGE Clp_setUserPointer(Clp_Simplex *model, void *pointer)
User pointer for whatever reason.
COINLIBAPI int COINLINKAGE ClpSolve_doForcing(Clp_Solve *)
COINLIBAPI int COINLINKAGE ClpSolve_doTripleton(Clp_Solve *)
COINLIBAPI double *COINLINKAGE Clp_objective(Clp_Simplex *model)
Objective.
COINLIBAPI void COINLINKAGE Clp_deleteModel(Clp_Simplex *model)
Destructor.
COINLIBAPI int COINLINKAGE Clp_getNumCols(Clp_Simplex *model)
Number of columns.
COINLIBAPI int COINLINKAGE Clp_getColumnStatus(Clp_Simplex *model, int sequence)
COINLIBAPI void COINLINKAGE Clp_freeRay(Clp_Simplex *model, double *ray)
Frees a infeasibility or unbounded ray.
COINLIBAPI void COINLINKAGE ClpSolve_setDoTighten(Clp_Solve *, int doTighten)
COINLIBAPI char *COINLINKAGE Clp_integerInformation(Clp_Simplex *model)
Integer information.
COINLIBAPI void COINLINKAGE Clp_chgColumnLower(Clp_Simplex *model, const double *columnLower)
Change column lower bounds.
COINLIBAPI void COINLINKAGE Clp_setPerturbation(Clp_Simplex *model, int value)
COINLIBAPI double COINLINKAGE Clp_maximumSeconds(Clp_Simplex *model)
Maximum time in seconds (from when set called)
COINLIBAPI int COINLINKAGE Clp_getNumElements(Clp_Simplex *model)
Number of elements in matrix.
COINLIBAPI int COINLINKAGE Clp_initialSolve(Clp_Simplex *model)
General solve algorithm which can do presolve.
COINLIBAPI void COINLINKAGE ClpSolve_setDoSingletonColumn(Clp_Solve *, int doSingleton)
COINLIBAPI void *COINLINKAGE Clp_getUserPointer(Clp_Simplex *model)
COINLIBAPI void COINLINKAGE Clp_chgRowUpper(Clp_Simplex *model, const double *rowUpper)
Change row upper bounds.
COINLIBAPI int COINLINKAGE Clp_isDualObjectiveLimitReached(Clp_Simplex *model)
Is the given dual objective limit reached?
COINLIBAPI double *COINLINKAGE Clp_primalRowSolution(Clp_Simplex *model)
Primal row solution.
COINLIBAPI int COINLINKAGE Clp_scalingFlag(Clp_Simplex *model)
Gets scalingFlag.
COINLIBAPI void COINLINKAGE Clp_printModel(Clp_Simplex *model, const char *prefix)
Print model for debugging purposes.
COINLIBAPI void COINLINKAGE Clp_chgColumnUpper(Clp_Simplex *model, const double *columnUpper)
Change column upper bounds.
COINLIBAPI int COINLINKAGE ClpSolve_doSingleton(Clp_Solve *)
COINLIBAPI int COINLINKAGE Clp_crash(Clp_Simplex *model, double gap, int pivot)
Crash - at present just aimed at dual, returns -2 if dual preferred and crash basis created -1 if dua...
COINLIBAPI int COINLINKAGE Clp_primal(Clp_Simplex *model, int ifValuesPass)
Primal algorithm - see ClpSimplexPrimal.hpp for method.
COINLIBAPI int COINLINKAGE ClpSolve_doDupcol(Clp_Solve *)
COINLIBAPI int COINLINKAGE Clp_numberColumns(Clp_Simplex *model)
Number of columns.
COINLIBAPI void COINLINKAGE Clp_dropNames(Clp_Simplex *model)
Drops names - makes lengthnames 0 and names empty.
COINLIBAPI const CoinBigIndex *COINLINKAGE Clp_getVectorStarts(Clp_Simplex *model)
COINLIBAPI void COINLINKAGE Clp_addColumns(Clp_Simplex *model, int number, const double *columnLower, const double *columnUpper, const double *objective, const int *columnStarts, const int *rows, const double *elements)
Add columns.
COINLIBAPI const char *COINLINKAGE Clp_Version(void)
Clp library version number as string.
COINLIBAPI double COINLINKAGE Clp_dualTolerance(Clp_Simplex *model)
Dual tolerance to use.
COINLIBAPI void COINLINKAGE Clp_registerCallBack(Clp_Simplex *model, clp_callback userCallBack)
Pass in Callback function.
COINLIBAPI unsigned char *COINLINKAGE Clp_statusArray(Clp_Simplex *model)
Return address of status array (char[numberRows+numberColumns])
COINLIBAPI int COINLINKAGE Clp_initialPrimalSolve(Clp_Simplex *model)
Primal initial solve.
COINLIBAPI void COINLINKAGE ClpSolve_setDoImpliedFree(Clp_Solve *, int doImpliedFree)
void Clp_Solve
COINLIBAPI const double *COINLINKAGE Clp_getElements(Clp_Simplex *model)
COINLIBAPI Clp_Simplex *COINLINKAGE Clp_newModel(void)
Default constructor.
COINLIBAPI void COINLINKAGE Clp_deleteIntegerInformation(Clp_Simplex *model)
Drop integer informations.
This is a very simple class to guide algorithms.
Definition: ClpSolve.hpp:20