-
Many solvers present an option to compute an IIS in case of infeasibility (Gurobi, CPLEX, BARON at least, probably others that I don't know of). However, accessing this functionality from JuMP is a bi…
-
**Describe the bug**
Querying optimization results shows the wrong answer.
**To Reproduce**
the lp file:
```lp
\Problem name:
Minimize
OBJROW: - var(22)
Subject To
constr(0): var(…
-
Define `SemiBridge` for transforming a `Semicontinuous` (resp. `Semiinteger`) variable `z` to a free (resp. `Integer`) variable `y` with the constraints `set.lower * z
-
Hi, I am new to linear programming (LP), but I started to look into the R package `Benchmarking`, which uses `lpSolveAPI` for LP, and I thought it could be nice to refactor some of the code there for …
-
Sorry if this is the wrong place for this.
MWE with a constraint that 10 binary variables shall add up to 11:
```julia
julia> using JuMP, Cbc
julia> mmm = Model(with_optimizer(Cbc.Optimizer)…
-
I am currently creating a model in pyomo and using cplex as a solver(persistant cplex) to be specific which uses the python API.
I tried running this on my local windows machine and after installin…
-
hello,
I read that the MIPCL solver is the fastest free MILP solver and that it can handle MPS files.
Is there any interest to add the MIPCL solver to pulp ?
and if so, how complex would that be …
-
Is there a reason ObjectiveBound is currently only tested in one MIP test ?
Even for an LP with termination status Success and primal and dual status FeasiblePoint, ObjectiveBound should be accessibl…
-
In the clustering function in utils.py:
I noticed that a transformation of start-up cost into ramping cost is applied only when:
method == 'LP clustered' (method== 'LP' is not included). Should we i…
-
C++17 supports parallel execution policies in algorithms like `std::for_each` using an execution policy `std::execution::par`
See
https://en.cppreference.com/w/cpp/algorithm/for_each
https://en.c…