#include <osiif.h>
Inheritance diagram for ABA_OSIIF::
|
This constructor does not initialize the problem data of the linear program. It must be loaded later with the function initialize().
The destructor.
Implements the corresponding pure virtual function of the base class LP and loads the linear program defined by the following arguments to the solver.
This version of the function _sense() changes the sense of the optimization.
Returns the number of nonzero elements in the constraint matrix (not including the right hand side).
Can be called if the last linear program has been solved with the dual simplex method and is infeasible. This function is currently not supported by the interface.
Pivots the slack variables stored in the buffer rows into the basis. This function defines the pure virtual function of the base class LP. This function is currently not supported by the interface.
Extracts the solution, i.e., the value, the status, the values of the variables, slack variables, and dual variables, the reduced costs, and the statuses of the variables and slack variables form the internal solver data structure.
Converts the ABACUS representation of the row sense to the Osi representation.
Converts the OSI representation of the row sense to the ABACUS representation.
Converts the ABACUS variable status to OSI format.
Converts the OSI variable status to ABACUS format.
Converts the ABACUS slack status to OSI format.
Converts the OSI slack status to ABACUS format.
Allocates an Open Solver Interface of type defaultOsiSolver.
Switches between exact and approximate solvers.
Initializes the problem with a dummy row To be used with CPLEX if there are no rows.
An array storing the values of the variables after the linear program has been optimized.
An array storing the values of the reduced costs after the linear program has been optimized.
An array storing the values of the dual variables after the linear program has been optimized.
An array storing the statuses of the variables after the linear program has been optimized.
The number of columns currently used in the LP.
The number of rows currently used in the LP.
An array storing the statuses of the slack variables after the linear program has been optimized.
An array storing the right hand sides of the linear program.
An array storing the row activity of the linear program.
An array storing the row senses of the linear program.
An array storing the column upper bounds of the linear program.
An array storing the column lower bounds of the linear program.
An array storing the objective function coefficients of the linear program.
A warm start object storing information about a basis of the linear program.
The type of the current solver interface.
Definition at line 43 of file osiif.h.
The enumeration of possible solver types
Definition at line 85 of file osiif.h.
This constructor does not initialize the problem data of the linear program. It must be loaded later with the function initialize().
A constructor with initialization.
The destructor.
Definition at line 87 of file osiif.h.
Definition at line 559 of file osiif.h.
Implements the corresponding pure virtual function of the base class LP and loads the linear program defined by the following arguments to the solver.
Implements ABA_LP.
Loads a basis to the solver
Implements ABA_LP.
Returns the sense of the optimization.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
This version of the function _sense() changes the sense of the optimization.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the number of rows of the linear program.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the maximal number of rows of the linear program.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the number of columns of the linear program.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the maximal number of columns of the linear program.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the objective function coefficient of column i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the lower bound of column i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the upper bound of column i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the right hand side of row i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Stores a copy of row i in r.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the number of nonzero elements in the constraint matrix (not including the right hand side).
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Calls the primal simplex method.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Calls the dual simplex method.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Calls the barrier method.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Calls an approximate method.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the optimum value of the linear program.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the value of the column i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the value of the column i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the reduced cost of the column i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the value of the slack column of the row i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the value of the dual column of the row i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the status of the column i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Returns the status of the slack column i.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Can be called if the last linear program has been solved with the dual simplex method and is infeasible. This function is currently not supported by the interface.
In this case it computes the infeasible basic variable or constraint and the corresponding row nInvRow of the basis inverse. Either infeasRow or infeasCol is nonnegative. Then this number refers to an infeasible variable or slack variable, respectively. The function returns 0 if it is successful, 1 otherwise.
Currently this featureis not supported by the Open Solver Interface, therefore a call to this function always returns an error status.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Removes the rows listed in ind.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Adds the rows to the linear program.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Removes the columns listed in vars.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Adds the columns newCols to the linear program.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Sets the right hand side of the linear program to newRhs.
This array must have at least length of the number of rows. This function implements the pure virtual function of the base class LP.
Implements ABA_LP.
Sets the lower bound of column i to newLb.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Sets the upper bound of column i to newLb.
It implements the pure virtual function of the base class LP.
Implements ABA_LP.
Pivots the slack variables stored in the buffer rows into the basis. This function defines the pure virtual function of the base class LP. This function is currently not supported by the interface.
0 All variables could be pivoted in,
1 otherwise.
Implements ABA_LP.
Extracts the solution, i.e., the value, the status, the values of the variables, slack variables, and dual variables, the reduced costs, and the statuses of the variables and slack variables form the internal solver data structure.
Converts the ABACUS representation of the row sense to the Osi representation.
Converts the OSI representation of the row sense to the ABACUS representation.
Converts the ABACUS variable status to OSI format.
Converts the OSI variable status to ABACUS format.
Converts the ABACUS slack status to OSI format.
Converts the OSI slack status to ABACUS format.
Allocates an Open Solver Interface of type defaultOsiSolver.
Switches between exact and approximate solvers.
Initializes the problem with a dummy row To be used with CPLEX if there are no rows.
Reallocates the internal memory such that newSize rows can be stored. This function is obsolete, as memory management is completely handled by Osi.
It implements the corresponding pure virtual function of the base class LP. If a reallocation is performed in the base class LP, we reinitialize the internal data structure. Actually this reinitialization is redundant since it would be performed automatically if addRows() or addCols() fail. However, to be consistent, and if a reallocation is performed to decrease the size of the arrays we call reinitialize().
Implements ABA_LP.
Reallocates the internal memory such that newSize columns can be stored. This function is obsolete, as memory management is completely handled by Osi.
It implements the corresponding pure virtual function of the base class LP.
Implements ABA_LP.
Changes the iteration limit of the Simplex algorithm.
This function defines a pure virtual function of the base class LP.
0 If the iteration limit could be set,
1 otherwise.
Implements ABA_LP.
Defines a pure virtual function of the base class LP.
0 If the iteration limit could be retrieved,
1 otherwise.
Implements ABA_LP.
Definition at line 530 of file osiif.h.
Definition at line 100 of file osiif.h.
Definition at line 454 of file osiif.h.
The value of the optimal solution.
Definition at line 458 of file osiif.h.
An array storing the values of the variables after the linear program has been optimized.
Definition at line 463 of file osiif.h.
Definition at line 464 of file osiif.h.
An array storing the values of the reduced costs after the linear program has been optimized.
Definition at line 469 of file osiif.h.
An array storing the values of the dual variables after the linear program has been optimized.
Definition at line 474 of file osiif.h.
An array storing the statuses of the variables after the linear program has been optimized.
Definition at line 479 of file osiif.h.
The number of columns currently used in the LP.
Definition at line 483 of file osiif.h.
The number of rows currently used in the LP.
Definition at line 487 of file osiif.h.
An array storing the statuses of the slack variables after the linear program has been optimized.
Definition at line 492 of file osiif.h.
An array storing the right hand sides of the linear program.
Definition at line 496 of file osiif.h.
An array storing the row activity of the linear program.
Definition at line 500 of file osiif.h.
An array storing the row senses of the linear program.
Definition at line 504 of file osiif.h.
An array storing the column upper bounds of the linear program.
Definition at line 508 of file osiif.h.
An array storing the column lower bounds of the linear program.
Definition at line 512 of file osiif.h.
An array storing the objective function coefficients of the linear program.
Definition at line 516 of file osiif.h.
A warm start object storing information about a basis of the linear program.
Definition at line 520 of file osiif.h.
The type of the current solver interface.
Definition at line 524 of file osiif.h.
The documentation for this class was generated from the following file: