I am solving a MILP with JuMP and have a set of valid cuts for the linear relaxation. I would like to add all these inequalities as a pool of possible cuts before launching the solving and the branching procedure. The aim is to avoid implementation of callback where I test all these cuts manually to find the ones violated by a fractional solution. I used to work in C where the function AddCuts would do this (https://www.ibm.com/support/knowledgecenter/SSSA5P_12.6.0/ilog.odms.cplex.help/refdotnetcplex/html/M_ILOG_CPLEX_Cplex_AddCuts.htm) but I cannot find anything equivalent in JuMP.
Does this possibility exist in JuMP ?