Clp  1.17.8
Clp_C_Interface.h
Go to the documentation of this file.
1 /* $Id$ */
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 /* accidentally used a bool for Clp_modifyCoefficient, so need to include stdbool.h
15  * Clp_modifyCoefficient signature will change to use int with Clp 1.18
16  * stdbool.h is available with C99
17  * __STDC_VERSION__ isn't available when compiling C++ - look at C++ version instead
18  */
19 #if (defined(__cplusplus) && __cplusplus >= 199901L) || (defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L)
20 #include <stdbool.h>
21 #endif
22 
23 #if defined(CLP_EXTERN_C)
24 typedef struct {
25  ClpSolve options;
26 } Clp_Solve;
27 #else
28 typedef void Clp_Solve;
29 #endif
30 
36 #ifdef __cplusplus
37 extern "C" {
38 #endif
39 
49 COINLIBAPI const char *COINLINKAGE Clp_Version(void);
51 COINLIBAPI int COINLINKAGE Clp_VersionMajor(void);
53 COINLIBAPI int COINLINKAGE Clp_VersionMinor(void);
55 COINLIBAPI int COINLINKAGE Clp_VersionRelease(void);
71 
73 COINLIBAPI Clp_Simplex *COINLINKAGE Clp_newModel(void);
75 COINLIBAPI void COINLINKAGE Clp_deleteModel(Clp_Simplex *model);
77 COINLIBAPI Clp_Solve *COINLINKAGE ClpSolve_new();
79 COINLIBAPI void COINLINKAGE ClpSolve_delete(Clp_Solve *solve);
97 COINLIBAPI void COINLINKAGE Clp_loadProblem(Clp_Simplex *model, const int numcols, const int numrows,
98  const CoinBigIndex *start, const int *index,
99  const double *value,
100  const double *collb, const double *colub,
101  const double *obj,
102  const double *rowlb, const double *rowub);
103 
104 /* read quadratic part of the objective (the matrix part) */
105 COINLIBAPI void COINLINKAGE
106 Clp_loadQuadraticObjective(Clp_Simplex *model,
107  const int numberColumns,
108  const CoinBigIndex *start,
109  const int *column,
110  const double *element);
112 COINLIBAPI int COINLINKAGE Clp_readMps(Clp_Simplex *model, const char *filename,
113  int keepNames,
114  int ignoreErrors);
119 COINLIBAPI int COINLINKAGE Clp_writeMps(Clp_Simplex *model, const char *filename,
120  int formatType,
121  int numberAcross,
122  double objSense);
124 COINLIBAPI void COINLINKAGE Clp_copyInIntegerInformation(Clp_Simplex *model, const char *information);
126 COINLIBAPI void COINLINKAGE Clp_deleteIntegerInformation(Clp_Simplex *model);
128 COINLIBAPI void COINLINKAGE Clp_resize(Clp_Simplex *model, int newNumberRows, int newNumberColumns);
130 COINLIBAPI void COINLINKAGE Clp_deleteRows(Clp_Simplex *model, int number, const int *which);
132 COINLIBAPI void COINLINKAGE Clp_addRows(Clp_Simplex *model, int number, const double *rowLower,
133  const double *rowUpper,
134  const CoinBigIndex *rowStarts, const int *columns,
135  const double *elements);
136 
138 COINLIBAPI void COINLINKAGE Clp_deleteColumns(Clp_Simplex *model, int number, const int *which);
140 COINLIBAPI void COINLINKAGE Clp_addColumns(Clp_Simplex *model, int number, const double *columnLower,
141  const double *columnUpper,
142  const double *objective,
143  const CoinBigIndex *columnStarts, const int *rows,
144  const double *elements);
146 COINLIBAPI void COINLINKAGE Clp_chgRowLower(Clp_Simplex *model, const double *rowLower);
148 COINLIBAPI void COINLINKAGE Clp_chgRowUpper(Clp_Simplex *model, const double *rowUpper);
150 COINLIBAPI void COINLINKAGE Clp_chgColumnLower(Clp_Simplex *model, const double *columnLower);
152 COINLIBAPI void COINLINKAGE Clp_chgColumnUpper(Clp_Simplex *model, const double *columnUpper);
154 COINLIBAPI void COINLINKAGE Clp_chgObjCoefficients(Clp_Simplex *model, const double *objIn);
159 #if (defined(__cplusplus) && __cplusplus >= 199901L) || (defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L)
160 COINLIBAPI void COINLINKAGE Clp_modifyCoefficient(Clp_Simplex *model, int row, int column, double newElement,
161  bool keepZero);
162 #endif
163 
164 COINLIBAPI void COINLINKAGE Clp_dropNames(Clp_Simplex *model);
166 COINLIBAPI void COINLINKAGE Clp_copyNames(Clp_Simplex *model, const char *const *rowNames,
167  const char *const *columnNames);
168 
173 COINLIBAPI int COINLINKAGE Clp_numberRows(Clp_Simplex *model);
175 COINLIBAPI int COINLINKAGE Clp_numberColumns(Clp_Simplex *model);
177 COINLIBAPI double COINLINKAGE Clp_primalTolerance(Clp_Simplex *model);
178 COINLIBAPI void COINLINKAGE Clp_setPrimalTolerance(Clp_Simplex *model, double value);
180 COINLIBAPI double COINLINKAGE Clp_dualTolerance(Clp_Simplex *model);
181 COINLIBAPI void COINLINKAGE Clp_setDualTolerance(Clp_Simplex *model, double value);
183 COINLIBAPI double COINLINKAGE Clp_dualObjectiveLimit(Clp_Simplex *model);
184 COINLIBAPI void COINLINKAGE Clp_setDualObjectiveLimit(Clp_Simplex *model, double value);
186 COINLIBAPI double COINLINKAGE Clp_objectiveOffset(Clp_Simplex *model);
187 COINLIBAPI void COINLINKAGE Clp_setObjectiveOffset(Clp_Simplex *model, double value);
189 COINLIBAPI void COINLINKAGE Clp_problemName(Clp_Simplex *model, int maxNumberCharacters, char *array);
190 /* Sets problem name. Must have \0 at end. */
191 COINLIBAPI int COINLINKAGE
192 Clp_setProblemName(Clp_Simplex *model, int maxNumberCharacters, char *array);
194 COINLIBAPI int COINLINKAGE Clp_numberIterations(Clp_Simplex *model);
195 COINLIBAPI void COINLINKAGE Clp_setNumberIterations(Clp_Simplex *model, int numberIterations);
197 COINLIBAPI int maximumIterations(Clp_Simplex *model);
198 COINLIBAPI void COINLINKAGE Clp_setMaximumIterations(Clp_Simplex *model, int value);
200 COINLIBAPI double COINLINKAGE Clp_maximumSeconds(Clp_Simplex *model);
201 COINLIBAPI void COINLINKAGE Clp_setMaximumSeconds(Clp_Simplex *model, double value);
203 COINLIBAPI int COINLINKAGE Clp_hitMaximumIterations(Clp_Simplex *model);
211 COINLIBAPI int COINLINKAGE Clp_status(Clp_Simplex *model);
213 COINLIBAPI void COINLINKAGE Clp_setProblemStatus(Clp_Simplex *model, int problemStatus);
221 COINLIBAPI int COINLINKAGE Clp_secondaryStatus(Clp_Simplex *model);
222 COINLIBAPI void COINLINKAGE Clp_setSecondaryStatus(Clp_Simplex *model, int status);
224 COINLIBAPI double COINLINKAGE Clp_optimizationDirection(Clp_Simplex *model);
225 COINLIBAPI void COINLINKAGE Clp_setOptimizationDirection(Clp_Simplex *model, double value);
227 COINLIBAPI double *COINLINKAGE Clp_primalRowSolution(Clp_Simplex *model);
229 COINLIBAPI double *COINLINKAGE Clp_primalColumnSolution(Clp_Simplex *model);
231 COINLIBAPI double *COINLINKAGE Clp_dualRowSolution(Clp_Simplex *model);
233 COINLIBAPI double *COINLINKAGE Clp_dualColumnSolution(Clp_Simplex *model);
235 COINLIBAPI double *COINLINKAGE Clp_rowLower(Clp_Simplex *model);
237 COINLIBAPI double *COINLINKAGE Clp_rowUpper(Clp_Simplex *model);
239 COINLIBAPI double *COINLINKAGE Clp_objective(Clp_Simplex *model);
241 COINLIBAPI double *COINLINKAGE Clp_columnLower(Clp_Simplex *model);
243 COINLIBAPI double *COINLINKAGE Clp_columnUpper(Clp_Simplex *model);
245 COINLIBAPI CoinBigIndex COINLINKAGE Clp_getNumElements(Clp_Simplex *model);
246 /* Column starts in matrix */
247 COINLIBAPI const CoinBigIndex *COINLINKAGE Clp_getVectorStarts(Clp_Simplex *model);
248 /* Row indices in matrix */
249 COINLIBAPI const int *COINLINKAGE Clp_getIndices(Clp_Simplex *model);
250 /* Column vector lengths in matrix */
251 COINLIBAPI const int *COINLINKAGE Clp_getVectorLengths(Clp_Simplex *model);
252 /* Element values in matrix */
253 COINLIBAPI const double *COINLINKAGE Clp_getElements(Clp_Simplex *model);
255 COINLIBAPI double COINLINKAGE Clp_objectiveValue(Clp_Simplex *model);
257 COINLIBAPI char *COINLINKAGE Clp_integerInformation(Clp_Simplex *model);
264 COINLIBAPI double *COINLINKAGE Clp_infeasibilityRay(Clp_Simplex *model);
271 COINLIBAPI double *COINLINKAGE Clp_unboundedRay(Clp_Simplex *model);
273 COINLIBAPI void COINLINKAGE Clp_freeRay(Clp_Simplex *model, double *ray);
275 COINLIBAPI int COINLINKAGE Clp_statusExists(Clp_Simplex *model);
277 COINLIBAPI unsigned char *COINLINKAGE Clp_statusArray(Clp_Simplex *model);
279 COINLIBAPI void COINLINKAGE Clp_copyinStatus(Clp_Simplex *model, const unsigned char *statusArray);
280 /* status values are as in ClpSimplex.hpp i.e. 0 - free, 1 basic, 2 at upper,
281  3 at lower, 4 superbasic, (5 fixed) */
282 /* Get variable basis info */
283 COINLIBAPI int COINLINKAGE Clp_getColumnStatus(Clp_Simplex *model, int sequence);
284 /* Get row basis info */
285 COINLIBAPI int COINLINKAGE Clp_getRowStatus(Clp_Simplex *model, int sequence);
286 /* Set variable basis info (and value if at bound) */
287 COINLIBAPI void COINLINKAGE Clp_setColumnStatus(Clp_Simplex *model,
288  int sequence, int value);
289 /* Set row basis info (and value if at bound) */
290 COINLIBAPI void COINLINKAGE Clp_setRowStatus(Clp_Simplex *model,
291  int sequence, int value);
292 
294 COINLIBAPI void COINLINKAGE Clp_setUserPointer(Clp_Simplex *model, void *pointer);
295 COINLIBAPI void *COINLINKAGE Clp_getUserPointer(Clp_Simplex *model);
301 COINLIBAPI void COINLINKAGE Clp_registerCallBack(Clp_Simplex *model,
302  clp_callback userCallBack);
304 COINLIBAPI void COINLINKAGE Clp_clearCallBack(Clp_Simplex *model);
313 COINLIBAPI void COINLINKAGE Clp_setLogLevel(Clp_Simplex *model, int value);
314 COINLIBAPI int COINLINKAGE Clp_logLevel(Clp_Simplex *model);
316 COINLIBAPI int COINLINKAGE Clp_lengthNames(Clp_Simplex *model);
318 COINLIBAPI void COINLINKAGE Clp_rowName(Clp_Simplex *model, int iRow, char *name);
320 COINLIBAPI void COINLINKAGE Clp_columnName(Clp_Simplex *model, int iColumn, char *name);
322 COINLIBAPI void COINLINKAGE Clp_setRowName(Clp_Simplex *model, int iRow, char *name);
324 COINLIBAPI void COINLINKAGE Clp_setColumnName(Clp_Simplex *model, int iColumn, char *name);
325 
333 COINLIBAPI int COINLINKAGE Clp_initialSolve(Clp_Simplex *model);
335 COINLIBAPI int COINLINKAGE Clp_initialSolveWithOptions(Clp_Simplex *model, Clp_Solve *);
337 COINLIBAPI int COINLINKAGE Clp_initialDualSolve(Clp_Simplex *model);
339 COINLIBAPI int COINLINKAGE Clp_initialPrimalSolve(Clp_Simplex *model);
341 COINLIBAPI int COINLINKAGE Clp_initialBarrierSolve(Clp_Simplex *model);
343 COINLIBAPI int COINLINKAGE Clp_initialBarrierNoCrossSolve(Clp_Simplex *model);
345 COINLIBAPI int COINLINKAGE Clp_dual(Clp_Simplex *model, int ifValuesPass);
347 COINLIBAPI int COINLINKAGE Clp_primal(Clp_Simplex *model, int ifValuesPass);
348 #ifndef SLIM_CLP
349 
350 COINLIBAPI void COINLINKAGE Clp_idiot(Clp_Simplex *model, int tryhard);
351 #endif
352 
353 COINLIBAPI void COINLINKAGE Clp_scaling(Clp_Simplex *model, int mode);
355 COINLIBAPI int COINLINKAGE Clp_scalingFlag(Clp_Simplex *model);
370 COINLIBAPI int COINLINKAGE Clp_crash(Clp_Simplex *model, double gap, int pivot);
376 COINLIBAPI int COINLINKAGE Clp_primalFeasible(Clp_Simplex *model);
378 COINLIBAPI int COINLINKAGE Clp_dualFeasible(Clp_Simplex *model);
380 COINLIBAPI double COINLINKAGE Clp_dualBound(Clp_Simplex *model);
381 COINLIBAPI void COINLINKAGE Clp_setDualBound(Clp_Simplex *model, double value);
383 COINLIBAPI double COINLINKAGE Clp_infeasibilityCost(Clp_Simplex *model);
384 COINLIBAPI void COINLINKAGE Clp_setInfeasibilityCost(Clp_Simplex *model, double value);
393 COINLIBAPI int COINLINKAGE Clp_perturbation(Clp_Simplex *model);
394 COINLIBAPI void COINLINKAGE Clp_setPerturbation(Clp_Simplex *model, int value);
396 COINLIBAPI int COINLINKAGE Clp_algorithm(Clp_Simplex *model);
398 COINLIBAPI void COINLINKAGE Clp_setAlgorithm(Clp_Simplex *model, int value);
400 COINLIBAPI double COINLINKAGE Clp_sumDualInfeasibilities(Clp_Simplex *model);
402 COINLIBAPI int COINLINKAGE Clp_numberDualInfeasibilities(Clp_Simplex *model);
404 COINLIBAPI double COINLINKAGE Clp_sumPrimalInfeasibilities(Clp_Simplex *model);
406 COINLIBAPI int COINLINKAGE Clp_numberPrimalInfeasibilities(Clp_Simplex *model);
413 COINLIBAPI int COINLINKAGE Clp_saveModel(Clp_Simplex *model, const char *fileName);
416 COINLIBAPI int COINLINKAGE Clp_restoreModel(Clp_Simplex *model, const char *fileName);
417 
420 COINLIBAPI void COINLINKAGE Clp_checkSolution(Clp_Simplex *model);
423 /******************** End of most useful part **************/
427 COINLIBAPI int COINLINKAGE Clp_getNumRows(Clp_Simplex *model);
429 COINLIBAPI int COINLINKAGE Clp_getNumCols(Clp_Simplex *model);
431 COINLIBAPI int COINLINKAGE Clp_getIterationCount(Clp_Simplex *model);
433 COINLIBAPI int COINLINKAGE Clp_isAbandoned(Clp_Simplex *model);
435 COINLIBAPI int COINLINKAGE Clp_isProvenOptimal(Clp_Simplex *model);
437 COINLIBAPI int COINLINKAGE Clp_isProvenPrimalInfeasible(Clp_Simplex *model);
439 COINLIBAPI int COINLINKAGE Clp_isProvenDualInfeasible(Clp_Simplex *model);
441 COINLIBAPI int COINLINKAGE Clp_isPrimalObjectiveLimitReached(Clp_Simplex *model);
443 COINLIBAPI int COINLINKAGE Clp_isDualObjectiveLimitReached(Clp_Simplex *model);
445 COINLIBAPI int COINLINKAGE Clp_isIterationLimitReached(Clp_Simplex *model);
447 COINLIBAPI double COINLINKAGE Clp_getObjSense(Clp_Simplex *model);
449 COINLIBAPI void COINLINKAGE Clp_setObjSense(Clp_Simplex *model, double objsen);
451 COINLIBAPI const double *COINLINKAGE Clp_getRowActivity(Clp_Simplex *model);
453 COINLIBAPI const double *COINLINKAGE Clp_getColSolution(Clp_Simplex *model);
454 COINLIBAPI void COINLINKAGE Clp_setColSolution(Clp_Simplex *model, const double *input);
456 COINLIBAPI const double *COINLINKAGE Clp_getRowPrice(Clp_Simplex *model);
458 COINLIBAPI const double *COINLINKAGE Clp_getReducedCost(Clp_Simplex *model);
460 COINLIBAPI const double *COINLINKAGE Clp_getRowLower(Clp_Simplex *model);
462 COINLIBAPI const double *COINLINKAGE Clp_getRowUpper(Clp_Simplex *model);
464 COINLIBAPI const double *COINLINKAGE Clp_getObjCoefficients(Clp_Simplex *model);
466 COINLIBAPI const double *COINLINKAGE Clp_getColLower(Clp_Simplex *model);
468 COINLIBAPI const double *COINLINKAGE Clp_getColUpper(Clp_Simplex *model);
470 COINLIBAPI double COINLINKAGE Clp_getObjValue(Clp_Simplex *model);
472 COINLIBAPI void COINLINKAGE Clp_printModel(Clp_Simplex *model, const char *prefix);
473 /* Small element value - elements less than this set to zero,
474  default is 1.0e-20 */
475 COINLIBAPI double COINLINKAGE Clp_getSmallElementValue(Clp_Simplex *model);
476 COINLIBAPI void COINLINKAGE Clp_setSmallElementValue(Clp_Simplex *model, double value);
482 COINLIBAPI void COINLINKAGE ClpSolve_setSpecialOption(Clp_Solve *, int which, int value, int extraInfo);
483 COINLIBAPI int COINLINKAGE ClpSolve_getSpecialOption(Clp_Solve *, int which);
484 
494 COINLIBAPI void COINLINKAGE ClpSolve_setSolveType(Clp_Solve *, int method, int extraInfo);
495 COINLIBAPI int COINLINKAGE ClpSolve_getSolveType(Clp_Solve *);
496 
503 COINLIBAPI void COINLINKAGE ClpSolve_setPresolveType(Clp_Solve *, int amount, int extraInfo);
504 COINLIBAPI int COINLINKAGE ClpSolve_getPresolveType(Clp_Solve *);
505 
506 COINLIBAPI int COINLINKAGE ClpSolve_getPresolvePasses(Clp_Solve *);
507 COINLIBAPI int COINLINKAGE ClpSolve_getExtraInfo(Clp_Solve *, int which);
508 COINLIBAPI void COINLINKAGE ClpSolve_setInfeasibleReturn(Clp_Solve *, int trueFalse);
509 COINLIBAPI int COINLINKAGE ClpSolve_infeasibleReturn(Clp_Solve *);
510 
511 COINLIBAPI int COINLINKAGE ClpSolve_doDual(Clp_Solve *);
512 COINLIBAPI void COINLINKAGE ClpSolve_setDoDual(Clp_Solve *, int doDual);
513 
514 COINLIBAPI int COINLINKAGE ClpSolve_doSingleton(Clp_Solve *);
515 COINLIBAPI void COINLINKAGE ClpSolve_setDoSingleton(Clp_Solve *, int doSingleton);
516 
517 COINLIBAPI int COINLINKAGE ClpSolve_doDoubleton(Clp_Solve *);
518 COINLIBAPI void COINLINKAGE ClpSolve_setDoDoubleton(Clp_Solve *, int doDoubleton);
519 
520 COINLIBAPI int COINLINKAGE ClpSolve_doTripleton(Clp_Solve *);
521 COINLIBAPI void COINLINKAGE ClpSolve_setDoTripleton(Clp_Solve *, int doTripleton);
522 
523 COINLIBAPI int COINLINKAGE ClpSolve_doTighten(Clp_Solve *);
524 COINLIBAPI void COINLINKAGE ClpSolve_setDoTighten(Clp_Solve *, int doTighten);
525 
526 COINLIBAPI int COINLINKAGE ClpSolve_doForcing(Clp_Solve *);
527 COINLIBAPI void COINLINKAGE ClpSolve_setDoForcing(Clp_Solve *, int doForcing);
528 
529 COINLIBAPI int COINLINKAGE ClpSolve_doImpliedFree(Clp_Solve *);
530 COINLIBAPI void COINLINKAGE ClpSolve_setDoImpliedFree(Clp_Solve *, int doImpliedFree);
531 
532 COINLIBAPI int COINLINKAGE ClpSolve_doDupcol(Clp_Solve *);
533 COINLIBAPI void COINLINKAGE ClpSolve_setDoDupcol(Clp_Solve *, int doDupcol);
534 
535 COINLIBAPI int COINLINKAGE ClpSolve_doDuprow(Clp_Solve *);
536 COINLIBAPI void COINLINKAGE ClpSolve_setDoDuprow(Clp_Solve *, int doDuprow);
537 
538 COINLIBAPI int COINLINKAGE ClpSolve_doSingletonColumn(Clp_Solve *);
539 COINLIBAPI void COINLINKAGE ClpSolve_setDoSingletonColumn(Clp_Solve *, int doSingleton);
540 
541 COINLIBAPI int COINLINKAGE ClpSolve_presolveActions(Clp_Solve *);
542 COINLIBAPI void COINLINKAGE ClpSolve_setPresolveActions(Clp_Solve *, int action);
543 
544 COINLIBAPI int COINLINKAGE ClpSolve_substitution(Clp_Solve *);
545 COINLIBAPI void COINLINKAGE ClpSolve_setSubstitution(Clp_Solve *, int value);
546 
548 #ifdef __cplusplus
549 }
550 #endif
551 #endif
552 
553 /* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
554 */
Clp_perturbation
COINLIBAPI int COINLINKAGE Clp_perturbation(Clp_Simplex *model)
Perturbation: 50 - switch on perturbation 100 - auto perturb if takes too long (1....
Clp_dropNames
COINLIBAPI void COINLINKAGE Clp_dropNames(Clp_Simplex *model)
Change matrix coefficients.
Clp_numberPrimalInfeasibilities
COINLIBAPI int COINLINKAGE Clp_numberPrimalInfeasibilities(Clp_Simplex *model)
Number of primal infeasibilities.
Clp_deleteColumns
COINLIBAPI void COINLINKAGE Clp_deleteColumns(Clp_Simplex *model, int number, const int *which)
Deletes columns.
Clp_getObjValue
COINLIBAPI double COINLINKAGE Clp_getObjValue(Clp_Simplex *model)
Objective value.
Clp_clearCallBack
COINLIBAPI void COINLINKAGE Clp_clearCallBack(Clp_Simplex *model)
Unset Callback function.
ClpSolve_setDoDuprow
COINLIBAPI void COINLINKAGE ClpSolve_setDoDuprow(Clp_Solve *, int doDuprow)
Clp_setProblemName
COINLIBAPI int COINLINKAGE Clp_setProblemName(Clp_Simplex *model, int maxNumberCharacters, char *array)
Clp_setMaximumIterations
COINLIBAPI void COINLINKAGE Clp_setMaximumIterations(Clp_Simplex *model, int value)
Clp_setSecondaryStatus
COINLIBAPI void COINLINKAGE Clp_setSecondaryStatus(Clp_Simplex *model, int status)
ClpSolve_setSubstitution
COINLIBAPI void COINLINKAGE ClpSolve_setSubstitution(Clp_Solve *, int value)
ClpSolve
This is a very simple class to guide algorithms.
Definition: ClpSolve.hpp:20
Clp_setObjSense
COINLIBAPI void COINLINKAGE Clp_setObjSense(Clp_Simplex *model, double objsen)
Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore.
Clp_getNumElements
COINLIBAPI CoinBigIndex COINLINKAGE Clp_getNumElements(Clp_Simplex *model)
Number of elements in matrix.
Clp_infeasibilityRay
COINLIBAPI double *COINLINKAGE Clp_infeasibilityRay(Clp_Simplex *model)
Gives Infeasibility ray.
Clp_newModel
COINLIBAPI Clp_Simplex *COINLINKAGE Clp_newModel(void)
Default constructor.
Clp_VersionMajor
COINLIBAPI int COINLINKAGE Clp_VersionMajor(void)
Major number of Clp library version.
Clp_getRowPrice
const COINLIBAPI double *COINLINKAGE Clp_getRowPrice(Clp_Simplex *model)
Dual row solution.
Clp_setRowName
COINLIBAPI void COINLINKAGE Clp_setRowName(Clp_Simplex *model, int iRow, char *name)
Set row name - Nice if they are short - 8 chars or less I think.
ClpSolve_doDual
COINLIBAPI int COINLINKAGE ClpSolve_doDual(Clp_Solve *)
Clp_scalingFlag
COINLIBAPI int COINLINKAGE Clp_scalingFlag(Clp_Simplex *model)
Gets scalingFlag.
Clp_integerInformation
COINLIBAPI char *COINLINKAGE Clp_integerInformation(Clp_Simplex *model)
Integer information.
Clp_isAbandoned
COINLIBAPI int COINLINKAGE Clp_isAbandoned(Clp_Simplex *model)
Are there a numerical difficulties?
Clp_chgColumnUpper
COINLIBAPI void COINLINKAGE Clp_chgColumnUpper(Clp_Simplex *model, const double *columnUpper)
Change column upper bounds.
Clp_numberIterations
COINLIBAPI int COINLINKAGE Clp_numberIterations(Clp_Simplex *model)
Number of iterations.
Clp_loadProblem
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).
Clp_deleteModel
COINLIBAPI void COINLINKAGE Clp_deleteModel(Clp_Simplex *model)
Destructor.
Clp_setSmallElementValue
COINLIBAPI void COINLINKAGE Clp_setSmallElementValue(Clp_Simplex *model, double value)
Clp_algorithm
COINLIBAPI int COINLINKAGE Clp_algorithm(Clp_Simplex *model)
Current (or last) algorithm.
Clp_dualFeasible
COINLIBAPI int COINLINKAGE Clp_dualFeasible(Clp_Simplex *model)
If problem is dual feasible.
Clp_primalFeasible
COINLIBAPI int COINLINKAGE Clp_primalFeasible(Clp_Simplex *model)
If problem is primal feasible.
Clp_chgRowLower
COINLIBAPI void COINLINKAGE Clp_chgRowLower(Clp_Simplex *model, const double *rowLower)
Change row lower bounds.
ClpSolve_setPresolveActions
COINLIBAPI void COINLINKAGE ClpSolve_setPresolveActions(Clp_Solve *, int action)
ClpSolve_new
COINLIBAPI Clp_Solve *COINLINKAGE ClpSolve_new()
Default constructor.
Clp_freeRay
COINLIBAPI void COINLINKAGE Clp_freeRay(Clp_Simplex *model, double *ray)
Frees a infeasibility or unbounded ray.
Clp_dualObjectiveLimit
COINLIBAPI double COINLINKAGE Clp_dualObjectiveLimit(Clp_Simplex *model)
Dual objective limit.
Clp_isProvenPrimalInfeasible
COINLIBAPI int COINLINKAGE Clp_isProvenPrimalInfeasible(Clp_Simplex *model)
Is primal infeasiblity proven?
Clp_unboundedRay
COINLIBAPI double *COINLINKAGE Clp_unboundedRay(Clp_Simplex *model)
Gives ray in which the problem is unbounded.
Clp_setObjectiveOffset
COINLIBAPI void COINLINKAGE Clp_setObjectiveOffset(Clp_Simplex *model, double value)
Clp_numberDualInfeasibilities
COINLIBAPI int COINLINKAGE Clp_numberDualInfeasibilities(Clp_Simplex *model)
Number of dual infeasibilities.
ClpSolve_getSpecialOption
COINLIBAPI int COINLINKAGE ClpSolve_getSpecialOption(Clp_Solve *, int which)
Clp_columnUpper
COINLIBAPI double *COINLINKAGE Clp_columnUpper(Clp_Simplex *model)
Column Upper.
Clp_primal
COINLIBAPI int COINLINKAGE Clp_primal(Clp_Simplex *model, int ifValuesPass)
Primal algorithm - see ClpSimplexPrimal.hpp for method.
Clp_getIterationCount
COINLIBAPI int COINLINKAGE Clp_getIterationCount(Clp_Simplex *model)
Number of iterations.
Clp_setPerturbation
COINLIBAPI void COINLINKAGE Clp_setPerturbation(Clp_Simplex *model, int value)
Clp_dualRowSolution
COINLIBAPI double *COINLINKAGE Clp_dualRowSolution(Clp_Simplex *model)
Dual row solution.
Clp_copyinStatus
COINLIBAPI void COINLINKAGE Clp_copyinStatus(Clp_Simplex *model, const unsigned char *statusArray)
Copy in status vector.
Clp_sumPrimalInfeasibilities
COINLIBAPI double COINLINKAGE Clp_sumPrimalInfeasibilities(Clp_Simplex *model)
Sum of primal infeasibilities.
Clp_deleteIntegerInformation
COINLIBAPI void COINLINKAGE Clp_deleteIntegerInformation(Clp_Simplex *model)
Drop integer informations.
Clp_setMaximumSeconds
COINLIBAPI void COINLINKAGE Clp_setMaximumSeconds(Clp_Simplex *model, double value)
ClpSolve_getPresolvePasses
COINLIBAPI int COINLINKAGE ClpSolve_getPresolvePasses(Clp_Solve *)
Clp_primalColumnSolution
COINLIBAPI double *COINLINKAGE Clp_primalColumnSolution(Clp_Simplex *model)
Primal column solution.
Clp_getObjSense
COINLIBAPI double COINLINKAGE Clp_getObjSense(Clp_Simplex *model)
Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore.
ClpSolve_delete
COINLIBAPI void COINLINKAGE ClpSolve_delete(Clp_Solve *solve)
Destructor.
Clp_setNumberIterations
COINLIBAPI void COINLINKAGE Clp_setNumberIterations(Clp_Simplex *model, int numberIterations)
Clp_setColumnName
COINLIBAPI void COINLINKAGE Clp_setColumnName(Clp_Simplex *model, int iColumn, char *name)
Set column name - Nice if they are short - 8 chars or less I think.
Clp_rowName
COINLIBAPI void COINLINKAGE Clp_rowName(Clp_Simplex *model, int iRow, char *name)
Fill in array (at least lengthNames+1 long) with a row name.
Clp_secondaryStatus
COINLIBAPI int COINLINKAGE Clp_secondaryStatus(Clp_Simplex *model)
Secondary status of problem - may get extended 0 - none 1 - primal infeasible because dual limit reac...
Clp_problemName
COINLIBAPI void COINLINKAGE Clp_problemName(Clp_Simplex *model, int maxNumberCharacters, char *array)
Fills in array with problem name
Clp_checkSolution
COINLIBAPI void COINLINKAGE Clp_checkSolution(Clp_Simplex *model)
Just check solution (for external use) - sets sum of infeasibilities etc.
Clp_setDualTolerance
COINLIBAPI void COINLINKAGE Clp_setDualTolerance(Clp_Simplex *model, double value)
ClpSolve_setDoImpliedFree
COINLIBAPI void COINLINKAGE ClpSolve_setDoImpliedFree(Clp_Solve *, int doImpliedFree)
Clp_saveModel
COINLIBAPI int COINLINKAGE Clp_saveModel(Clp_Simplex *model, const char *fileName)
Save model to file, returns 0 if success.
Clp_getReducedCost
const COINLIBAPI double *COINLINKAGE Clp_getReducedCost(Clp_Simplex *model)
Reduced costs.
ClpSolve_setDoSingletonColumn
COINLIBAPI void COINLINKAGE ClpSolve_setDoSingletonColumn(Clp_Solve *, int doSingleton)
Clp_copyNames
COINLIBAPI void COINLINKAGE Clp_copyNames(Clp_Simplex *model, const char *const *rowNames, const char *const *columnNames)
Copies in names.
Clp_getColUpper
const COINLIBAPI double *COINLINKAGE Clp_getColUpper(Clp_Simplex *model)
Column Upper.
ClpSolve_doDupcol
COINLIBAPI int COINLINKAGE ClpSolve_doDupcol(Clp_Solve *)
Clp_objectiveValue
COINLIBAPI double COINLINKAGE Clp_objectiveValue(Clp_Simplex *model)
Objective value.
ClpSolve_setDoTighten
COINLIBAPI void COINLINKAGE ClpSolve_setDoTighten(Clp_Solve *, int doTighten)
Clp_numberColumns
COINLIBAPI int COINLINKAGE Clp_numberColumns(Clp_Simplex *model)
Number of columns.
Clp_getElements
const COINLIBAPI double *COINLINKAGE Clp_getElements(Clp_Simplex *model)
Clp_optimizationDirection
COINLIBAPI double COINLINKAGE Clp_optimizationDirection(Clp_Simplex *model)
Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore.
Clp_columnName
COINLIBAPI void COINLINKAGE Clp_columnName(Clp_Simplex *model, int iColumn, char *name)
Fill in array (at least lengthNames+1 long) with a column name.
Clp_initialSolveWithOptions
COINLIBAPI int COINLINKAGE Clp_initialSolveWithOptions(Clp_Simplex *model, Clp_Solve *)
Pass solve options.
ClpSolve_getPresolveType
COINLIBAPI int COINLINKAGE ClpSolve_getPresolveType(Clp_Solve *)
ClpSolve_setDoSingleton
COINLIBAPI void COINLINKAGE ClpSolve_setDoSingleton(Clp_Solve *, int doSingleton)
Clp_chgRowUpper
COINLIBAPI void COINLINKAGE Clp_chgRowUpper(Clp_Simplex *model, const double *rowUpper)
Change row upper bounds.
Clp_sumDualInfeasibilities
COINLIBAPI double COINLINKAGE Clp_sumDualInfeasibilities(Clp_Simplex *model)
Sum of dual infeasibilities.
ClpSolve_doImpliedFree
COINLIBAPI int COINLINKAGE ClpSolve_doImpliedFree(Clp_Solve *)
Clp_dualBound
COINLIBAPI double COINLINKAGE Clp_dualBound(Clp_Simplex *model)
Dual bound.
Clp_initialBarrierSolve
COINLIBAPI int COINLINKAGE Clp_initialBarrierSolve(Clp_Simplex *model)
Barrier initial solve.
ClpSolve_doSingletonColumn
COINLIBAPI int COINLINKAGE ClpSolve_doSingletonColumn(Clp_Solve *)
Clp_getColLower
const COINLIBAPI double *COINLINKAGE Clp_getColLower(Clp_Simplex *model)
Column Lower.
ClpSolve_doSingleton
COINLIBAPI int COINLINKAGE ClpSolve_doSingleton(Clp_Solve *)
Clp_dualTolerance
COINLIBAPI double COINLINKAGE Clp_dualTolerance(Clp_Simplex *model)
Dual tolerance to use.
Clp_columnLower
COINLIBAPI double *COINLINKAGE Clp_columnLower(Clp_Simplex *model)
Column Lower.
Clp_setRowStatus
COINLIBAPI void COINLINKAGE Clp_setRowStatus(Clp_Simplex *model, int sequence, int value)
Clp_objective
COINLIBAPI double *COINLINKAGE Clp_objective(Clp_Simplex *model)
Objective.
Clp_setInfeasibilityCost
COINLIBAPI void COINLINKAGE Clp_setInfeasibilityCost(Clp_Simplex *model, double value)
Clp_setAlgorithm
COINLIBAPI void COINLINKAGE Clp_setAlgorithm(Clp_Simplex *model, int value)
Set algorithm.
Clp_scaling
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)
ClpSolve_doDuprow
COINLIBAPI int COINLINKAGE ClpSolve_doDuprow(Clp_Solve *)
ClpSolve_infeasibleReturn
COINLIBAPI int COINLINKAGE ClpSolve_infeasibleReturn(Clp_Solve *)
Clp_setLogLevel
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...
Clp_getVectorStarts
const COINLIBAPI CoinBigIndex *COINLINKAGE Clp_getVectorStarts(Clp_Simplex *model)
Clp_maximumSeconds
COINLIBAPI double COINLINKAGE Clp_maximumSeconds(Clp_Simplex *model)
Maximum time in seconds (from when set called)
Clp_addColumns
COINLIBAPI void COINLINKAGE Clp_addColumns(Clp_Simplex *model, int number, const double *columnLower, const double *columnUpper, const double *objective, const CoinBigIndex *columnStarts, const int *rows, const double *elements)
Add columns.
Clp_infeasibilityCost
COINLIBAPI double COINLINKAGE Clp_infeasibilityCost(Clp_Simplex *model)
Infeasibility cost.
Clp_writeMps
COINLIBAPI int COINLINKAGE Clp_writeMps(Clp_Simplex *model, const char *filename, int formatType, int numberAcross, double objSense)
Write an mps file to the given filename.
maximumIterations
COINLIBAPI int maximumIterations(Clp_Simplex *model)
Maximum number of iterations.
Clp_objectiveOffset
COINLIBAPI double COINLINKAGE Clp_objectiveOffset(Clp_Simplex *model)
Objective offset.
Clp_getNumRows
COINLIBAPI int COINLINKAGE Clp_getNumRows(Clp_Simplex *model)
Number of rows.
Clp_chgColumnLower
COINLIBAPI void COINLINKAGE Clp_chgColumnLower(Clp_Simplex *model, const double *columnLower)
Change column lower bounds.
Clp_initialDualSolve
COINLIBAPI int COINLINKAGE Clp_initialDualSolve(Clp_Simplex *model)
Dual initial solve.
ClpSolve_doDoubleton
COINLIBAPI int COINLINKAGE ClpSolve_doDoubleton(Clp_Solve *)
Clp_idiot
COINLIBAPI void COINLINKAGE Clp_idiot(Clp_Simplex *model, int tryhard)
Solve the problem with the idiot code.
Clp_dualColumnSolution
COINLIBAPI double *COINLINKAGE Clp_dualColumnSolution(Clp_Simplex *model)
Reduced costs.
ClpSolve_setDoDupcol
COINLIBAPI void COINLINKAGE ClpSolve_setDoDupcol(Clp_Solve *, int doDupcol)
Clp_crash
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...
Clp_addRows
COINLIBAPI void COINLINKAGE Clp_addRows(Clp_Simplex *model, int number, const double *rowLower, const double *rowUpper, const CoinBigIndex *rowStarts, const int *columns, const double *elements)
Add rows.
Clp_getRowActivity
const COINLIBAPI double *COINLINKAGE Clp_getRowActivity(Clp_Simplex *model)
Primal row solution.
ClpSolve_setSpecialOption
COINLIBAPI void COINLINKAGE ClpSolve_setSpecialOption(Clp_Solve *, int which, int value, int extraInfo)
Clp_printModel
COINLIBAPI void COINLINKAGE Clp_printModel(Clp_Simplex *model, const char *prefix)
Print model for debugging purposes.
Clp_Solve
void Clp_Solve
Definition: Clp_C_Interface.h:28
Clp_setColSolution
COINLIBAPI void COINLINKAGE Clp_setColSolution(Clp_Simplex *model, const double *input)
ClpSolve_setPresolveType
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...
Clp_dual
COINLIBAPI int COINLINKAGE Clp_dual(Clp_Simplex *model, int ifValuesPass)
Dual algorithm - see ClpSimplexDual.hpp for method.
Clp_hitMaximumIterations
COINLIBAPI int COINLINKAGE Clp_hitMaximumIterations(Clp_Simplex *model)
Returns true if hit maximum iterations (or time)
Clp_getSmallElementValue
COINLIBAPI double COINLINKAGE Clp_getSmallElementValue(Clp_Simplex *model)
Clp_chgObjCoefficients
COINLIBAPI void COINLINKAGE Clp_chgObjCoefficients(Clp_Simplex *model, const double *objIn)
Change objective coefficients.
Clp_restoreModel
COINLIBAPI int COINLINKAGE Clp_restoreModel(Clp_Simplex *model, const char *fileName)
Restore model from file, returns 0 if success, deletes current model.
Clp_getVectorLengths
const COINLIBAPI int *COINLINKAGE Clp_getVectorLengths(Clp_Simplex *model)
Clp_setPrimalTolerance
COINLIBAPI void COINLINKAGE Clp_setPrimalTolerance(Clp_Simplex *model, double value)
Clp_initialPrimalSolve
COINLIBAPI int COINLINKAGE Clp_initialPrimalSolve(Clp_Simplex *model)
Primal initial solve.
ClpSolve_setDoDoubleton
COINLIBAPI void COINLINKAGE ClpSolve_setDoDoubleton(Clp_Solve *, int doDoubleton)
Clp_status
COINLIBAPI int COINLINKAGE Clp_status(Clp_Simplex *model)
Status of problem: 0 - optimal 1 - primal infeasible 2 - dual infeasible 3 - stopped on iterations et...
Clp_getUserPointer
COINLIBAPI void *COINLINKAGE Clp_getUserPointer(Clp_Simplex *model)
Clp_setUserPointer
COINLIBAPI void COINLINKAGE Clp_setUserPointer(Clp_Simplex *model, void *pointer)
User pointer for whatever reason.
Clp_getRowLower
const COINLIBAPI double *COINLINKAGE Clp_getRowLower(Clp_Simplex *model)
Row lower.
Clp_registerCallBack
COINLIBAPI void COINLINKAGE Clp_registerCallBack(Clp_Simplex *model, clp_callback userCallBack)
Pass in Callback function.
Clp_deleteRows
COINLIBAPI void COINLINKAGE Clp_deleteRows(Clp_Simplex *model, int number, const int *which)
Deletes rows.
ClpSolve_setInfeasibleReturn
COINLIBAPI void COINLINKAGE ClpSolve_setInfeasibleReturn(Clp_Solve *, int trueFalse)
Clp_resize
COINLIBAPI void COINLINKAGE Clp_resize(Clp_Simplex *model, int newNumberRows, int newNumberColumns)
Resizes rim part of model
ClpSolve_presolveActions
COINLIBAPI int COINLINKAGE ClpSolve_presolveActions(Clp_Solve *)
ClpSolve_getExtraInfo
COINLIBAPI int COINLINKAGE ClpSolve_getExtraInfo(Clp_Solve *, int which)
Clp_primalTolerance
COINLIBAPI double COINLINKAGE Clp_primalTolerance(Clp_Simplex *model)
Primal tolerance to use.
ClpSolve_doForcing
COINLIBAPI int COINLINKAGE ClpSolve_doForcing(Clp_Solve *)
Clp_getRowStatus
COINLIBAPI int COINLINKAGE Clp_getRowStatus(Clp_Simplex *model, int sequence)
Clp_logLevel
COINLIBAPI int COINLINKAGE Clp_logLevel(Clp_Simplex *model)
Clp_isProvenDualInfeasible
COINLIBAPI int COINLINKAGE Clp_isProvenDualInfeasible(Clp_Simplex *model)
Is dual infeasiblity proven?
Clp_Version
const COINLIBAPI char *COINLINKAGE Clp_Version(void)
Clp library version number as string.
Clp_VersionMinor
COINLIBAPI int COINLINKAGE Clp_VersionMinor(void)
Minor number of Clp library version.
Clp_isPrimalObjectiveLimitReached
COINLIBAPI int COINLINKAGE Clp_isPrimalObjectiveLimitReached(Clp_Simplex *model)
Is the given primal objective limit reached?
Clp_setColumnStatus
COINLIBAPI void COINLINKAGE Clp_setColumnStatus(Clp_Simplex *model, int sequence, int value)
ClpSolve_getSolveType
COINLIBAPI int COINLINKAGE ClpSolve_getSolveType(Clp_Solve *)
Clp_getIndices
const COINLIBAPI int *COINLINKAGE Clp_getIndices(Clp_Simplex *model)
Clp_isIterationLimitReached
COINLIBAPI int COINLINKAGE Clp_isIterationLimitReached(Clp_Simplex *model)
Iteration limit reached?
Clp_loadQuadraticObjective
COINLIBAPI void COINLINKAGE Clp_loadQuadraticObjective(Clp_Simplex *model, const int numberColumns, const CoinBigIndex *start, const int *column, const double *element)
Clp_statusExists
COINLIBAPI int COINLINKAGE Clp_statusExists(Clp_Simplex *model)
See if status array exists (partly for OsiClp)
Clp_getColSolution
const COINLIBAPI double *COINLINKAGE Clp_getColSolution(Clp_Simplex *model)
Primal column solution.
ClpSolve_setSolveType
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...
Clp_initialSolve
COINLIBAPI int COINLINKAGE Clp_initialSolve(Clp_Simplex *model)
General solve algorithm which can do presolve.
ClpSolve_doTighten
COINLIBAPI int COINLINKAGE ClpSolve_doTighten(Clp_Solve *)
Clp_numberRows
COINLIBAPI int COINLINKAGE Clp_numberRows(Clp_Simplex *model)
Number of rows.
ClpSolve_setDoForcing
COINLIBAPI void COINLINKAGE ClpSolve_setDoForcing(Clp_Solve *, int doForcing)
Clp_isDualObjectiveLimitReached
COINLIBAPI int COINLINKAGE Clp_isDualObjectiveLimitReached(Clp_Simplex *model)
Is the given dual objective limit reached?
Clp_getRowUpper
const COINLIBAPI double *COINLINKAGE Clp_getRowUpper(Clp_Simplex *model)
Row upper
Clp_primalRowSolution
COINLIBAPI double *COINLINKAGE Clp_primalRowSolution(Clp_Simplex *model)
Primal row solution.
Clp_setProblemStatus
COINLIBAPI void COINLINKAGE Clp_setProblemStatus(Clp_Simplex *model, int problemStatus)
Set problem status.
Clp_getObjCoefficients
const COINLIBAPI double *COINLINKAGE Clp_getObjCoefficients(Clp_Simplex *model)
Objective.
Clp_statusArray
COINLIBAPI unsigned char *COINLINKAGE Clp_statusArray(Clp_Simplex *model)
Return address of status array (char[numberRows+numberColumns])
Clp_initialBarrierNoCrossSolve
COINLIBAPI int COINLINKAGE Clp_initialBarrierNoCrossSolve(Clp_Simplex *model)
Barrier initial solve, no crossover.
Clp_setDualBound
COINLIBAPI void COINLINKAGE Clp_setDualBound(Clp_Simplex *model, double value)
ClpSolve_setDoDual
COINLIBAPI void COINLINKAGE ClpSolve_setDoDual(Clp_Solve *, int doDual)
Clp_readMps
COINLIBAPI int COINLINKAGE Clp_readMps(Clp_Simplex *model, const char *filename, int keepNames, int ignoreErrors)
Read an mps file from the given filename.
Clp_setDualObjectiveLimit
COINLIBAPI void COINLINKAGE Clp_setDualObjectiveLimit(Clp_Simplex *model, double value)
ClpSolve_doTripleton
COINLIBAPI int COINLINKAGE ClpSolve_doTripleton(Clp_Solve *)
Clp_isProvenOptimal
COINLIBAPI int COINLINKAGE Clp_isProvenOptimal(Clp_Simplex *model)
Is optimality proven?
Clp_VersionRelease
COINLIBAPI int COINLINKAGE Clp_VersionRelease(void)
Release number of Clp library version.
ClpSolve_setDoTripleton
COINLIBAPI void COINLINKAGE ClpSolve_setDoTripleton(Clp_Solve *, int doTripleton)
Clp_setOptimizationDirection
COINLIBAPI void COINLINKAGE Clp_setOptimizationDirection(Clp_Simplex *model, double value)
Clp_getColumnStatus
COINLIBAPI int COINLINKAGE Clp_getColumnStatus(Clp_Simplex *model, int sequence)
Clp_copyInIntegerInformation
COINLIBAPI void COINLINKAGE Clp_copyInIntegerInformation(Clp_Simplex *model, const char *information)
Copy in integer informations.
Clp_getNumCols
COINLIBAPI int COINLINKAGE Clp_getNumCols(Clp_Simplex *model)
Number of columns.
Clp_rowLower
COINLIBAPI double *COINLINKAGE Clp_rowLower(Clp_Simplex *model)
Row lower.
ClpSolve_substitution
COINLIBAPI int COINLINKAGE ClpSolve_substitution(Clp_Solve *)
Clp_rowUpper
COINLIBAPI double *COINLINKAGE Clp_rowUpper(Clp_Simplex *model)
Row upper
Clp_lengthNames
COINLIBAPI int COINLINKAGE Clp_lengthNames(Clp_Simplex *model)
length of names (0 means no names0
Generated by   doxygen 1.8.17