Contents Menu Expand Light mode Dark mode Auto light/dark, in light mode Auto light/dark, in dark mode Skip to content
This is a Beta release. The API is subject to change, and bugs may be present. Do not trust the results without further validation.
BendersLib
Light Logo Dark Logo
  • Home
  • Tutorials
    • Classical Benders Decomposition
    • Combinatorial Benders Decomposition
    • Generalized Benders Decomposition
    • L-shaped Method
    • Integer L-shaped Method
    • Logic-based Benders Decomposition
    • Enhancements
  • Manual
    • Installation
    • Quickstart
    • Components
    • Workflow
    • Solver Interfaces
    • Master Problem
    • Subproblem
    • Benders Cut
    • Benders Methods
    • Callbacks
    • Logging and Profiling
    • Numerical Issues
    • How-To Guides
    • Contributing
  • API Reference
    • Data Classes
    • Solver Interfaces
    • Core Classes
    • Benders Cuts
    • Benders Methods
    • Callbacks
    • Functions
    • Errors
  • Examples
    • Basic Examples
      • Branch-and-check Method
      • Combinatorial Benders using Branch-and-check Method
      • Annotated Benders Decomposition
      • Simple Classical Benders Example
      • Combinatorial Benders Decomposition
      • L-shaped Method
      • L-shaped Method with Convex Recourse
      • Integer L-shaped Method
      • Generalized Benders Decomposition
    • Advanced Examples
      • Stochastic Logic-Based Benders Decomposition
      • Logic-Based Benders Decomposition
      • Combinatorial Benders Decomposition (IIS)
      • L-shaped Method by Logic-based Benders Decomposition
      • Integer L-shaped Method (IIS)
    • Expert Examples
      • Simple Callback
      • Save All Feasible Solutions
      • Callback in Branch-and-check Method
      • Warm Start
      • Early Stop
      • Cut Normalization
      • Pareto-optimal Cut
      • Local Branching
      • Trust Region Method (Box Constraints)
      • Trust Region Method (Hamming Distance)
      • Cut Management
      • Trust Region Method (L1 Norm)
      • Cut from Master Solution Neighbor
    • Benchmarks
      • Linear Recourse (Gurobi)
      • Linear Recourse (COPT)
      • Facility Location (COPT)
      • Integer Recourse (Gurobi)
      • Integer Recourse (COPT)
      • Facility Location (Gurobi)
    • Computing IIS
      • SCIP IIS
      • Gurobi IIS
      • CPLEX IIS
      • Copt IIS
      • CP Optimizer IIS
      • Pyomo IIS
      • OR-Tools IIS
    • Solver Usage
      • Gurobi
      • COPT
      • OR-Tools
      • SCIP
      • CP Optimizer
      • CPLEX
      • Pyomo
    • API Oriented
      • Retrieve master and sub problems
      • Template for Customizing Benders Decomposition
  • Release Notes
  • About

Links

  • Benders.dev
  • BendersLib@GitHub
  • BendersLib@PyPI
  • Getting Help
  • Author
Back to top

Computing IISΒΆ

This section contains examples demonstrating how to compute an Irreducible Infeasible Subsystem (IIS) using various solver interfaces.

SCIP IIS

SCIP IIS

Gurobi IIS

Gurobi IIS

CPLEX IIS

CPLEX IIS

Copt IIS

Copt IIS

CP Optimizer IIS

CP Optimizer IIS

Pyomo IIS

Pyomo IIS

OR-Tools IIS

OR-Tools IIS
Next
SCIP IIS
Previous
Facility Location (Gurobi)
Copyright © 2021-2026 Peng-Hui Guo
Made with Sphinx and @pradyunsg's Furo