-
Details for the issue
--------------------
## What did you do?
Solved a toy infeasible problem using the `pulp.GUROBI_CMD` solver:
```python
import pulp
prob = pulp.LpProblem()
x = pulp.L…
-
```
MILP discrete problem is now infeasible. GDPopt has explored or cut off all feasible discrete configurations.
GDPopt exiting--problem is infeasible.
Solved in 9 iterations and 4.77268 seconds…
-
The problem is that I want to be able to use the NEOS offline service sometimes. Currently I export the problem to .mps via:
prob.solve(verbose=False,solver="XPRESS",write_mps='hpw15.mps')
However, …
-
## Checklist
- [ ] I am using the current [`master`](https://github.com/pypsa/pypsa/tree/master) branch or the latest
## Describe the Bug
I think there might me an error when post-process…
-
#34251 adds `cvxpy` and a MIP backend.
Here we add:
- a new SDP backend.
See also:
- #26511 Meta-ticket: Use Python optimization interfaces: PuLP, Pyomo, cylp...
- #33487 package cylp - n…
-
Good day!
I'm interested on integrating choco with python's [PuLP library](https://github.com/coin-or/pulp) to test it with the models that I've modeled so far.
This library (PuLP) lets the user b…
-
Assign: dirk
-
Following up from my boolean modelling issue, one of the nicest features of Gurobi, CPLEX and SCIP are indicator constraints. They make modelling complex boolean constraints extremely easy, in fact Gu…
-
Consider the following SOCP (per @wkschwartz)
```
import cvxpy as cv
u = cv.Variable(2)
constr = [u[1] - u[0] = 0]
prob1 = cv.Problem(cv.Minimize(cv.norm(u)), constr)
```
Clearly, we could equ…
-
*Issue migrated from trac ticket # 1614*
**milestone:** HeuristicLab 3.3.x Backlog | **component:** Algorithms | **priority:** highest
#### 2011-08-09 09:36:42: @abeham created the issue
___
> Sol…