XPRBprob

int XPRS_CC cbNode(XPRSprob oprob, void *bp)
{
 XPRBprob *bprob = (XPRBprob*)bp;
 XPRBcut aCut;
 bprob->beginCB(oprob);
   ...                // Define the cut 'aCut'
 bprob->addCuts(&aCut, 1);
 bprob->endCB();
 return 0;            // Call this function once per node
}

int main(int argc, char **argv)
{
 XPRBprob prob("myprob");
   ...                // Define the problem
 prob.setCutMode(1);
 XPRSsetcbcutmgr(prob.getXPRSprob(), cbNode, &prob);

 prob.setSense(XPRB_MAXIM);
 prob.mipOptimize();
   ...                // Solution output
} 

XPRBprob prob("myprob");
XPRBsol sol = prob.newSol();
  ...        // Define + load the problem
prob.addMIPsol(sol, "myHeurSol");
/* Request notification of solution status after processing */
XPRSaddcbusersolnotify(prob.getXPRSprob(), solnotify_handler, &prob, 0);

void XPRS_CC printSol(XPRSprob oprob, void *my_object)
{
 int num;
 XPRBprob *bprob = (XPRBprob*)bp;
 XPRBvar x;

 XPRSgetintattrib(oprob, XPRS_MIPSOLS, &num);
                         // Get number of the solution
 bprob->beginCB(oprob);  // Work with local optimizer problem
 bprob->sync(XPRB_XPRS_SOL);   // Update BCL solution values

 cout << "Solution " << num << ": Objective value: ";
 cout << bprob->getObjVal() << endl;
 x = bcl_prob->getVarByName("x_1");
 cout << x.getName() << ": " << x.getSol() << endl;

 bprob->endCB();         // Reset BCL to orig. optimizer problem
}

int main(int argc, char **argv)
{
 XPRBprob prob("myprob");
   ...                // Define the problem
 XPRSsetcbintsol(prob.getXPRSprob(), printSol, &prob);
 prob.setSense(XPRB_MAXIM);
 prob.mipOptimize();
} 

XPRBvar b;
XPRBsos SO2;
XPRBprob prob("myprob");
b = prob.newVar("b", XPRB_BV);

b.setDir(XPRB_UP);         // Branch upwards first
SO2.setDir(XPRB_PR, 1);    // Highest branching priority
prob.writeDir("directout");
prob.clearDir();

XPRBprob prob("myprob");
prob.setSense(XPRB_MAXIM);
prob.exportProb(XPRB_LP);

XPRBprob prob("myprob");
  ...        // Define + load the problem
prob.mipOptimize();
prob.fixMIPEntities();
prob.lpOptimize();

XPRBprob prob("myprob");
XPRBctr C2;

C2 = prob.getCtrByName("C2");
if (C2.isValid())  C2.print(); 

XPRBprob prob("myprob");
XPRBindexSet I2;

I2 = prob.getIndexSetByName("IS");
if (I2.isValid())  I2.print(); 

XPRBprob prob("myprob");
XPRBsos S2;

S2 = prob.getSosByName("SO2");
if (S2.isValid())  S2.print();

XPRBprob prob("myprob");
XPRBvar b2;

b2 = prob.getVarByName("b");
if (b2.isValid())
{ b2.print(); cout << endl; } 

XPRBprob bclProb("myprob");
XPRSprob optProb;
...   // Define the BCL problem
if ((prob.getProbStat()&XPRB_MOD) == XPRB_MOD)  prob.loadMat();
optProb = bclProb.getXPRSprob();
XPRSsetintcontrol(optProb, XPRS_PRESOLVE, 0); 

XPRBprob prob("myprob");
double vals[] = {1.5, 1, 0, 4, 2.2};
  ...        // Define + load the problem
if (prob.loadMIPSol(vals, 5)!=0)
 cout << "Loading the solution failed." << endl; 

XPRBprob prob("myprob");
  ...        // Define the problem
prob.setSense(XPRB_MAXIM);
prob.lpOptimize();
if (prob.getLPStat() == XPRB_LP_OPTIMAL)
 cout << "LP solution: " << prob.getObjVal() << endl;
