Changeset 2218:50f1a780a5ff in lemon-0.x for lemon/lp_cplex.cc
- Timestamp:
- 09/21/06 16:46:28 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2952
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/lp_cplex.cc
r2168 r2218 270 270 status = CPXlpopt(env, lp); 271 271 //status = CPXprimopt(env, lp); 272 #if CPX_VERSION >= 900272 #if CPX_VERSION >= 800 273 273 if (status) 274 274 { … … 417 417 LpCplex::SolutionStatus LpCplex::_getPrimalStatus() 418 418 { 419 //Unboundedness not treated well: the following is from cplex 9.0 doc 420 // About Unboundedness 421 422 // The treatment of models that are unbounded involves a few 423 // subtleties. Specifically, a declaration of unboundedness means that 424 // ILOG CPLEX has determined that the model has an unbounded 425 // ray. Given any feasible solution x with objective z, a multiple of 426 // the unbounded ray can be added to x to give a feasible solution 427 // with objective z-1 (or z+1 for maximization models). Thus, if a 428 // feasible solution exists, then the optimal objective is 429 // unbounded. Note that ILOG CPLEX has not necessarily concluded that 430 // a feasible solution exists. Users can call the routine CPXsolninfo 431 // to determine whether ILOG CPLEX has also concluded that the model 432 // has a feasible solution. 433 419 434 int stat = CPXgetstat(env, lp); 420 #if CPX_VERSION >= 900435 #if CPX_VERSION >= 800 421 436 switch (stat) 422 437 { … … 486 501 { 487 502 int stat = CPXgetstat(env, lp); 488 #if CPX_VERSION >= 900503 #if CPX_VERSION >= 800 489 504 switch (stat) 490 505 { … … 515 530 { 516 531 int stat = CPXgetstat(env, lp); 517 #if CPX_VERSION >= 900532 #if CPX_VERSION >= 800 518 533 switch (stat) 519 534 {
Note: See TracChangeset
for help on using the changeset viewer.