Mathieu Tanneau

> what if I want to run presolve that mixes together LP and MIP presolve routines? At first, I guess the simplest would be to duplicate such routines. There aren't...

Re: columns & row syncing One point of using row & column flags + not creating fill-in was to avoid this issue, so I'm not sure what the right way...

> Can you explain more how row&col flag can be used to avoid col and row sync ? When I first coded the presolve, I purposefully considered only reductions that...

> Is there an advantage/need to maintaining the dropped rows or columns throughout the entire presolve? Mostly to avoid dealing with re-organizing memory and doing the book-keeping of presolve original...

This issue has been stale for 2 years; closing. For reference: * Tulip's presolve code has been included in [MathOptPresolve](https://github.com/mtanneau/MathOptPresolve.jl) * For other presolve capabilities, see [PaPILO](https://github.com/scipopt/papilo) and the julia...

I second the request to be able to grab the Lagrange multipliers of all constraints (not just power balance): thermal constraints, voltage magnitude bounds, active/reactive power bounds, etc...

TBH, the main benefit to me would be that I can cite the repo and the dataset, in addition to the arxiv paper 🙃 I do think it would make...

For pointers, here are the 2 lines that would need changing, for handling lines that start with a `$` https://github.com/JuliaSmoothOptimizers/QPSReader.jl/blob/ed54ce746fd707eca53ccb4c13d33c665daf4884/src/readqps.jl#L204 https://github.com/JuliaSmoothOptimizers/QPSReader.jl/blob/ed54ce746fd707eca53ccb4c13d33c665daf4884/src/readqps.jl#L316 It just needs adding `|| ln[1] == '$'`. For...

If you're working with linear programs (which is the only class supported by Tulip), then a conflict can be identified from a dual proof of infeasibility (which you can retrieve...

Can you give me a reproducible example?