// The routine returns zero unless an error occurred during the

   // optimization. Examples of errors include exhausting available

   // memory (CPXERR_NO_MEMORY) or encountering invalid data in the

   // CPLEX problem object (CPXERR_NO_PROBLEM). Exceeding a

   // user-specified CPLEX limit, or proving the model infeasible or

   // unbounded, are not considered errors. Note that a zero return

   // value does not necessarily mean that a solution exists. Use query

   // routines CPXsolninfo, CPXgetstat, and CPXsolution to obtain

   // further information about the status of the optimization.

     //CPX_PARAM_LPMETHOD 

       return SOLVED;

       //We want to exclude some cases

       switch (CPXgetstat (env, lp)){

       case CPX_OBJ_LIM:

       case CPX_IT_LIM_FEAS:

       case CPX_IT_LIM_INFEAS:               

       case CPX_TIME_LIM_FEAS:

       case CPX_TIME_LIM_INFEAS:

 	return UNSOLVED;

       default:

 	return SOLVED; 

       }

 //     int i=  lpx_simplex(lp);

   }

 //     switch (i) {

 //     case LPX_E_OK: 

 //       return SOLVED;

 //7.5-os cplex statusai (Vigyazat: a 9.0-asei masok!)

 //       break;

 // This table lists the statuses, returned by the CPXgetstat() routine, for solutions to LP problems or mixed integer problems. If no solution exists, the return value is zero.

 //     default:

 //       return UNSOLVED;

 // For Simplex, Barrier  

 //     }

 // 1  	CPX_OPTIMAL  

   }

 // 	 Optimal solution found  

 // 2  	CPX_INFEASIBLE  

   LpCplex::SolutionStatus LpCplex::_getPrimalStatus()

 // 	 Problem infeasible  

   {

 // 3    CPX_UNBOUNDED  

 //7.5-os cplex statusai

 // 	 Problem unbounded  

 // #define CPX_OPTIMAL                      1

 // 4  	CPX_OBJ_LIM  

 // #define CPX_INFEASIBLE                   2

 // 	 Objective limit exceeded in Phase II  

 // #define CPX_UNBOUNDED                    3

 // 5  	CPX_IT_LIM_FEAS  

 // #define CPX_OBJ_LIM                      4

 // 	 Iteration limit exceeded in Phase II  

 // #define CPX_IT_LIM_FEAS                  5

 // 6  	CPX_IT_LIM_INFEAS  

 // #define CPX_IT_LIM_INFEAS                6

 // 	 Iteration limit exceeded in Phase I  

 // #define CPX_TIME_LIM_FEAS                7

 // 7  	CPX_TIME_LIM_FEAS  

 // #define CPX_TIME_LIM_INFEAS              8

 // 	 Time limit exceeded in Phase II  

 // #define CPX_NUM_BEST_FEAS                9

 // 8  	CPX_TIME_LIM_INFEAS  

 // #define CPX_NUM_BEST_INFEAS             10

 // 	 Time limit exceeded in Phase I  

 // #define CPX_OPTIMAL_INFEAS              11

 // 9  	CPX_NUM_BEST_FEAS  

 // #define CPX_ABORT_FEAS                  12

 // 	 Problem non-optimal, singularities in Phase II  

 // #define CPX_ABORT_INFEAS                13

 // 10 	CPX_NUM_BEST_INFEAS  

 // #define CPX_ABORT_DUAL_INFEAS           14

 // 	 Problem non-optimal, singularities in Phase I  

 // #define CPX_ABORT_PRIM_INFEAS           15

 // 11 	CPX_OPTIMAL_INFEAS  

 // #define CPX_ABORT_PRIM_DUAL_INFEAS      16

 // 	 Optimal solution found, unscaled infeasibilities  

 // #define CPX_ABORT_PRIM_DUAL_FEAS        17

 // 12 	CPX_ABORT_FEAS  

 // #define CPX_ABORT_CROSSOVER             18

 // 	 Aborted in Phase II  

 // #define CPX_INForUNBD                   19

 // 13 	CPX_ABORT_INFEAS  

 // #define CPX_PIVOT                       20

 // 	 Aborted in Phase I  

 // 14  	CPX_ABORT_DUAL_INFEAS  

 // 	 Aborted in barrier, dual infeasible  

 // 15  	CPX_ABORT_PRIM_INFEAS  

 // 	 Aborted in barrier, primal infeasible  

 // 16  	CPX_ABORT_PRIM_DUAL_INFEAS  

 // 	 Aborted in barrier, primal and dual infeasible  

 // 17  	CPX_ABORT_PRIM_DUAL_FEAS  

 // 	 Aborted in barrier, primal and dual feasible  

 // 18  	CPX_ABORT_CROSSOVER  

 // 	 Aborted in crossover  

 // 19  	CPX_INForUNBD  

 // 	 Infeasible or unbounded  

 // 20   CPX_PIVOT

 //       User pivot used

 //

     case CPX_IT_LIM_INFEAS:

  //    case CPX_IT_LIM_INFEAS:

     case CPX_TIME_LIM_INFEAS:

 //     case CPX_TIME_LIM_INFEAS:

     case CPX_NUM_BEST_INFEAS:             

 //     case CPX_NUM_BEST_INFEAS:             

     case CPX_OPTIMAL_INFEAS:              

 //     case CPX_OPTIMAL_INFEAS:              

     case CPX_ABORT_INFEAS:                

 //     case CPX_ABORT_INFEAS:                

     case CPX_ABORT_PRIM_INFEAS:           

 //     case CPX_ABORT_PRIM_INFEAS:           

     case CPX_ABORT_PRIM_DUAL_INFEAS:      

 //     case CPX_ABORT_PRIM_DUAL_INFEAS:      

       break;

 //     case CPX_OBJ_LIM:                    

     case CPX_OBJ_LIM:                    

 //     case CPX_IT_LIM_FEAS:             

     case CPX_IT_LIM_FEAS:             

 //     case CPX_TIME_LIM_FEAS:                

     case CPX_TIME_LIM_FEAS:                

 //     case CPX_NUM_BEST_FEAS:                

     case CPX_NUM_BEST_FEAS:                

 //     case CPX_ABORT_FEAS:                  

     case CPX_ABORT_FEAS:                  

 //     case CPX_ABORT_PRIM_DUAL_FEAS:        

     case CPX_ABORT_PRIM_DUAL_FEAS:        

 //       return FEASIBLE;

       return FEASIBLE;

       break;

   }

     //Nem tudom, hanyas cplex verzio statusai

 //9.0-as cplex verzio statusai

 //     int stat = CPXgetstat (env, lp);

   LpCplex::SolutionStatus LpCplex::_getDualStatus()

 //     switch (stat) {

   {

 //     case CPX_STAT_OPTIMAL://Optimal

     int stat = CPXgetstat (env, lp);

 //       return OPTIMAL;

     switch (stat) {

 //       break;

     case 0:

 //     case CPX_STAT_INFEASIBLE://Infeasible 

       return UNDEFINED; //Undefined

 //       return INFEASIBLE;

     case CPX_OPTIMAL://Optimal

 //       break;

       return OPTIMAL;

 //     case CPX_STAT_UNBOUNDED://Unbounded

     case CPX_UNBOUNDED:

 //       return INFINITE;

      return INFEASIBLE;

 //       break;

     default:

 //     case CPX_STAT_NUM_BEST://Feasible

       return UNDEFINED; //Everything else comes here

 //       return FEASIBLE;

       //FIXME error

 //       break;

     }

 //     default:

 //       return UNDEFINED; //Everything else comes here

 //       //FIXME error

 //     }

   }