|  | Google OR-Tools v9.14
    a fast and portable software suite for combinatorial optimization | 
The model is 2*x + 2*y + 2*z >= 3 x + y <= 1 y + z <= 1 x + z <= 1 x, y, z in {0, 1}
The IIS has no variable bounds and all other constraints. In particular, the LP relaxation is feasible.
Definition at line 534 of file infeasible_subsystem_tests.cc.
| Public Member Functions | |
| NontrivialInfeasibleIp () | |
| Public Attributes | |
| Model | model | 
| Variable | x | 
| Variable | y | 
| Variable | z | 
| LinearConstraint | a | 
| LinearConstraint | b | 
| LinearConstraint | c | 
| LinearConstraint | d | 
| 
 | inline | 
Definition at line 544 of file infeasible_subsystem_tests.cc.
| LinearConstraint operations_research::math_opt::NontrivialInfeasibleIp::a | 
Definition at line 539 of file infeasible_subsystem_tests.cc.
| LinearConstraint operations_research::math_opt::NontrivialInfeasibleIp::b | 
Definition at line 540 of file infeasible_subsystem_tests.cc.
| LinearConstraint operations_research::math_opt::NontrivialInfeasibleIp::c | 
Definition at line 541 of file infeasible_subsystem_tests.cc.
| LinearConstraint operations_research::math_opt::NontrivialInfeasibleIp::d | 
Definition at line 542 of file infeasible_subsystem_tests.cc.
| Model operations_research::math_opt::NontrivialInfeasibleIp::model | 
Definition at line 535 of file infeasible_subsystem_tests.cc.
| Variable operations_research::math_opt::NontrivialInfeasibleIp::x | 
Definition at line 536 of file infeasible_subsystem_tests.cc.
| Variable operations_research::math_opt::NontrivialInfeasibleIp::y | 
Definition at line 537 of file infeasible_subsystem_tests.cc.
| Variable operations_research::math_opt::NontrivialInfeasibleIp::z | 
Definition at line 538 of file infeasible_subsystem_tests.cc.