Scribd Logo
Upload

Welcome to Scribd!

  • "G:/Btech/Lab Softwares/Cplex/Datas/9.5.Dat": Typedef Typedef Typedef Typedef Int For Int

    Uploaded by

    jabir pv
    6 views1 page
    The document contains C++ code that models a linear programming problem to maximize total use while satisfying demand constraints. It defines array types to store problem data read from a file, creates decision variables and constraints, solves the model using CPLEX, and exports the solved model to a file. The objective is to maximize total use across 16 variables, subject to constraints ensuring demand is met for each of 4 products based on cut values and use variables.

    Original Description:

    sheet

    Original Title

    Cutting Sheet Metal

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains C++ code that models a linear programming problem to maximize total use while satisfying demand constraints. It defines array types to store problem data read from a file, creates decision variables and constraints, solves the model using CPLEX, and exports the solved model to a file. The objective is to maximize total use across 16 variables, subject to constraints ensuring demand is met for each of 4 products based on cut values and use variables.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    6 views1 page

    "G:/Btech/Lab Softwares/Cplex/Datas/9.5.Dat": Typedef Typedef Typedef Typedef Int For Int

    Uploaded by

    jabir pv
    The document contains C++ code that models a linear programming problem to maximize total use while satisfying demand constraints. It defines array types to store problem data read from a file, creates decision variables and constraints, solves the model using CPLEX, and exports the solved model to a file. The objective is to maximize total use across 16 variables, subject to constraints ensuring demand is met for each of 4 products based on cut values and use variables.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    #include<ilcplex/ilocplex.h> //9.

    5
    ILOSTLBEGIN
    typedef IloArray<IloNumArray>IloNumArray2base;
    typedef IloArray<IloBoolArray>IloBoolArray2base;
    typedef IloArray<IloNumVarArray> IloNumVarArray2;
    typedef IloArray<IloBoolVarArray> IloBoolVarArray2;
    int main()
    {
    for(int f=1;f<=1;f++)
    {
    IloEnv env;
    try
    {
    char str1[100]={"G:/BTech/Lab Softwares/CPLEX/Datas/9.5.dat"};
    ifstream fin(str1);
    if(!fin)
    {
    cout<<"Unable to open";
    exit(9);
    }
    IloNumArray2 sizes(env),cut(env);
    IloNumArray DEM(env);
    fin>>sizes>>cut>>DEM;
    IloModel mod(env);
    IloInt p,q;
    //Variables
    IloNumVarArray use(env,16,0,IloInfinity,ILOINT);
    IloExpr TotalUse(env);
    for(p=0;p<16;p++)
    {
    TotalUse+=use[p];
    }
    mod.add(IloMaximize(env,TotalUse)); //Objective
    TotalUse.end();
    IloExpr T(env);
    // Constraints
    for(p=0;p<4;p++)
    {
    for(q=0;q<16;q++)
    {
    T+=cut[p][q]*use[q];
    }
    mod.add(T>=DEM[p]);
    }
    T.end();
    IloCplex cplex(mod);
    cplex.solve();
    env.out()<<endl<<"Total cost = "<<cplex.getObjValue()<<endl;
    cplex.exportModel("G:/BTech/Lab Softwares/CPLEX/Datas/9.5_export.lp");
    }
    catch(IloException& e)
    {
    cerr<<"Error = "<<e<<endl;
    }
    catch(...)
    {
    cerr<<"Unknown error occured"<<endl;
    }
    env.end();
    return 0;

    }
    }

    You might also like