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

Last change on this file since 2441 was 2441, checked in by stefan, 8 months ago

add Clp_writeMps, Clp_setRowName, Clp_setColumnName from patch provided by @framlingham in #101

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