source: stable/1.15/Clp/src/Clp_C_Interface.h @ 2018

Last change on this file since 2018 was 2018, checked in by stefan, 6 years ago

revert previous commit (r2017): wrong branch

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