What is the nature of a 0-1 integer linear program?

In a 0-1 integer linear program, the defining characteristic is that the decision variables are restricted to binary values, specifically 0 or 1. This binary restriction means that each variable can represent a yes/no decision, making it highly suitable for problems involving selection, assignment, or other scenarios where an entity either takes a specific action or does not.

This nature allows for modeling situations like project selection, where choosing to implement a project can be represented by a 1, and opting not to implement it can be represented by a 0. The constraints and objective function of the program will then guide the decision-making process under these binary limitations.

Other options in the question describe different types of integer linear programming or linear programming more broadly, where variables could take on a range of integer values or even fractional values. None of these characteristics apply to 0-1 integer linear programs, which strictly require the binary approach.