prob.mipOptimize();
if (prob.getMIPStat() == XPRB_MIP_OPTIMAL ||
    prob.getMIPStat() == XPRB_MIP_SOLUTION)
 cout << "MIP solution: " << prob.getObjVal() << endl; 

XPRBprob prob("myprob");
  ...        // Define + load the problem
XPRBctr iter = NULL;
while (prob.nextCtr(iter)) {
  iter.print();
}

XPRBvar x,y;
XPRBctr Ctr1, Ctr2, Ctr4, Profit;
XPRBexpr le;
XPRBprob prob("myprob");

x = prob.newVar("x", XPRB_PL, 0, 200);
y = prob.newVar("y", XPRB_PL, 0, 200);

Ctr1 = prob.newCtr("C1", 3*x + 2*y >= 40);
Ctr2 = prob.newCtr("C2", 3*x*y + sqr(y) <= 500);
Profit = prob.newCtr("Profit", x+2*y);
prob.setObj(Profit);

le = x-5*y;
Ctr4 = prob.newCtr(le == 10);

XPRBprob prob("myprob");
XPRBvar y,b;
XPRBcut Cut1, Cut2, Cut3;

y = prob.newVar("y", XPRB_PL, 0, 200);
b = prob.newVar("b", XPRB_BV);

Cut1 = prob.newCut(y == 100*b);
Cut1.setID(1);

Cut2 = prob.newCut(y <= 100*b, 2);

Cut3 = prob.newCut(3);
Cut3.setType(XPRB_L);
Cut3.add(y+2);
prob.delCut(Cut3); 

XPRBindexSet ISet;
XPRBprob prob("myprob");
int ind;

ISet = prob.newIndexSet("IS", 10);
ind = ISet.addElement("a"); ISet += "b";

XPRBvar x,y,z;
XPRBsos SO1, SO2;
XPRBprob prob("myprob");

x = prob.newVar("x", XPRB_PL, 0, 200);
y = prob.newVar("y", XPRB_PL, 0, 200);
z = prob.newVar("z", XPRB_PL, 0, 200);

SO1 = prob.newSos("SO1");
SO1.add(x+2*y+3*z);
SO1.print();             //  SO1(1): x(+1) y(+2) z(+3)
prob.delSos(SO1);

SO2 = prob.newSos("SO2", XPRB_S2, 10*x+20*y);

XPRBvar x,b,s;
XPRBprob prob("myprob");

x = prob.newVar("x");        // Continuous with default bounds
b = prob.newVar("b", XPRB_BV);         // Binary variable
s = prob.newVar("s", XPRB_SC, 0, 50);  // Semi-cont. in [0,50]
s.setLim(10);                          // with limit value 10 

XPRBprob prob("example2");
  ...        // Define + load the problem
prob.readBinSol();
prob.mipOptimize(); 

XPRBprob prob("example2");
  ...        // Define + load the problem
prob.readSlxSol();
prob.mipOptimize(); 

XPRBbasis bas;
XPRBprob prob("myprob");

bas = prob.saveBasis();
 ...              // Modify the problem
prob.loadMat();
prob.loadBasis(bas);
bas.reset();
prob.lpOptimize();

XPRBprob prob("myprob");
XPRB::setMsgLevel(1);
prob.setMsgLevel(3);
XPRSsetintcontrol(prob.getXPRSprob(), XPRS_LPLOG, 0);
XPRSsetintcontrol(prob.getXPRSprob(), XPRS_MIPLOG, -500); 

XPRBprob prob("myprob");
  ...        // Define + load the problem
prob.sync(XPRB_XPRS_PROB);
prob.mipOptimize(); 

XPRBprob prob("example2");
  ...        // Define + load the problem
prob.mipOptimize();
prob.writeSol(); 

XPRBprob prob("example2");
  ...        // Define + load the problem
prob.mipOptimize();
prob.writeBinSol(); 

XPRBprob prob("example2");
  ...        // Define + load the problem
prob.mipOptimize();
prob.writePrtSol(); 

XPRBprob prob("example2");
  ...        // Define + load the problem
prob.mipOptimize();
prob.writeSlxSol();