Scippy

SCIP

Solving Constraint Integer Programs

lpi.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
6 /* Copyright (C) 2002-2021 Konrad-Zuse-Zentrum */
7 /* fuer Informationstechnik Berlin */
8 /* */
9 /* SCIP is distributed under the terms of the ZIB Academic License. */
10 /* */
11 /* You should have received a copy of the ZIB Academic License */
12 /* along with SCIP; see the file COPYING. If not visit scipopt.org. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file lpi.h
17  * @ingroup LPIS
18  * @brief interface methods for specific LP solvers
19  * @author Tobias Achterberg
20  * @author Marc Pfetsch
21  *
22  */
23 
24 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
25 
26 #ifndef __SCIP_LPI_H__
27 #define __SCIP_LPI_H__
28 
29 #include "blockmemshell/memory.h"
30 #include "lpi/type_lpi.h"
31 #include "scip/def.h"
32 #include "scip/type_message.h"
33 #include "scip/type_retcode.h"
34 
35 #ifdef __cplusplus
36 extern "C" {
37 #endif
38 
39 /**@addtogroup LPIS
40  *
41  * This file specifies a generic LP solver interface used by SCIP to create, modify, and solve linear programs of the
42  * form
43  *
44  * min/max obj * x
45  * lhs <= A * x <= rhs
46  * lb <= x <= ub
47  *
48  * and query information about the solution. Although it includes a few SCIP header files, e.g., because it uses SCIP's
49  * return codes, it can be used independently of any SCIP instance.
50  *
51  * The basis status for (column) variables are as follows:
52  * - If x_j = lb, then j is at its lower bound (SCIP_BASESTAT_LOWER).
53  * - If x_j = ub, then j is at its lower bound (SCIP_BASESTAT_UPPER).
54  * - If x_j is in the basis, it has SCIP_BASESTAT_BASIC status.
55  * - If x_j is free and non-basic, it has SCIP_BASESTAT_ZERO status.
56  *
57  * The basis status for (row) slack variables are:
58  * - If (A * x)_i = lhs, then i is at its lower bound (SCIP_BASESTAT_LOWER).
59  * - If (A * x)_i = rhs, then i is at its upper bound (SCIP_BASESTAT_UPPER).
60  * - If the slack variable for row i is basic, it has SCIP_BASESTAT_BASIC status.
61  *
62  * If the solvers use their status differently, those status codes have to be corrected.
63  *
64  * In the methods accessing information about the (inverse of the) basis matrix, the interface assumes the following
65  * column-oriented format: slack variables of rows have coefficient +1 and the basis matrix is a regular m times m
66  * submatrix of (A,I), where m is the number of rows and I is the identity matrix. This means that if, internally, the
67  * LP solver uses coefficients -1 for some of the slack variables, then every row associated with a slack variable whose
68  * coefficient is -1 should be negated in order to return the result in terms of the LP interface definition.
69  *
70  * The creation of a new LP should always be done in the following ways: Either one can use SCIPlpiLoadColLP() or one
71  * first adds empty columns or rows. Then the matrix entries can be added by adding columns and rows, respectively.
72  * Adding matrix entries for a row or column that have not been added before will result in an error.
73  *
74  * The handling of the objective limit is as follows, if supported by the LP-solver: If the objective is larger than the
75  * objective limit for minimization problems or smaller than the objective limit for maximization problems, the solution
76  * process can be stopped. This naturally occurs in a branch-and-bound process, where the objective limit is set to the
77  * value of the best solution found so far. If the problem is a minimization problem and we use the dual simplex, the
78  * dual feasible solutions are maximized. If their value are larger than the objective limit, the process can be
79  * stopped. In this case, no feasible integer solution can be found in the corresponding branch.
80  *
81  * Some LP-solvers also support the opposite setting, but this can easily be checked after the solution process (i.e.,
82  * for a minimization problem a check whether the optimal value is smaller than the limit). Note that this check can
83  * only be determined at the end of the optimization. Thus, we do not support this.
84  *
85  * @{
86  */
87 
88 /*
89  * Miscellaneous Methods
90  */
91 
92 /**@name Miscellaneous Methods */
93 /**@{ */
94 
95 /** gets name and version of LP solver */
97 const char* SCIPlpiGetSolverName(
98  void
99  );
100 
101 /** gets description of LP solver (developer, webpage, ...) */
103 const char* SCIPlpiGetSolverDesc(
104  void
105  );
106 
107 /** gets pointer for LP solver - use only with great care
108  *
109  * The behavior of this function depends on the solver and its use is
110  * therefore only recommended if you really know what you are
111  * doing. In general, it returns a pointer to the LP solver object.
112  */
115  SCIP_LPI* lpi /**< pointer to an LP interface structure */
116  );
117 
118 /** pass integrality information about variables to the solver */
121  SCIP_LPI* lpi, /**< pointer to an LP interface structure */
122  int ncols, /**< length of integrality array */
123  int* intInfo /**< integrality array (0: continuous, 1: integer). May be NULL iff ncols is 0. */
124  );
125 
126 /** informs about availability of a primal simplex solving method */
129  void
130  );
131 
132 /** informs about availability of a dual simplex solving method */
135  void
136  );
137 
138 /** informs about availability of a barrier solving method */
141  void
142  );
143 
144 /**@} */
145 
146 
147 
148 
149 /*
150  * LPI Creation and Destruction Methods
151  */
152 
153 /**@name LPI Creation and Destruction Methods */
154 /**@{ */
155 
156 /** creates an LP problem object */
159  SCIP_LPI** lpi, /**< pointer to an LP interface structure */
160  SCIP_MESSAGEHDLR* messagehdlr, /**< message handler to use for printing messages, or NULL */
161  const char* name, /**< problem name */
162  SCIP_OBJSEN objsen /**< objective sense */
163  );
164 
165 /** deletes an LP problem object */
168  SCIP_LPI** lpi /**< pointer to an LP interface structure */
169  );
170 
171 /**@} */
172 
173 
174 
175 
176 /*
177  * Modification Methods
178  */
179 
180 /**@name Modification Methods */
181 /**@{ */
182 
183 /** copies LP data with column matrix into LP solver */
186  SCIP_LPI* lpi, /**< LP interface structure */
187  SCIP_OBJSEN objsen, /**< objective sense */
188  int ncols, /**< number of columns */
189  const SCIP_Real* obj, /**< objective function values of columns */
190  const SCIP_Real* lb, /**< lower bounds of columns */
191  const SCIP_Real* ub, /**< upper bounds of columns */
192  char** colnames, /**< column names, or NULL */
193  int nrows, /**< number of rows */
194  const SCIP_Real* lhs, /**< left hand sides of rows */
195  const SCIP_Real* rhs, /**< right hand sides of rows */
196  char** rownames, /**< row names, or NULL */
197  int nnonz, /**< number of nonzero elements in the constraint matrix */
198  const int* beg, /**< start index of each column in ind- and val-array */
199  const int* ind, /**< row indices of constraint matrix entries */
200  const SCIP_Real* val /**< values of constraint matrix entries */
201  );
202 
203 /** adds columns to the LP
204  *
205  * @note ind array is not checked for duplicates, problems may appear if indices are added more than once
206  */
209  SCIP_LPI* lpi, /**< LP interface structure */
210  int ncols, /**< number of columns to be added */
211  const SCIP_Real* obj, /**< objective function values of new columns */
212  const SCIP_Real* lb, /**< lower bounds of new columns */
213  const SCIP_Real* ub, /**< upper bounds of new columns */
214  char** colnames, /**< column names, or NULL */
215  int nnonz, /**< number of nonzero elements to be added to the constraint matrix */
216  const int* beg, /**< start index of each column in ind- and val-array, or NULL if nnonz == 0 */
217  const int* ind, /**< row indices of constraint matrix entries, or NULL if nnonz == 0 */
218  const SCIP_Real* val /**< values of constraint matrix entries, or NULL if nnonz == 0 */
219  );
220 
221 /** deletes all columns in the given range from LP */
224  SCIP_LPI* lpi, /**< LP interface structure */
225  int firstcol, /**< first column to be deleted */
226  int lastcol /**< last column to be deleted */
227  );
228 
229 /** deletes columns from SCIP_LPI; the new position of a column must not be greater that its old position */
232  SCIP_LPI* lpi, /**< LP interface structure */
233  int* dstat /**< deletion status of columns
234  * input: 1 if column should be deleted, 0 if not
235  * output: new position of column, -1 if column was deleted */
236  );
237 
238 /** adds rows to the LP
239  *
240  * @note ind array is not checked for duplicates, problems may appear if indices are added more than once
241  */
244  SCIP_LPI* lpi, /**< LP interface structure */
245  int nrows, /**< number of rows to be added */
246  const SCIP_Real* lhs, /**< left hand sides of new rows */
247  const SCIP_Real* rhs, /**< right hand sides of new rows */
248  char** rownames, /**< row names, or NULL */
249  int nnonz, /**< number of nonzero elements to be added to the constraint matrix */
250  const int* beg, /**< start index of each row in ind- and val-array, or NULL if nnonz == 0 */
251  const int* ind, /**< column indices of constraint matrix entries, or NULL if nnonz == 0 */
252  const SCIP_Real* val /**< values of constraint matrix entries, or NULL if nnonz == 0 */
253  );
254 
255 /** deletes all rows in the given range from LP */
258  SCIP_LPI* lpi, /**< LP interface structure */
259  int firstrow, /**< first row to be deleted */
260  int lastrow /**< last row to be deleted */
261  );
262 
263 /** deletes rows from SCIP_LPI; the new position of a row must not be greater that its old position */
266  SCIP_LPI* lpi, /**< LP interface structure */
267  int* dstat /**< deletion status of rows
268  * input: 1 if row should be deleted, 0 if not
269  * output: new position of row, -1 if row was deleted */
270  );
271 
272 /** clears the whole LP */
275  SCIP_LPI* lpi /**< LP interface structure */
276  );
277 
278 /** changes lower and upper bounds of columns */
281  SCIP_LPI* lpi, /**< LP interface structure */
282  int ncols, /**< number of columns to change bounds for */
283  const int* ind, /**< column indices or NULL if ncols is zero */
284  const SCIP_Real* lb, /**< values for the new lower bounds or NULL if ncols is zero */
285  const SCIP_Real* ub /**< values for the new upper bounds or NULL if ncols is zero */
286  );
287 
288 /** changes left and right hand sides of rows */
291  SCIP_LPI* lpi, /**< LP interface structure */
292  int nrows, /**< number of rows to change sides for */
293  const int* ind, /**< row indices */
294  const SCIP_Real* lhs, /**< new values for left hand sides */
295  const SCIP_Real* rhs /**< new values for right hand sides */
296  );
297 
298 /** changes a single coefficient */
301  SCIP_LPI* lpi, /**< LP interface structure */
302  int row, /**< row number of coefficient to change */
303  int col, /**< column number of coefficient to change */
304  SCIP_Real newval /**< new value of coefficient */
305  );
306 
307 /** changes the objective sense */
310  SCIP_LPI* lpi, /**< LP interface structure */
311  SCIP_OBJSEN objsen /**< new objective sense */
312  );
313 
314 /** changes objective values of columns in the LP */
317  SCIP_LPI* lpi, /**< LP interface structure */
318  int ncols, /**< number of columns to change objective value for */
319  const int* ind, /**< column indices to change objective value for */
320  const SCIP_Real* obj /**< new objective values for columns */
321  );
322 
323 /** multiplies a row with a non-zero scalar; for negative scalars, the row's sense is switched accordingly */
326  SCIP_LPI* lpi, /**< LP interface structure */
327  int row, /**< row number to scale */
328  SCIP_Real scaleval /**< scaling multiplier */
329  );
330 
331 /** multiplies a column with a non-zero scalar; the objective value is multiplied with the scalar, and the bounds
332  * are divided by the scalar; for negative scalars, the column's bounds are switched
333  */
336  SCIP_LPI* lpi, /**< LP interface structure */
337  int col, /**< column number to scale */
338  SCIP_Real scaleval /**< scaling multiplier */
339  );
340 
341 /**@} */
342 
343 
344 
345 
346 /*
347  * Data Accessing Methods
348  */
349 
350 /**@name Data Accessing Methods */
351 /**@{ */
352 
353 /** gets the number of rows in the LP */
356  SCIP_LPI* lpi, /**< LP interface structure */
357  int* nrows /**< pointer to store the number of rows */
358  );
359 
360 /** gets the number of columns in the LP */
363  SCIP_LPI* lpi, /**< LP interface structure */
364  int* ncols /**< pointer to store the number of cols */
365  );
366 
367 /** gets the objective sense of the LP */
370  SCIP_LPI* lpi, /**< LP interface structure */
371  SCIP_OBJSEN* objsen /**< pointer to store objective sense */
372  );
373 
374 /** gets the number of nonzero elements in the LP constraint matrix */
377  SCIP_LPI* lpi, /**< LP interface structure */
378  int* nnonz /**< pointer to store the number of nonzeros */
379  );
380 
381 /** gets columns from LP problem object; the arrays have to be large enough to store all values;
382  * Either both, lb and ub, have to be NULL, or both have to be non-NULL,
383  * either nnonz, beg, ind, and val have to be NULL, or all of them have to be non-NULL.
384  */
387  SCIP_LPI* lpi, /**< LP interface structure */
388  int firstcol, /**< first column to get from LP */
389  int lastcol, /**< last column to get from LP */
390  SCIP_Real* lb, /**< buffer to store the lower bound vector, or NULL */
391  SCIP_Real* ub, /**< buffer to store the upper bound vector, or NULL */
392  int* nnonz, /**< pointer to store the number of nonzero elements returned, or NULL */
393  int* beg, /**< buffer to store start index of each column in ind- and val-array, or NULL */
394  int* ind, /**< buffer to store row indices of constraint matrix entries, or NULL */
395  SCIP_Real* val /**< buffer to store values of constraint matrix entries, or NULL */
396  );
397 
398 /** gets rows from LP problem object; the arrays have to be large enough to store all values.
399  * Either both, lhs and rhs, have to be NULL, or both have to be non-NULL,
400  * either nnonz, beg, ind, and val have to be NULL, or all of them have to be non-NULL.
401  */
404  SCIP_LPI* lpi, /**< LP interface structure */
405  int firstrow, /**< first row to get from LP */
406  int lastrow, /**< last row to get from LP */
407  SCIP_Real* lhs, /**< buffer to store left hand side vector, or NULL */
408  SCIP_Real* rhs, /**< buffer to store right hand side vector, or NULL */
409  int* nnonz, /**< pointer to store the number of nonzero elements returned, or NULL */
410  int* beg, /**< buffer to store start index of each row in ind- and val-array, or NULL */
411  int* ind, /**< buffer to store column indices of constraint matrix entries, or NULL */
412  SCIP_Real* val /**< buffer to store values of constraint matrix entries, or NULL */
413  );
414 
415 /** gets column names */
418  SCIP_LPI* lpi, /**< LP interface structure */
419  int firstcol, /**< first column to get name from LP */
420  int lastcol, /**< last column to get name from LP */
421  char** colnames, /**< pointers to column names (of size at least lastcol-firstcol+1) or NULL if namestoragesize is zero */
422  char* namestorage, /**< storage for col names or NULL if namestoragesize is zero */
423  int namestoragesize, /**< size of namestorage (if 0, -storageleft returns the storage needed) */
424  int* storageleft /**< amount of storage left (if < 0 the namestorage was not big enough) or NULL if namestoragesize is zero */
425  );
426 
427 /** gets row names */
430  SCIP_LPI* lpi, /**< LP interface structure */
431  int firstrow, /**< first row to get name from LP */
432  int lastrow, /**< last row to get name from LP */
433  char** rownames, /**< pointers to row names (of size at least lastrow-firstrow+1) or NULL if namestoragesize is zero */
434  char* namestorage, /**< storage for row names or NULL if namestoragesize is zero */
435  int namestoragesize, /**< size of namestorage (if 0, -storageleft returns the storage needed) */
436  int* storageleft /**< amount of storage left (if < 0 the namestorage was not big enough) or NULL if namestoragesize is zero */
437  );
438 
439 /** gets objective coefficients from LP problem object */
442  SCIP_LPI* lpi, /**< LP interface structure */
443  int firstcol, /**< first column to get objective coefficient for */
444  int lastcol, /**< last column to get objective coefficient for */
445  SCIP_Real* vals /**< array to store objective coefficients */
446  );
447 
448 /** gets current bounds from LP problem object */
451  SCIP_LPI* lpi, /**< LP interface structure */
452  int firstcol, /**< first column to get bounds for */
453  int lastcol, /**< last column to get bounds for */
454  SCIP_Real* lbs, /**< array to store lower bound values, or NULL */
455  SCIP_Real* ubs /**< array to store upper bound values, or NULL */
456  );
457 
458 /** gets current row sides from LP problem object */
461  SCIP_LPI* lpi, /**< LP interface structure */
462  int firstrow, /**< first row to get sides for */
463  int lastrow, /**< last row to get sides for */
464  SCIP_Real* lhss, /**< array to store left hand side values, or NULL */
465  SCIP_Real* rhss /**< array to store right hand side values, or NULL */
466  );
467 
468 /** gets a single coefficient */
471  SCIP_LPI* lpi, /**< LP interface structure */
472  int row, /**< row number of coefficient */
473  int col, /**< column number of coefficient */
474  SCIP_Real* val /**< pointer to store the value of the coefficient */
475  );
476 
477 /**@} */
478 
479 
480 
481 
482 /*
483  * Solving Methods
484  */
485 
486 /**@name Solving Methods */
487 /**@{ */
488 
489 /** calls primal simplex to solve the LP */
492  SCIP_LPI* lpi /**< LP interface structure */
493  );
494 
495 /** calls dual simplex to solve the LP */
498  SCIP_LPI* lpi /**< LP interface structure */
499  );
500 
501 /** calls barrier or interior point algorithm to solve the LP with crossover to simplex basis */
504  SCIP_LPI* lpi, /**< LP interface structure */
505  SCIP_Bool crossover /**< perform crossover */
506  );
507 
508 /** start strong branching - call before any strong branching */
511  SCIP_LPI* lpi /**< LP interface structure */
512  );
513 
514 /** end strong branching - call after any strong branching */
517  SCIP_LPI* lpi /**< LP interface structure */
518  );
519 
520 /** performs strong branching iterations on one @b fractional candidate */
523  SCIP_LPI* lpi, /**< LP interface structure */
524  int col, /**< column to apply strong branching on */
525  SCIP_Real psol, /**< fractional current primal solution value of column */
526  int itlim, /**< iteration limit for strong branchings */
527  SCIP_Real* down, /**< stores dual bound after branching column down */
528  SCIP_Real* up, /**< stores dual bound after branching column up */
529  SCIP_Bool* downvalid, /**< stores whether the returned down value is a valid dual bound;
530  * otherwise, it can only be used as an estimate value */
531  SCIP_Bool* upvalid, /**< stores whether the returned up value is a valid dual bound;
532  * otherwise, it can only be used as an estimate value */
533  int* iter /**< stores total number of strong branching iterations, or -1; may be NULL */
534  );
535 
536 /** performs strong branching iterations on given @b fractional candidates */
539  SCIP_LPI* lpi, /**< LP interface structure */
540  int* cols, /**< columns to apply strong branching on */
541  int ncols, /**< number of columns */
542  SCIP_Real* psols, /**< fractional current primal solution values of columns */
543  int itlim, /**< iteration limit for strong branchings */
544  SCIP_Real* down, /**< stores dual bounds after branching columns down */
545  SCIP_Real* up, /**< stores dual bounds after branching columns up */
546  SCIP_Bool* downvalid, /**< stores whether the returned down values are valid dual bounds;
547  * otherwise, they can only be used as an estimate values */
548  SCIP_Bool* upvalid, /**< stores whether the returned up values are a valid dual bounds;
549  * otherwise, they can only be used as an estimate values */
550  int* iter /**< stores total number of strong branching iterations, or -1; may be NULL */
551  );
552 
553 /** performs strong branching iterations on one candidate with @b integral value */
556  SCIP_LPI* lpi, /**< LP interface structure */
557  int col, /**< column to apply strong branching on */
558  SCIP_Real psol, /**< current integral primal solution value of column */
559  int itlim, /**< iteration limit for strong branchings */
560  SCIP_Real* down, /**< stores dual bound after branching column down */
561  SCIP_Real* up, /**< stores dual bound after branching column up */
562  SCIP_Bool* downvalid, /**< stores whether the returned down value is a valid dual bound;
563  * otherwise, it can only be used as an estimate value */
564  SCIP_Bool* upvalid, /**< stores whether the returned up value is a valid dual bound;
565  * otherwise, it can only be used as an estimate value */
566  int* iter /**< stores total number of strong branching iterations, or -1; may be NULL */
567  );
568 
569 /** performs strong branching iterations on given candidates with @b integral values */
572  SCIP_LPI* lpi, /**< LP interface structure */
573  int* cols, /**< columns to apply strong branching on */
574  int ncols, /**< number of columns */
575  SCIP_Real* psols, /**< current integral primal solution values of columns */
576  int itlim, /**< iteration limit for strong branchings */
577  SCIP_Real* down, /**< stores dual bounds after branching columns down */
578  SCIP_Real* up, /**< stores dual bounds after branching columns up */
579  SCIP_Bool* downvalid, /**< stores whether the returned down values are valid dual bounds;
580  * otherwise, they can only be used as an estimate values */
581  SCIP_Bool* upvalid, /**< stores whether the returned up values are a valid dual bounds;
582  * otherwise, they can only be used as an estimate values */
583  int* iter /**< stores total number of strong branching iterations, or -1; may be NULL */
584  );
585 /**@} */
586 
587 
588 
589 
590 /*
591  * Solution Information Methods
592  */
593 
594 /**@name Solution Information Methods */
595 /**@{ */
596 
597 /** returns whether a solve method was called after the last modification of the LP */
600  SCIP_LPI* lpi /**< LP interface structure */
601  );
602 
603 /** gets information about primal and dual feasibility of the current LP solution
604  *
605  * The feasibility information is with respect to the last solving call and it is only relevant if SCIPlpiWasSolved()
606  * returns true. If the LP is changed, this information might be invalidated.
607  *
608  * Note that @p primalfeasible and @p dualfeasible should only return true if the solver has proved the respective LP to
609  * be feasible. Thus, the return values should be equal to the values of SCIPlpiIsPrimalFeasible() and
610  * SCIPlpiIsDualFeasible(), respectively. Note that if feasibility cannot be proved, they should return false (even if
611  * the problem might actually be feasible).
612  */
615  SCIP_LPI* lpi, /**< LP interface structure */
616  SCIP_Bool* primalfeasible, /**< pointer to store primal feasibility status */
617  SCIP_Bool* dualfeasible /**< pointer to store dual feasibility status */
618  );
619 
620 /** returns TRUE iff LP is proven to have a primal unbounded ray (but not necessary a primal feasible point);
621  * this does not necessarily mean, that the solver knows and can return the primal ray
622  */
625  SCIP_LPI* lpi /**< LP interface structure */
626  );
627 
628 /** returns TRUE iff LP is proven to have a primal unbounded ray (but not necessary a primal feasible point),
629  * and the solver knows and can return the primal ray
630  */
633  SCIP_LPI* lpi /**< LP interface structure */
634  );
635 
636 /** returns TRUE iff LP is proven to be primal unbounded */
639  SCIP_LPI* lpi /**< LP interface structure */
640  );
641 
642 /** returns TRUE iff LP is proven to be primal infeasible */
645  SCIP_LPI* lpi /**< LP interface structure */
646  );
647 
648 /** returns TRUE iff LP is proven to be primal feasible */
651  SCIP_LPI* lpi /**< LP interface structure */
652  );
653 
654 /** returns TRUE iff LP is proven to have a dual unbounded ray (but not necessary a dual feasible point);
655  * this does not necessarily mean, that the solver knows and can return the dual ray
656  */
659  SCIP_LPI* lpi /**< LP interface structure */
660  );
661 
662 /** returns TRUE iff LP is proven to have a dual unbounded ray (but not necessary a dual feasible point),
663  * and the solver knows and can return the dual ray
664  */
667  SCIP_LPI* lpi /**< LP interface structure */
668  );
669 
670 /** returns TRUE iff LP is proven to be dual unbounded */
673  SCIP_LPI* lpi /**< LP interface structure */
674  );
675 
676 /** returns TRUE iff LP is proven to be dual infeasible */
679  SCIP_LPI* lpi /**< LP interface structure */
680  );
681 
682 /** returns TRUE iff LP is proven to be dual feasible */
685  SCIP_LPI* lpi /**< LP interface structure */
686  );
687 
688 /** returns TRUE iff LP was solved to optimality */
691  SCIP_LPI* lpi /**< LP interface structure */
692  );
693 
694 /** returns TRUE iff current LP solution is stable
695  *
696  * This function should return true if the solution is reliable, i.e., feasible and optimal (or proven
697  * infeasible/unbounded) with respect to the original problem. The optimality status might be with respect to a scaled
698  * version of the problem, but the solution might not be feasible to the unscaled original problem; in this case,
699  * SCIPlpiIsStable() should return false.
700  */
703  SCIP_LPI* lpi /**< LP interface structure */
704  );
705 
706 /** returns TRUE iff the objective limit was reached */
709  SCIP_LPI* lpi /**< LP interface structure */
710  );
711 
712 /** returns TRUE iff the iteration limit was reached */
715  SCIP_LPI* lpi /**< LP interface structure */
716  );
717 
718 /** returns TRUE iff the time limit was reached */
721  SCIP_LPI* lpi /**< LP interface structure */
722  );
723 
724 /** returns the internal solution status of the solver */
727  SCIP_LPI* lpi /**< LP interface structure */
728  );
729 
730 /** tries to reset the internal status of the LP solver in order to ignore an instability of the last solving call */
733  SCIP_LPI* lpi, /**< LP interface structure */
734  SCIP_Bool* success /**< pointer to store, whether the instability could be ignored */
735  );
736 
737 /** gets objective value of solution */
740  SCIP_LPI* lpi, /**< LP interface structure */
741  SCIP_Real* objval /**< stores the objective value */
742  );
743 
744 /** gets primal and dual solution vectors for feasible LPs
745  *
746  * Before calling this function, the caller must ensure that the LP has been solved to optimality, i.e., that
747  * SCIPlpiIsOptimal() returns true.
748  */
751  SCIP_LPI* lpi, /**< LP interface structure */
752  SCIP_Real* objval, /**< stores the objective value, may be NULL if not needed */
753  SCIP_Real* primsol, /**< primal solution vector, may be NULL if not needed */
754  SCIP_Real* dualsol, /**< dual solution vector, may be NULL if not needed */
755  SCIP_Real* activity, /**< row activity vector, may be NULL if not needed */
756  SCIP_Real* redcost /**< reduced cost vector, may be NULL if not needed */
757  );
758 
759 /** gets primal ray for unbounded LPs */
762  SCIP_LPI* lpi, /**< LP interface structure */
763  SCIP_Real* ray /**< primal ray */
764  );
765 
766 /** gets dual Farkas proof for infeasibility */
769  SCIP_LPI* lpi, /**< LP interface structure */
770  SCIP_Real* dualfarkas /**< dual Farkas row multipliers */
771  );
772 
773 /** gets the number of LP iterations of the last solve call */
776  SCIP_LPI* lpi, /**< LP interface structure */
777  int* iterations /**< pointer to store the number of iterations of the last solve call */
778  );
779 
780 /** gets information about the quality of an LP solution
781  *
782  * Such information is usually only available, if also a (maybe not optimal) solution is available.
783  * The LPI should return SCIP_INVALID for @p quality, if the requested quantity is not available.
784  */
787  SCIP_LPI* lpi, /**< LP interface structure */
788  SCIP_LPSOLQUALITY qualityindicator, /**< indicates which quality should be returned */
789  SCIP_Real* quality /**< pointer to store quality number */
790  );
791 
792 /**@} */
793 
794 
795 
796 
797 /*
798  * LP Basis Methods
799  */
800 
801 /**@name LP Basis Methods */
802 /**@{ */
803 
804 /** gets current basis status for columns and rows; arrays must be large enough to store the basis status */
807  SCIP_LPI* lpi, /**< LP interface structure */
808  int* cstat, /**< array to store column basis status, or NULL */
809  int* rstat /**< array to store row basis status, or NULL */
810  );
811 
812 /** sets current basis status for columns and rows */
815  SCIP_LPI* lpi, /**< LP interface structure */
816  const int* cstat, /**< array with column basis status */
817  const int* rstat /**< array with row basis status */
818  );
819 
820 /** returns the indices of the basic columns and rows; basic column n gives value n, basic row m gives value -1-m */
823  SCIP_LPI* lpi, /**< LP interface structure */
824  int* bind /**< pointer to store basis indices ready to keep number of rows entries */
825  );
826 
827 /** get row of inverse basis matrix B^-1
828  *
829  * @note The LP interface defines slack variables to have coefficient +1. This means that if, internally, the LP solver
830  * uses a -1 coefficient, then rows associated with slacks variables whose coefficient is -1, should be negated;
831  * see also the explanation in lpi.h.
832  */
835  SCIP_LPI* lpi, /**< LP interface structure */
836  int r, /**< row number */
837  SCIP_Real* coef, /**< pointer to store the coefficients of the row */
838  int* inds, /**< array to store the non-zero indices, or NULL */
839  int* ninds /**< pointer to store the number of non-zero indices, or NULL
840  * (-1: if we do not store sparsity information) */
841  );
842 
843 /** get column of inverse basis matrix B^-1
844  *
845  * @note The LP interface defines slack variables to have coefficient +1. This means that if, internally, the LP solver
846  * uses a -1 coefficient, then rows associated with slacks variables whose coefficient is -1, should be negated;
847  * see also the explanation in lpi.h.
848  */
851  SCIP_LPI* lpi, /**< LP interface structure */
852  int c, /**< column number of B^-1; this is NOT the number of the column in the LP;
853  * you have to call SCIPlpiGetBasisInd() to get the array which links the
854  * B^-1 column numbers to the row and column numbers of the LP!
855  * c must be between 0 and nrows-1, since the basis has the size
856  * nrows * nrows */
857  SCIP_Real* coef, /**< pointer to store the coefficients of the column */
858  int* inds, /**< array to store the non-zero indices, or NULL */
859  int* ninds /**< pointer to store the number of non-zero indices, or NULL
860  * (-1: if we do not store sparsity information) */
861  );
862 
863 /** get row of inverse basis matrix times constraint matrix B^-1 * A
864  *
865  * @note The LP interface defines slack variables to have coefficient +1. This means that if, internally, the LP solver
866  * uses a -1 coefficient, then rows associated with slacks variables whose coefficient is -1, should be negated;
867  * see also the explanation in lpi.h.
868  */
871  SCIP_LPI* lpi, /**< LP interface structure */
872  int r, /**< row number */
873  const SCIP_Real* binvrow, /**< row in (A_B)^-1 from prior call to SCIPlpiGetBInvRow(), or NULL */
874  SCIP_Real* coef, /**< vector to return coefficients of the row */
875  int* inds, /**< array to store the non-zero indices, or NULL */
876  int* ninds /**< pointer to store the number of non-zero indices, or NULL
877  * (-1: if we do not store sparsity information) */
878  );
879 
880 /** get column of inverse basis matrix times constraint matrix B^-1 * A
881  *
882  * @note The LP interface defines slack variables to have coefficient +1. This means that if, internally, the LP solver
883  * uses a -1 coefficient, then rows associated with slacks variables whose coefficient is -1, should be negated;
884  * see also the explanation in lpi.h.
885  */
888  SCIP_LPI* lpi, /**< LP interface structure */
889  int c, /**< column number */
890  SCIP_Real* coef, /**< vector to return coefficients of the column */
891  int* inds, /**< array to store the non-zero indices, or NULL */
892  int* ninds /**< pointer to store the number of non-zero indices, or NULL
893  * (-1: if we do not store sparsity information) */
894  );
895 
896 /**@} */
897 
898 
899 
900 
901 /*
902  * LPi State Methods
903  */
904 
905 /**@name LPi State Methods */
906 /**@{ */
907 
908 /** stores LPi state (like basis information) into lpistate object */
911  SCIP_LPI* lpi, /**< LP interface structure */
912  BMS_BLKMEM* blkmem, /**< block memory */
913  SCIP_LPISTATE** lpistate /**< pointer to LPi state information (like basis information) */
914  );
915 
916 /** loads LPi state (like basis information) into solver; note that the LP might have been extended with additional
917  * columns and rows since the state was stored with SCIPlpiGetState()
918  */
921  SCIP_LPI* lpi, /**< LP interface structure */
922  BMS_BLKMEM* blkmem, /**< block memory */
923  const SCIP_LPISTATE* lpistate /**< LPi state information (like basis information), or NULL */
924  );
925 
926 /** clears current LPi state (like basis information) of the solver */
929  SCIP_LPI* lpi /**< LP interface structure */
930  );
931 
932 /** frees LPi state information */
935  SCIP_LPI* lpi, /**< LP interface structure */
936  BMS_BLKMEM* blkmem, /**< block memory */
937  SCIP_LPISTATE** lpistate /**< pointer to LPi state information (like basis information) */
938  );
939 
940 /** checks, whether the given LPi state contains simplex basis information */
943  SCIP_LPI* lpi, /**< LP interface structure */
944  SCIP_LPISTATE* lpistate /**< LPi state information (like basis information) */
945  );
946 
947 /** reads LPi state (like basis information from a file */
950  SCIP_LPI* lpi, /**< LP interface structure */
951  const char* fname /**< file name */
952  );
953 
954 /** writes LPi state (i.e. basis information) to a file */
957  SCIP_LPI* lpi, /**< LP interface structure */
958  const char* fname /**< file name */
959  );
960 
961 /**@} */
962 
963 
964 /*
965  * LPi Pricing Norms Methods
966  */
967 
968 /**@name LPi Pricing Norms Methods */
969 /**@{ */
970 
971 /** stores LPi pricing norms into lpinorms object */
973  SCIP_LPI* lpi, /**< LP interface structure */
974  BMS_BLKMEM* blkmem, /**< block memory */
975  SCIP_LPINORMS** lpinorms /**< pointer to LPi pricing norms information */
976  );
977 
978 /** loads LPi pricing norms into solver; note that the LP might have been extended with additional
979  * columns and rows since the norms were stored with SCIPlpiGetNorms()
980  */
982  SCIP_LPI* lpi, /**< LP interface structure */
983  BMS_BLKMEM* blkmem, /**< block memory */
984  const SCIP_LPINORMS* lpinorms /**< LPi pricing norms information, or NULL */
985  );
986 
987 /** frees LPi pricing norms information */
989  SCIP_LPI* lpi, /**< LP interface structure */
990  BMS_BLKMEM* blkmem, /**< block memory */
991  SCIP_LPINORMS** lpinorms /**< pointer to LPi pricing norms information, or NULL */
992  );
993 
994 
995 /**@} */
996 
997 
998 
999 
1000 /*
1001  * Parameter Methods
1002  */
1003 
1004 /**@name Parameter Methods */
1005 /**@{ */
1006 
1007 /** gets integer parameter of LP */
1010  SCIP_LPI* lpi, /**< LP interface structure */
1011  SCIP_LPPARAM type, /**< parameter number */
1012  int* ival /**< buffer to store the parameter value */
1013  );
1014 
1015 /** sets integer parameter of LP */
1018  SCIP_LPI* lpi, /**< LP interface structure */
1019  SCIP_LPPARAM type, /**< parameter number */
1020  int ival /**< parameter value */
1021  );
1022 
1023 /** gets floating point parameter of LP */
1026  SCIP_LPI* lpi, /**< LP interface structure */
1027  SCIP_LPPARAM type, /**< parameter number */
1028  SCIP_Real* dval /**< buffer to store the parameter value */
1029  );
1030 
1031 /** sets floating point parameter of LP */
1034  SCIP_LPI* lpi, /**< LP interface structure */
1035  SCIP_LPPARAM type, /**< parameter number */
1036  SCIP_Real dval /**< parameter value */
1037  );
1038 
1039 /**@} */
1040 
1041 
1042 
1043 
1044 /*
1045  * Numerical Methods
1046  */
1047 
1048 /**@name Numerical Methods */
1049 /**@{ */
1050 
1051 /** returns value treated as infinity in the LP solver */
1054  SCIP_LPI* lpi /**< LP interface structure */
1055  );
1056 
1057 /** checks if given value is treated as infinity in the LP solver */
1060  SCIP_LPI* lpi, /**< LP interface structure */
1061  SCIP_Real val /**< value to be checked for infinity */
1062  );
1063 
1064 /**@} */
1065 
1066 
1067 
1068 
1069 /*
1070  * File Interface Methods
1071  */
1072 
1073 /**@name File Interface Methods */
1074 /**@{ */
1075 
1076 /** reads LP from a file */
1079  SCIP_LPI* lpi, /**< LP interface structure */
1080  const char* fname /**< file name */
1081  );
1082 
1083 /** writes LP to a file */
1086  SCIP_LPI* lpi, /**< LP interface structure */
1087  const char* fname /**< file name */
1088  );
1089 
1090 /**@} */
1091 
1092 /**@} */
1093 
1094 
1095 #ifdef __cplusplus
1096 }
1097 #endif
1098 
1099 #endif
SCIP_EXPORT SCIP_RETCODE SCIPlpiCreate(SCIP_LPI **lpi, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_OBJSEN objsen)
Definition: lpi_clp.cpp:522
SCIP_EXPORT SCIP_RETCODE SCIPlpiSetIntpar(SCIP_LPI *lpi, SCIP_LPPARAM type, int ival)
Definition: lpi_clp.cpp:3678
SCIP_EXPORT SCIP_RETCODE SCIPlpiStrongbranchesFrac(SCIP_LPI *lpi, int *cols, int ncols, SCIP_Real *psols, int itlim, SCIP_Real *down, SCIP_Real *up, SCIP_Bool *downvalid, SCIP_Bool *upvalid, int *iter)
Definition: lpi_clp.cpp:2290
enum SCIP_LPSolQuality SCIP_LPSOLQUALITY
Definition: type_lpi.h:95
SCIP_EXPORT SCIP_Real SCIPlpiInfinity(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:3893
SCIP_EXPORT const char * SCIPlpiGetSolverName(void)
Definition: lpi_clp.cpp:445
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetIntpar(SCIP_LPI *lpi, SCIP_LPPARAM type, int *ival)
Definition: lpi_clp.cpp:3634
SCIP_RETCODE SCIPlpiSetNorms(SCIP_LPI *lpi, BMS_BLKMEM *blkmem, const SCIP_LPINORMS *lpinorms)
Definition: lpi_clp.cpp:3596
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetDualfarkas(SCIP_LPI *lpi, SCIP_Real *dualfarkas)
Definition: lpi_clp.cpp:2843
SCIP_EXPORT SCIP_RETCODE SCIPlpiChgCoef(SCIP_LPI *lpi, int row, int col, SCIP_Real newval)
Definition: lpi_clp.cpp:1188
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetBase(SCIP_LPI *lpi, int *cstat, int *rstat)
Definition: lpi_clp.cpp:2953
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetObj(SCIP_LPI *lpi, int firstcol, int lastcol, SCIP_Real *vals)
Definition: lpi_clp.cpp:1677
enum SCIP_ObjSen SCIP_OBJSEN
Definition: type_lpi.h:36
SCIP_EXPORT void * SCIPlpiGetSolverPointer(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:462
SCIP_EXPORT SCIP_Bool SCIPlpiHasStateBasis(SCIP_LPI *lpi, SCIP_LPISTATE *lpistate)
Definition: lpi_clp.cpp:3508
SCIP_EXPORT SCIP_Bool SCIPlpiHasPrimalRay(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2454
#define SCIP_EXPORT
Definition: def.h:100
SCIP_EXPORT SCIP_RETCODE SCIPlpiSolveBarrier(SCIP_LPI *lpi, SCIP_Bool crossover)
Definition: lpi_clp.cpp:1948
SCIP_EXPORT SCIP_RETCODE SCIPlpiAddRows(SCIP_LPI *lpi, int nrows, const SCIP_Real *lhs, const SCIP_Real *rhs, char **rownames, int nnonz, const int *beg, const int *ind, const SCIP_Real *val)
Definition: lpi_clp.cpp:905
SCIP_EXPORT SCIP_Bool SCIPlpiIsInfinity(SCIP_LPI *lpi, SCIP_Real val)
Definition: lpi_clp.cpp:3905
SCIP_EXPORT SCIP_Bool SCIPlpiHasPrimalSolve(void)
Definition: lpi_clp.cpp:485
SCIP_EXPORT SCIP_Bool SCIPlpiIsPrimalInfeasible(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2488
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:54
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetBInvACol(SCIP_LPI *lpi, int c, SCIP_Real *coef, int *inds, int *ninds)
Definition: lpi_clp.cpp:3335
SCIP_EXPORT SCIP_RETCODE SCIPlpiStartStrongbranch(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:1992
SCIP_RETCODE SCIPlpiGetNorms(SCIP_LPI *lpi, BMS_BLKMEM *blkmem, SCIP_LPINORMS **lpinorms)
Definition: lpi_clp.cpp:3578
enum SCIP_LPParam SCIP_LPPARAM
Definition: type_lpi.h:64
SCIP_EXPORT SCIP_Bool SCIPlpiIsObjlimExc(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2676
SCIP_EXPORT SCIP_RETCODE SCIPlpiDelRows(SCIP_LPI *lpi, int firstrow, int lastrow)
Definition: lpi_clp.cpp:977
type definitions for return codes for SCIP methods
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetCoef(SCIP_LPI *lpi, int row, int col, SCIP_Real *val)
Definition: lpi_clp.cpp:1762
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetBInvCol(SCIP_LPI *lpi, int c, SCIP_Real *coef, int *inds, int *ninds)
Definition: lpi_clp.cpp:3262
SCIP_EXPORT SCIP_Bool SCIPlpiIsIterlimExc(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2706
SCIP_EXPORT SCIP_RETCODE SCIPlpiLoadColLP(SCIP_LPI *lpi, SCIP_OBJSEN objsen, int ncols, const SCIP_Real *obj, const SCIP_Real *lb, const SCIP_Real *ub, char **colnames, int nrows, const SCIP_Real *lhs, const SCIP_Real *rhs, char **rownames, int nnonz, const int *beg, const int *ind, const SCIP_Real *val)
Definition: lpi_clp.cpp:668
SCIP_EXPORT SCIP_Bool SCIPlpiIsDualUnbounded(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2564
SCIP_EXPORT SCIP_RETCODE SCIPlpiScaleCol(SCIP_LPI *lpi, int col, SCIP_Real scaleval)
Definition: lpi_clp.cpp:1331
SCIP_EXPORT SCIP_RETCODE SCIPlpiReadState(SCIP_LPI *lpi, const char *fname)
Definition: lpi_clp.cpp:3518
SCIP_EXPORT SCIP_RETCODE SCIPlpiStrongbranchFrac(SCIP_LPI *lpi, int col, SCIP_Real psol, int itlim, SCIP_Real *down, SCIP_Real *up, SCIP_Bool *downvalid, SCIP_Bool *upvalid, int *iter)
Definition: lpi_clp.cpp:2269
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetNRows(SCIP_LPI *lpi, int *nrows)
Definition: lpi_clp.cpp:1408
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetSolFeasibility(SCIP_LPI *lpi, SCIP_Bool *primalfeasible, SCIP_Bool *dualfeasible)
Definition: lpi_clp.cpp:2391
SCIP_EXPORT SCIP_RETCODE SCIPlpiEndStrongbranch(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2004
SCIP_EXPORT SCIP_Bool SCIPlpiIsTimelimExc(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2722
SCIP_EXPORT SCIP_RETCODE SCIPlpiSetBase(SCIP_LPI *lpi, const int *cstat, const int *rstat)
Definition: lpi_clp.cpp:3053
SCIP_EXPORT SCIP_RETCODE SCIPlpiWriteLP(SCIP_LPI *lpi, const char *fname)
Definition: lpi_clp.cpp:3975
SCIP_EXPORT SCIP_RETCODE SCIPlpiDelColset(SCIP_LPI *lpi, int *dstat)
Definition: lpi_clp.cpp:859
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetRowNames(SCIP_LPI *lpi, int firstrow, int lastrow, char **rownames, char *namestorage, int namestoragesize, int *storageleft)
Definition: lpi_clp.cpp:1614
SCIP_EXPORT SCIP_RETCODE SCIPlpiSetIntegralityInformation(SCIP_LPI *lpi, int ncols, int *intInfo)
Definition: lpi_clp.cpp:471
SCIP_EXPORT SCIP_Bool SCIPlpiExistsDualRay(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2523
SCIP_EXPORT SCIP_RETCODE SCIPlpiChgObjsen(SCIP_LPI *lpi, SCIP_OBJSEN objsen)
Definition: lpi_clp.cpp:1211
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetObjval(SCIP_LPI *lpi, SCIP_Real *objval)
Definition: lpi_clp.cpp:2752
SCIP_EXPORT SCIP_Bool SCIPlpiHasDualSolve(void)
Definition: lpi_clp.cpp:493
SCIP_EXPORT SCIP_RETCODE SCIPlpiIgnoreInstability(SCIP_LPI *lpi, SCIP_Bool *success)
Definition: lpi_clp.cpp:1638
type definitions for specific LP solvers interface
SCIP_EXPORT SCIP_RETCODE SCIPlpiDelCols(SCIP_LPI *lpi, int firstcol, int lastcol)
Definition: lpi_clp.cpp:828
SCIP_EXPORT SCIP_RETCODE SCIPlpiClearState(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:3473
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetSides(SCIP_LPI *lpi, int firstrow, int lastrow, SCIP_Real *lhss, SCIP_Real *rhss)
Definition: lpi_clp.cpp:1731
SCIP_EXPORT SCIP_RETCODE SCIPlpiChgSides(SCIP_LPI *lpi, int nrows, const int *ind, const SCIP_Real *lhs, const SCIP_Real *rhs)
Definition: lpi_clp.cpp:1158
SCIP_EXPORT SCIP_RETCODE SCIPlpiStrongbranchesInt(SCIP_LPI *lpi, int *cols, int ncols, SCIP_Real *psols, int itlim, SCIP_Real *down, SCIP_Real *up, SCIP_Bool *downvalid, SCIP_Bool *upvalid, int *iter)
Definition: lpi_clp.cpp:2336
SCIP_EXPORT SCIP_RETCODE SCIPlpiAddCols(SCIP_LPI *lpi, int ncols, const SCIP_Real *obj, const SCIP_Real *lb, const SCIP_Real *ub, char **colnames, int nnonz, const int *beg, const int *ind, const SCIP_Real *val)
Definition: lpi_clp.cpp:749
SCIP_RETCODE SCIPlpiFreeNorms(SCIP_LPI *lpi, BMS_BLKMEM *blkmem, SCIP_LPINORMS **lpinorms)
Definition: lpi_clp.cpp:3609
SCIP_EXPORT SCIP_Bool SCIPlpiIsDualFeasible(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2595
SCIP_EXPORT SCIP_RETCODE SCIPlpiChgBounds(SCIP_LPI *lpi, int ncols, const int *ind, const SCIP_Real *lb, const SCIP_Real *ub)
Definition: lpi_clp.cpp:1075
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetBInvARow(SCIP_LPI *lpi, int r, const SCIP_Real *binvrow, SCIP_Real *coef, int *inds, int *ninds)
Definition: lpi_clp.cpp:3300
SCIP_EXPORT SCIP_RETCODE SCIPlpiScaleRow(SCIP_LPI *lpi, int row, SCIP_Real scaleval)
Definition: lpi_clp.cpp:1258
#define SCIP_Bool
Definition: def.h:70
SCIP_EXPORT SCIP_RETCODE SCIPlpiSolvePrimal(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:1796
SCIP_EXPORT const char * SCIPlpiGetSolverDesc(void)
Definition: lpi_clp.cpp:454
SCIP_EXPORT SCIP_RETCODE SCIPlpiSetRealpar(SCIP_LPI *lpi, SCIP_LPPARAM type, SCIP_Real dval)
Definition: lpi_clp.cpp:3819
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetNCols(SCIP_LPI *lpi, int *ncols)
Definition: lpi_clp.cpp:1426
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetBounds(SCIP_LPI *lpi, int firstcol, int lastcol, SCIP_Real *lbs, SCIP_Real *ubs)
Definition: lpi_clp.cpp:1700
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetCols(SCIP_LPI *lpi, int firstcol, int lastcol, SCIP_Real *lb, SCIP_Real *ub, int *nnonz, int *beg, int *ind, SCIP_Real *val)
Definition: lpi_clp.cpp:1465
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetRows(SCIP_LPI *lpi, int firstrow, int lastrow, SCIP_Real *lhs, SCIP_Real *rhs, int *nnonz, int *beg, int *ind, SCIP_Real *val)
Definition: lpi_clp.cpp:1529
SCIP_EXPORT SCIP_RETCODE SCIPlpiChgObj(SCIP_LPI *lpi, int ncols, const int *ind, const SCIP_Real *obj)
Definition: lpi_clp.cpp:1231
SCIP_EXPORT SCIP_Bool SCIPlpiIsStable(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2633
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetBasisInd(SCIP_LPI *lpi, int *bind)
Definition: lpi_clp.cpp:3175
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetColNames(SCIP_LPI *lpi, int firstcol, int lastcol, char **colnames, char *namestorage, int namestoragesize, int *storageleft)
Definition: lpi_clp.cpp:1590
SCIP_EXPORT int SCIPlpiGetInternalStatus(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2738
SCIP_Real * r
Definition: circlepacking.c:50
SCIP_EXPORT SCIP_Bool SCIPlpiHasDualRay(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2542
SCIP_EXPORT SCIP_Bool SCIPlpiIsPrimalUnbounded(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2474
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetSol(SCIP_LPI *lpi, SCIP_Real *objval, SCIP_Real *primsol, SCIP_Real *dualsol, SCIP_Real *activity, SCIP_Real *redcost)
Definition: lpi_clp.cpp:2774
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetState(SCIP_LPI *lpi, BMS_BLKMEM *blkmem, SCIP_LPISTATE **lpistate)
Definition: lpi_clp.cpp:3375
SCIP_EXPORT SCIP_Bool SCIPlpiIsPrimalFeasible(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2507
SCIP_EXPORT SCIP_Bool SCIPlpiIsOptimal(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2609
SCIP_EXPORT SCIP_RETCODE SCIPlpiFree(SCIP_LPI **lpi)
Definition: lpi_clp.cpp:634
SCIP_EXPORT SCIP_RETCODE SCIPlpiSetState(SCIP_LPI *lpi, BMS_BLKMEM *blkmem, const SCIP_LPISTATE *lpistate)
Definition: lpi_clp.cpp:3415
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetNNonz(SCIP_LPI *lpi, int *nnonz)
Definition: lpi_clp.cpp:1444
#define SCIP_Real
Definition: def.h:163
SCIP_EXPORT SCIP_Bool SCIPlpiWasSolved(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2372
SCIP_EXPORT SCIP_RETCODE SCIPlpiClear(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:1055
SCIP_EXPORT SCIP_RETCODE SCIPlpiStrongbranchInt(SCIP_LPI *lpi, int col, SCIP_Real psol, int itlim, SCIP_Real *down, SCIP_Real *up, SCIP_Bool *downvalid, SCIP_Bool *upvalid, int *iter)
Definition: lpi_clp.cpp:2315
SCIP_EXPORT SCIP_Bool SCIPlpiExistsPrimalRay(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2436
type definitions for message output methods
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetBInvRow(SCIP_LPI *lpi, int r, SCIP_Real *coef, int *inds, int *ninds)
Definition: lpi_clp.cpp:3227
SCIP_EXPORT SCIP_RETCODE SCIPlpiSolveDual(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:1871
SCIP_EXPORT SCIP_RETCODE SCIPlpiFreeState(SCIP_LPI *lpi, BMS_BLKMEM *blkmem, SCIP_LPISTATE **lpistate)
Definition: lpi_clp.cpp:3489
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetIterations(SCIP_LPI *lpi, int *iterations)
Definition: lpi_clp.cpp:2907
SCIP_EXPORT SCIP_Bool SCIPlpiIsDualInfeasible(SCIP_LPI *lpi)
Definition: lpi_clp.cpp:2581
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetRealpar(SCIP_LPI *lpi, SCIP_LPPARAM type, SCIP_Real *dval)
Definition: lpi_clp.cpp:3782
common defines and data types used in all packages of SCIP
struct BMS_BlkMem BMS_BLKMEM
Definition: memory.h:429
SCIP_EXPORT SCIP_RETCODE SCIPlpiDelRowset(SCIP_LPI *lpi, int *dstat)
Definition: lpi_clp.cpp:1009
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetPrimalRay(SCIP_LPI *lpi, SCIP_Real *ray)
Definition: lpi_clp.cpp:2818
SCIP_EXPORT SCIP_RETCODE SCIPlpiReadLP(SCIP_LPI *lpi, const char *fname)
Definition: lpi_clp.cpp:3946
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetRealSolQuality(SCIP_LPI *lpi, SCIP_LPSOLQUALITY qualityindicator, SCIP_Real *quality)
Definition: lpi_clp.cpp:2926
SCIP_EXPORT SCIP_RETCODE SCIPlpiWriteState(SCIP_LPI *lpi, const char *fname)
Definition: lpi_clp.cpp:3538
SCIP_EXPORT SCIP_Bool SCIPlpiHasBarrierSolve(void)
Definition: lpi_clp.cpp:501
SCIP_EXPORT SCIP_RETCODE SCIPlpiGetObjsen(SCIP_LPI *lpi, SCIP_OBJSEN *objsen)
Definition: lpi_clp.cpp:1657
memory allocation routines