source: trunk/Clp/src/Clp_C_Interface.h @ 2385

Last change on this file since 2385 was 2385, checked in by unxusr, 4 months ago

formatting

  • Property svn:eol-style set to native
  • Property svn:keywords set to Id
File size: 23.5 KB
Line 
1/* $Id: Clp_C_Interface.h 2385 2019-01-06 19:43:06Z unxusr $ */
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
22/** This is a first "C" interface to Clp.
23    It has similarities to the OSL V3 interface
24    and only has most common functions
25*/
26
27#ifdef __cplusplus
28extern "C" {
29#endif
30
31/**@name Version info
32      *
33      * A Clp library has a version number of the form <major>.<minor>.<release>,
34      * where each of major, minor, and release are nonnegative integers.
35      * For a checkout of the Clp stable branch, release is 9999.
36      * For a checkout of the Clp development branch, major, minor, and release are 9999.
37      */
38/*@{*/
39/** Clp library version number as string. */
40COINLIBAPI const char *COINLINKAGE Clp_Version(void);
41/** Major number of Clp library version. */
42COINLIBAPI int COINLINKAGE Clp_VersionMajor(void);
43/** Minor number of Clp library version. */
44COINLIBAPI int COINLINKAGE Clp_VersionMinor(void);
45/** Release number of Clp library version. */
46COINLIBAPI int COINLINKAGE Clp_VersionRelease(void);
47/*@}*/
48
49/**@name Constructors and destructor
50        These do not have an exact analogue in C++.
51        The user does not need to know structure of Clp_Simplex or Clp_Solve.
52
53        For (almost) all Clp_* functions outside this group there is an exact C++
54        analogue created by taking the first parameter out, removing the Clp_
55        from name and applying the method to an object of type ClpSimplex.
56       
57        Similarly, for all ClpSolve_* functions there is an exact C++
58        analogue created by taking the first parameter out, removing the ClpSolve_
59        from name and applying the method to an object of type ClpSolve.
60     */
61/*@{*/
62
63/** Default constructor */
64COINLIBAPI Clp_Simplex *COINLINKAGE Clp_newModel(void);
65/** Destructor */
66COINLIBAPI void COINLINKAGE Clp_deleteModel(Clp_Simplex *model);
67/** Default constructor */
68COINLIBAPI Clp_Solve *COINLINKAGE ClpSolve_new();
69/** Destructor */
70COINLIBAPI void COINLINKAGE ClpSolve_delete(Clp_Solve *solve);
71/*@}*/
72
73/**@name Load model - loads some stuff and initializes others */
74/*@{*/
75/** Loads a problem (the constraints on the
76         rows are given by lower and upper bounds). If a pointer is NULL then the
77         following values are the default:
78         <ul>
79         <li> <code>colub</code>: all columns have upper bound infinity
80         <li> <code>collb</code>: all columns have lower bound 0
81         <li> <code>rowub</code>: all rows have upper bound infinity
82         <li> <code>rowlb</code>: all rows have lower bound -infinity
83         <li> <code>obj</code>: all variables have 0 objective coefficient
84         </ul>
85     */
86/** Just like the other loadProblem() method except that the matrix is
87     given in a standard column major ordered format (without gaps). */
88COINLIBAPI 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) */
96COINLIBAPI void COINLINKAGE
97Clp_loadQuadraticObjective(Clp_Simplex *model,
98  const int numberColumns,
99  const CoinBigIndex *start,
100  const int *column,
101  const double *element);
102/** Read an mps file from the given filename */
103COINLIBAPI int COINLINKAGE Clp_readMps(Clp_Simplex *model, const char *filename,
104  int keepNames,
105  int ignoreErrors);
106/** Copy in integer informations */
107COINLIBAPI void COINLINKAGE Clp_copyInIntegerInformation(Clp_Simplex *model, const char *information);
108/** Drop integer informations */
109COINLIBAPI void COINLINKAGE Clp_deleteIntegerInformation(Clp_Simplex *model);
110/** Resizes rim part of model  */
111COINLIBAPI void COINLINKAGE Clp_resize(Clp_Simplex *model, int newNumberRows, int newNumberColumns);
112/** Deletes rows */
113COINLIBAPI void COINLINKAGE Clp_deleteRows(Clp_Simplex *model, int number, const int *which);
114/** Add rows */
115COINLIBAPI void COINLINKAGE Clp_addRows(Clp_Simplex *model, int number, const double *rowLower,
116  const double *rowUpper,
117  const CoinBigIndex *rowStarts, const int *columns,
118  const double *elements);
119
120/** Deletes columns */
121COINLIBAPI void COINLINKAGE Clp_deleteColumns(Clp_Simplex *model, int number, const int *which);
122/** Add columns */
123COINLIBAPI void COINLINKAGE Clp_addColumns(Clp_Simplex *model, int number, const double *columnLower,
124  const double *columnUpper,
125  const double *objective,
126  const CoinBigIndex *columnStarts, const int *rows,
127  const double *elements);
128/** Change row lower bounds */
129COINLIBAPI void COINLINKAGE Clp_chgRowLower(Clp_Simplex *model, const double *rowLower);
130/** Change row upper bounds */
131COINLIBAPI void COINLINKAGE Clp_chgRowUpper(Clp_Simplex *model, const double *rowUpper);
132/** Change column lower bounds */
133COINLIBAPI void COINLINKAGE Clp_chgColumnLower(Clp_Simplex *model, const double *columnLower);
134/** Change column upper bounds */
135COINLIBAPI void COINLINKAGE Clp_chgColumnUpper(Clp_Simplex *model, const double *columnUpper);
136/** Change objective coefficients */
137COINLIBAPI void COINLINKAGE Clp_chgObjCoefficients(Clp_Simplex *model, const double *objIn);
138/** Drops names - makes lengthnames 0 and names empty */
139COINLIBAPI void COINLINKAGE Clp_dropNames(Clp_Simplex *model);
140/** Copies in names */
141COINLIBAPI void COINLINKAGE Clp_copyNames(Clp_Simplex *model, const char *const *rowNames,
142  const char *const *columnNames);
143
144/*@}*/
145/**@name gets and sets - you will find some synonyms at the end of this file */
146/*@{*/
147/** Number of rows */
148COINLIBAPI int COINLINKAGE Clp_numberRows(Clp_Simplex *model);
149/** Number of columns */
150COINLIBAPI int COINLINKAGE Clp_numberColumns(Clp_Simplex *model);
151/** Primal tolerance to use */
152COINLIBAPI double COINLINKAGE Clp_primalTolerance(Clp_Simplex *model);
153COINLIBAPI void COINLINKAGE Clp_setPrimalTolerance(Clp_Simplex *model, double value);
154/** Dual tolerance to use */
155COINLIBAPI double COINLINKAGE Clp_dualTolerance(Clp_Simplex *model);
156COINLIBAPI void COINLINKAGE Clp_setDualTolerance(Clp_Simplex *model, double value);
157/** Dual objective limit */
158COINLIBAPI double COINLINKAGE Clp_dualObjectiveLimit(Clp_Simplex *model);
159COINLIBAPI void COINLINKAGE Clp_setDualObjectiveLimit(Clp_Simplex *model, double value);
160/** Objective offset */
161COINLIBAPI double COINLINKAGE Clp_objectiveOffset(Clp_Simplex *model);
162COINLIBAPI void COINLINKAGE Clp_setObjectiveOffset(Clp_Simplex *model, double value);
163/** Fills in array with problem name  */
164COINLIBAPI void COINLINKAGE Clp_problemName(Clp_Simplex *model, int maxNumberCharacters, char *array);
165/* Sets problem name.  Must have \0 at end.  */
166COINLIBAPI int COINLINKAGE
167Clp_setProblemName(Clp_Simplex *model, int maxNumberCharacters, char *array);
168/** Number of iterations */
169COINLIBAPI int COINLINKAGE Clp_numberIterations(Clp_Simplex *model);
170COINLIBAPI void COINLINKAGE Clp_setNumberIterations(Clp_Simplex *model, int numberIterations);
171/** Maximum number of iterations */
172COINLIBAPI int maximumIterations(Clp_Simplex *model);
173COINLIBAPI void COINLINKAGE Clp_setMaximumIterations(Clp_Simplex *model, int value);
174/** Maximum time in seconds (from when set called) */
175COINLIBAPI double COINLINKAGE Clp_maximumSeconds(Clp_Simplex *model);
176COINLIBAPI void COINLINKAGE Clp_setMaximumSeconds(Clp_Simplex *model, double value);
177/** Returns true if hit maximum iterations (or time) */
178COINLIBAPI int COINLINKAGE Clp_hitMaximumIterations(Clp_Simplex *model);
179/** Status of problem:
180         0 - optimal
181         1 - primal infeasible
182         2 - dual infeasible
183         3 - stopped on iterations etc
184         4 - stopped due to errors
185     */
186COINLIBAPI int COINLINKAGE Clp_status(Clp_Simplex *model);
187/** Set problem status */
188COINLIBAPI void COINLINKAGE Clp_setProblemStatus(Clp_Simplex *model, int problemStatus);
189/** Secondary status of problem - may get extended
190         0 - none
191         1 - primal infeasible because dual limit reached
192         2 - scaled problem optimal - unscaled has primal infeasibilities
193         3 - scaled problem optimal - unscaled has dual infeasibilities
194         4 - scaled problem optimal - unscaled has both dual and primal infeasibilities
195     */
196COINLIBAPI int COINLINKAGE Clp_secondaryStatus(Clp_Simplex *model);
197COINLIBAPI void COINLINKAGE Clp_setSecondaryStatus(Clp_Simplex *model, int status);
198/** Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore */
199COINLIBAPI double COINLINKAGE Clp_optimizationDirection(Clp_Simplex *model);
200COINLIBAPI void COINLINKAGE Clp_setOptimizationDirection(Clp_Simplex *model, double value);
201/** Primal row solution */
202COINLIBAPI double *COINLINKAGE Clp_primalRowSolution(Clp_Simplex *model);
203/** Primal column solution */
204COINLIBAPI double *COINLINKAGE Clp_primalColumnSolution(Clp_Simplex *model);
205/** Dual row solution */
206COINLIBAPI double *COINLINKAGE Clp_dualRowSolution(Clp_Simplex *model);
207/** Reduced costs */
208COINLIBAPI double *COINLINKAGE Clp_dualColumnSolution(Clp_Simplex *model);
209/** Row lower */
210COINLIBAPI double *COINLINKAGE Clp_rowLower(Clp_Simplex *model);
211/** Row upper  */
212COINLIBAPI double *COINLINKAGE Clp_rowUpper(Clp_Simplex *model);
213/** Objective */
214COINLIBAPI double *COINLINKAGE Clp_objective(Clp_Simplex *model);
215/** Column Lower */
216COINLIBAPI double *COINLINKAGE Clp_columnLower(Clp_Simplex *model);
217/** Column Upper */
218COINLIBAPI double *COINLINKAGE Clp_columnUpper(Clp_Simplex *model);
219/** Number of elements in matrix */
220COINLIBAPI CoinBigIndex COINLINKAGE Clp_getNumElements(Clp_Simplex *model);
221/* Column starts in matrix */
222COINLIBAPI const CoinBigIndex *COINLINKAGE Clp_getVectorStarts(Clp_Simplex *model);
223/* Row indices in matrix */
224COINLIBAPI const int *COINLINKAGE Clp_getIndices(Clp_Simplex *model);
225/* Column vector lengths in matrix */
226COINLIBAPI const int *COINLINKAGE Clp_getVectorLengths(Clp_Simplex *model);
227/* Element values in matrix */
228COINLIBAPI const double *COINLINKAGE Clp_getElements(Clp_Simplex *model);
229/** Objective value */
230COINLIBAPI double COINLINKAGE Clp_objectiveValue(Clp_Simplex *model);
231/** Integer information */
232COINLIBAPI char *COINLINKAGE Clp_integerInformation(Clp_Simplex *model);
233/** Gives Infeasibility ray.
234      *
235      * Use Clp_freeRay to free the returned array.
236      *
237      * @return infeasibility ray, or NULL returned if none/wrong.
238      */
239COINLIBAPI double *COINLINKAGE Clp_infeasibilityRay(Clp_Simplex *model);
240/** Gives ray in which the problem is unbounded.
241      *
242      * Use Clp_freeRay to free the returned array.
243      *
244      * @return unbounded ray, or NULL returned if none/wrong.
245      */
246COINLIBAPI double *COINLINKAGE Clp_unboundedRay(Clp_Simplex *model);
247/** Frees a infeasibility or unbounded ray. */
248COINLIBAPI void COINLINKAGE Clp_freeRay(Clp_Simplex *model, double *ray);
249/** See if status array exists (partly for OsiClp) */
250COINLIBAPI int COINLINKAGE Clp_statusExists(Clp_Simplex *model);
251/** Return address of status array (char[numberRows+numberColumns]) */
252COINLIBAPI unsigned char *COINLINKAGE Clp_statusArray(Clp_Simplex *model);
253/** Copy in status vector */
254COINLIBAPI 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 */
258COINLIBAPI int COINLINKAGE Clp_getColumnStatus(Clp_Simplex *model, int sequence);
259/* Get row basis info */
260COINLIBAPI int COINLINKAGE Clp_getRowStatus(Clp_Simplex *model, int sequence);
261/* Set variable basis info (and value if at bound) */
262COINLIBAPI void COINLINKAGE Clp_setColumnStatus(Clp_Simplex *model,
263  int sequence, int value);
264/* Set row basis info (and value if at bound) */
265COINLIBAPI void COINLINKAGE Clp_setRowStatus(Clp_Simplex *model,
266  int sequence, int value);
267
268/** User pointer for whatever reason */
269COINLIBAPI void COINLINKAGE Clp_setUserPointer(Clp_Simplex *model, void *pointer);
270COINLIBAPI void *COINLINKAGE Clp_getUserPointer(Clp_Simplex *model);
271/*@}*/
272/**@name Message handling.  Call backs are handled by ONE function */
273/*@{*/
274/** Pass in Callback function.
275      Message numbers up to 1000000 are Clp, Coin ones have 1000000 added */
276COINLIBAPI void COINLINKAGE Clp_registerCallBack(Clp_Simplex *model,
277  clp_callback userCallBack);
278/** Unset Callback function */
279COINLIBAPI void COINLINKAGE Clp_clearCallBack(Clp_Simplex *model);
280/** Amount of print out:
281         0 - none
282         1 - just final
283         2 - just factorizations
284         3 - as 2 plus a bit more
285         4 - verbose
286         above that 8,16,32 etc just for selective debug
287     */
288COINLIBAPI void COINLINKAGE Clp_setLogLevel(Clp_Simplex *model, int value);
289COINLIBAPI int COINLINKAGE Clp_logLevel(Clp_Simplex *model);
290/** length of names (0 means no names0 */
291COINLIBAPI int COINLINKAGE Clp_lengthNames(Clp_Simplex *model);
292/** Fill in array (at least lengthNames+1 long) with a row name */
293COINLIBAPI void COINLINKAGE Clp_rowName(Clp_Simplex *model, int iRow, char *name);
294/** Fill in array (at least lengthNames+1 long) with a column name */
295COINLIBAPI void COINLINKAGE Clp_columnName(Clp_Simplex *model, int iColumn, char *name);
296
297/*@}*/
298
299/**@name Functions most useful to user */
300/*@{*/
301/** General solve algorithm which can do presolve.
302         See  ClpSolve.hpp for options
303      */
304COINLIBAPI int COINLINKAGE Clp_initialSolve(Clp_Simplex *model);
305/** Pass solve options. (Exception to direct analogue rule) */
306COINLIBAPI int COINLINKAGE Clp_initialSolveWithOptions(Clp_Simplex *model, Clp_Solve *);
307/** Dual initial solve */
308COINLIBAPI int COINLINKAGE Clp_initialDualSolve(Clp_Simplex *model);
309/** Primal initial solve */
310COINLIBAPI int COINLINKAGE Clp_initialPrimalSolve(Clp_Simplex *model);
311/** Barrier initial solve */
312COINLIBAPI int COINLINKAGE Clp_initialBarrierSolve(Clp_Simplex *model);
313/** Barrier initial solve, no crossover */
314COINLIBAPI int COINLINKAGE Clp_initialBarrierNoCrossSolve(Clp_Simplex *model);
315/** Dual algorithm - see ClpSimplexDual.hpp for method */
316COINLIBAPI int COINLINKAGE Clp_dual(Clp_Simplex *model, int ifValuesPass);
317/** Primal algorithm - see ClpSimplexPrimal.hpp for method */
318COINLIBAPI int COINLINKAGE Clp_primal(Clp_Simplex *model, int ifValuesPass);
319#ifndef SLIM_CLP
320/** Solve the problem with the idiot code */
321COINLIBAPI void COINLINKAGE Clp_idiot(Clp_Simplex *model, int tryhard);
322#endif
323/** Sets or unsets scaling, 0 -off, 1 equilibrium, 2 geometric, 3, auto, 4 dynamic(later) */
324COINLIBAPI void COINLINKAGE Clp_scaling(Clp_Simplex *model, int mode);
325/** Gets scalingFlag */
326COINLIBAPI int COINLINKAGE Clp_scalingFlag(Clp_Simplex *model);
327/** Crash - at present just aimed at dual, returns
328         -2 if dual preferred and crash basis created
329         -1 if dual preferred and all slack basis preferred
330          0 if basis going in was not all slack
331          1 if primal preferred and all slack basis preferred
332          2 if primal preferred and crash basis created.
333
334          if gap between bounds <="gap" variables can be flipped
335
336          If "pivot" is
337          0 No pivoting (so will just be choice of algorithm)
338          1 Simple pivoting e.g. gub
339          2 Mini iterations
340     */
341COINLIBAPI int COINLINKAGE Clp_crash(Clp_Simplex *model, double gap, int pivot);
342/*@}*/
343
344/**@name most useful gets and sets */
345/*@{*/
346/** If problem is primal feasible */
347COINLIBAPI int COINLINKAGE Clp_primalFeasible(Clp_Simplex *model);
348/** If problem is dual feasible */
349COINLIBAPI int COINLINKAGE Clp_dualFeasible(Clp_Simplex *model);
350/** Dual bound */
351COINLIBAPI double COINLINKAGE Clp_dualBound(Clp_Simplex *model);
352COINLIBAPI void COINLINKAGE Clp_setDualBound(Clp_Simplex *model, double value);
353/** Infeasibility cost */
354COINLIBAPI double COINLINKAGE Clp_infeasibilityCost(Clp_Simplex *model);
355COINLIBAPI void COINLINKAGE Clp_setInfeasibilityCost(Clp_Simplex *model, double value);
356/** Perturbation:
357         50  - switch on perturbation
358         100 - auto perturb if takes too long (1.0e-6 largest nonzero)
359         101 - we are perturbed
360         102 - don't try perturbing again
361         default is 100
362         others are for playing
363     */
364COINLIBAPI int COINLINKAGE Clp_perturbation(Clp_Simplex *model);
365COINLIBAPI void COINLINKAGE Clp_setPerturbation(Clp_Simplex *model, int value);
366/** Current (or last) algorithm */
367COINLIBAPI int COINLINKAGE Clp_algorithm(Clp_Simplex *model);
368/** Set algorithm */
369COINLIBAPI void COINLINKAGE Clp_setAlgorithm(Clp_Simplex *model, int value);
370/** Sum of dual infeasibilities */
371COINLIBAPI double COINLINKAGE Clp_sumDualInfeasibilities(Clp_Simplex *model);
372/** Number of dual infeasibilities */
373COINLIBAPI int COINLINKAGE Clp_numberDualInfeasibilities(Clp_Simplex *model);
374/** Sum of primal infeasibilities */
375COINLIBAPI double COINLINKAGE Clp_sumPrimalInfeasibilities(Clp_Simplex *model);
376/** Number of primal infeasibilities */
377COINLIBAPI int COINLINKAGE Clp_numberPrimalInfeasibilities(Clp_Simplex *model);
378/** Save model to file, returns 0 if success.  This is designed for
379         use outside algorithms so does not save iterating arrays etc.
380     It does not save any messaging information.
381     Does not save scaling values.
382     It does not know about all types of virtual functions.
383     */
384COINLIBAPI int COINLINKAGE Clp_saveModel(Clp_Simplex *model, const char *fileName);
385/** Restore model from file, returns 0 if success,
386         deletes current model */
387COINLIBAPI int COINLINKAGE Clp_restoreModel(Clp_Simplex *model, const char *fileName);
388
389/** Just check solution (for external use) - sets sum of
390         infeasibilities etc */
391COINLIBAPI void COINLINKAGE Clp_checkSolution(Clp_Simplex *model);
392/*@}*/
393
394/******************** End of most useful part **************/
395/**@name gets and sets - some synonyms */
396/*@{*/
397/** Number of rows */
398COINLIBAPI int COINLINKAGE Clp_getNumRows(Clp_Simplex *model);
399/** Number of columns */
400COINLIBAPI int COINLINKAGE Clp_getNumCols(Clp_Simplex *model);
401/** Number of iterations */
402COINLIBAPI int COINLINKAGE Clp_getIterationCount(Clp_Simplex *model);
403/** Are there a numerical difficulties? */
404COINLIBAPI int COINLINKAGE Clp_isAbandoned(Clp_Simplex *model);
405/** Is optimality proven? */
406COINLIBAPI int COINLINKAGE Clp_isProvenOptimal(Clp_Simplex *model);
407/** Is primal infeasiblity proven? */
408COINLIBAPI int COINLINKAGE Clp_isProvenPrimalInfeasible(Clp_Simplex *model);
409/** Is dual infeasiblity proven? */
410COINLIBAPI int COINLINKAGE Clp_isProvenDualInfeasible(Clp_Simplex *model);
411/** Is the given primal objective limit reached? */
412COINLIBAPI int COINLINKAGE Clp_isPrimalObjectiveLimitReached(Clp_Simplex *model);
413/** Is the given dual objective limit reached? */
414COINLIBAPI int COINLINKAGE Clp_isDualObjectiveLimitReached(Clp_Simplex *model);
415/** Iteration limit reached? */
416COINLIBAPI int COINLINKAGE Clp_isIterationLimitReached(Clp_Simplex *model);
417/** Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore */
418COINLIBAPI double COINLINKAGE Clp_getObjSense(Clp_Simplex *model);
419/** Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore */
420COINLIBAPI void COINLINKAGE Clp_setObjSense(Clp_Simplex *model, double objsen);
421/** Primal row solution */
422COINLIBAPI const double *COINLINKAGE Clp_getRowActivity(Clp_Simplex *model);
423/** Primal column solution */
424COINLIBAPI const double *COINLINKAGE Clp_getColSolution(Clp_Simplex *model);
425COINLIBAPI void COINLINKAGE Clp_setColSolution(Clp_Simplex *model, const double *input);
426/** Dual row solution */
427COINLIBAPI const double *COINLINKAGE Clp_getRowPrice(Clp_Simplex *model);
428/** Reduced costs */
429COINLIBAPI const double *COINLINKAGE Clp_getReducedCost(Clp_Simplex *model);
430/** Row lower */
431COINLIBAPI const double *COINLINKAGE Clp_getRowLower(Clp_Simplex *model);
432/** Row upper  */
433COINLIBAPI const double *COINLINKAGE Clp_getRowUpper(Clp_Simplex *model);
434/** Objective */
435COINLIBAPI const double *COINLINKAGE Clp_getObjCoefficients(Clp_Simplex *model);
436/** Column Lower */
437COINLIBAPI const double *COINLINKAGE Clp_getColLower(Clp_Simplex *model);
438/** Column Upper */
439COINLIBAPI const double *COINLINKAGE Clp_getColUpper(Clp_Simplex *model);
440/** Objective value */
441COINLIBAPI double COINLINKAGE Clp_getObjValue(Clp_Simplex *model);
442/** Print model for debugging purposes */
443COINLIBAPI void COINLINKAGE Clp_printModel(Clp_Simplex *model, const char *prefix);
444/* Small element value - elements less than this set to zero,
445        default is 1.0e-20 */
446COINLIBAPI double COINLINKAGE Clp_getSmallElementValue(Clp_Simplex *model);
447COINLIBAPI void COINLINKAGE Clp_setSmallElementValue(Clp_Simplex *model, double value);
448/*@}*/
449
450/**@name Get and set ClpSolve options
451     */
452/*@{*/
453COINLIBAPI void COINLINKAGE ClpSolve_setSpecialOption(Clp_Solve *, int which, int value, int extraInfo);
454COINLIBAPI int COINLINKAGE ClpSolve_getSpecialOption(Clp_Solve *, int which);
455
456/** method: (see ClpSolve::SolveType)
457         0 - dual simplex
458         1 - primal simplex
459         2 - primal or sprint
460         3 - barrier
461         4 - barrier no crossover
462         5 - automatic
463         6 - not implemented
464       -- pass extraInfo == -1 for default behavior */
465COINLIBAPI void COINLINKAGE ClpSolve_setSolveType(Clp_Solve *, int method, int extraInfo);
466COINLIBAPI int COINLINKAGE ClpSolve_getSolveType(Clp_Solve *);
467
468/** amount: (see ClpSolve::PresolveType)
469         0 - presolve on
470         1 - presolve off
471         2 - presolve number
472         3 - presolve number cost
473       -- pass extraInfo == -1 for default behavior */
474COINLIBAPI void COINLINKAGE ClpSolve_setPresolveType(Clp_Solve *, int amount, int extraInfo);
475COINLIBAPI int COINLINKAGE ClpSolve_getPresolveType(Clp_Solve *);
476
477COINLIBAPI int COINLINKAGE ClpSolve_getPresolvePasses(Clp_Solve *);
478COINLIBAPI int COINLINKAGE ClpSolve_getExtraInfo(Clp_Solve *, int which);
479COINLIBAPI void COINLINKAGE ClpSolve_setInfeasibleReturn(Clp_Solve *, int trueFalse);
480COINLIBAPI int COINLINKAGE ClpSolve_infeasibleReturn(Clp_Solve *);
481
482COINLIBAPI int COINLINKAGE ClpSolve_doDual(Clp_Solve *);
483COINLIBAPI void COINLINKAGE ClpSolve_setDoDual(Clp_Solve *, int doDual);
484
485COINLIBAPI int COINLINKAGE ClpSolve_doSingleton(Clp_Solve *);
486COINLIBAPI void COINLINKAGE ClpSolve_setDoSingleton(Clp_Solve *, int doSingleton);
487
488COINLIBAPI int COINLINKAGE ClpSolve_doDoubleton(Clp_Solve *);
489COINLIBAPI void COINLINKAGE ClpSolve_setDoDoubleton(Clp_Solve *, int doDoubleton);
490
491COINLIBAPI int COINLINKAGE ClpSolve_doTripleton(Clp_Solve *);
492COINLIBAPI void COINLINKAGE ClpSolve_setDoTripleton(Clp_Solve *, int doTripleton);
493
494COINLIBAPI int COINLINKAGE ClpSolve_doTighten(Clp_Solve *);
495COINLIBAPI void COINLINKAGE ClpSolve_setDoTighten(Clp_Solve *, int doTighten);
496
497COINLIBAPI int COINLINKAGE ClpSolve_doForcing(Clp_Solve *);
498COINLIBAPI void COINLINKAGE ClpSolve_setDoForcing(Clp_Solve *, int doForcing);
499
500COINLIBAPI int COINLINKAGE ClpSolve_doImpliedFree(Clp_Solve *);
501COINLIBAPI void COINLINKAGE ClpSolve_setDoImpliedFree(Clp_Solve *, int doImpliedFree);
502
503COINLIBAPI int COINLINKAGE ClpSolve_doDupcol(Clp_Solve *);
504COINLIBAPI void COINLINKAGE ClpSolve_setDoDupcol(Clp_Solve *, int doDupcol);
505
506COINLIBAPI int COINLINKAGE ClpSolve_doDuprow(Clp_Solve *);
507COINLIBAPI void COINLINKAGE ClpSolve_setDoDuprow(Clp_Solve *, int doDuprow);
508
509COINLIBAPI int COINLINKAGE ClpSolve_doSingletonColumn(Clp_Solve *);
510COINLIBAPI void COINLINKAGE ClpSolve_setDoSingletonColumn(Clp_Solve *, int doSingleton);
511
512COINLIBAPI int COINLINKAGE ClpSolve_presolveActions(Clp_Solve *);
513COINLIBAPI void COINLINKAGE ClpSolve_setPresolveActions(Clp_Solve *, int action);
514
515COINLIBAPI int COINLINKAGE ClpSolve_substitution(Clp_Solve *);
516COINLIBAPI void COINLINKAGE ClpSolve_setSubstitution(Clp_Solve *, int value);
517
518/*@}*/
519#ifdef __cplusplus
520}
521#endif
522#endif
523
524/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
525*/
Note: See TracBrowser for help on using the repository browser.