Lines Matching defs:with
6 % in compliance with the License. You may obtain a copy of the License
34 to the programmer, so many programs will run with any supported external
44 %Ltd. (www.dashoptimization.com)} solver is now included with the library,
65 solver library may be distributed with {\eclipse} if its licence allows
74 %The library has been ported to work with XPRESS-MP as well as CPLEX.
88 %experiments with multiple solvers.
105 these constraints with respect to an objective function.
108 within one program. The simplest way to write such programs with the
111 {\it solver state} can be associated with each eplex instance, which can be
158 As with all predicates defined for an eplex instance, these constraints
159 should be module-qualified with the name of the eplex instance. In the
160 following they are shown qualified with the {\tt eplex} instance, and with
265 with the eplex instance. Any arithmetic, integrality and bound
369 Retrieve information about the solver state associated with the eplex
379 Retrieve information about solver state associated with the eplex instance.
398 and associate the solver with the eplex instance. No solver must already be
494 are specified in {\tt TriggerModes}, and along with setting up the solver
497 solver, with any
512 This technique allows for repeated re-solving with reduced variable bounds
516 with in. In order for the bounds information not to be lost, some bounds
519 another solver with bounds (e.g. ic)).
531 with a CLP program, is to set up a solver demon which will repeatedly
541 Then a solver with a dummy objective function is set up. The option
625 problem to be `probed' with these changes:
640 with the eplex instance, and any outstanding constraints not yet collected
641 by the solver are removed, with a warning to the user. In effect, the
646 reuse the solver state will not be possible (the execution will abort with
684 implement the predicates provided with eplex instances.
706 associated with that instance. If the eplex instance is {\it not\/} to be
707 associated with an eplex instance, {\tt none} should be given as the
751 Add new constraints (with possibly new variables) to the solver state
795 (unlike with lp_demon_setup/6, Cost gets instantiated to a number).
903 state is associated with an eplex handle, the solver state is disassociated
904 with the eplex instance. However, unlike \bipref{eplex_cleanup/0}{../bips/lib/eplex/eplex_cleanup-0.html}, the
907 As with {\tt eplex_cleanup/0}, care should be taken before using this
943 {\it cutpool} associated with a problem, instead of directly to the
953 \subsection{Solving a Problem with Cutpool Constraints}
962 consistent with the problem, i.e. none of the constraints are
977 \item if the problem is infeasible, then failure occurs as normal (with the
1011 groups, the group name must first be created with the
1019 Add the constraints to the cut-pool associated with the
1042 affects the library predicates that deals with the problem state:
1057 the active cutpool constraints with the problem. This may be different from
1098 state did not have the constraint, then it can become inconsistent with
1137 \section{Dealing with Large and Other Non-standard Numbers}
1161 classifies these into the following cases, with default ways of handling them:
1172 problem is unbounded, so unless the problem was set up with
1193 eplex_solver_setup/4 (lp_setup/4, lp_demon_setup/5, or later with
1200 (Irreducible Infeasible Subsystem) from it with
1249 \item clpcbc: COIN-OR's CLP linear solver in combination with the CBC
1251 with third-party open-source packages, such as University of Florida's
1256 \item symclp: COIN-OR's SYMPHONY MILP solver (with CLP as the linear
1294 %for XPRESS-MP, we distinguish versions included with {\eclipse}: the `OEM'
1305 computers on a network, we have provided you with the possibility
1308 each computer with the appropriate licence to the file
1318 and XPRESS-MP version 15.20 (with the license file located in
1336 For CPLEX with normal licenses, they are unused (the environment
1363 of problems with a quadratic objective is not supported for all solvers.
1365 problems with a linear objective. Currently, all supported solvers can
1366 solve linear and MIP problems, with a Simplex solver.
1375 problems, i.e.\ with the same objective value, but different solution
1383 CPLEX supports solving of linear and mixed integer problems, both with a
1384 linear objective (LP and MILP), and also with a quadratic objective (QP and
1413 \item problems with a quadratic objective function
1419 \item writing out a problem with a maximising objective function in LP or
1429 solving linear and MIP problems with linear objective function, and linear
1430 problems with a quadratic objective function. It also supports time-outs, and is better
1443 with University of Florida's AMD (Approximate Minimum Degree ordering)
1449 problem with a quadratic objective not in positive semi-definite form
1473 XPRESS supports solving of linear and mixed integer problems, both with a
1474 linear objective (LP and MILP), and also with a quadratic objective (QP and
1477 XPRESS does not maintain an optimisation direction with the problem;
1507 associated with the specified eplex instance.
1523 associated with the specified eplex instance.