1/15
Flashcards for reviewing vocabulary related to Integer Programming, covering types of models, constraints, and variables.
Name | Mastery | Learn | Test | Matching | Spaced |
---|
No study sessions yet.
Integer Programming
A type of Linear Programming where certain or all values must be whole numbers, leading to complex problem-solving and is highly useful in real-world scenarios.
Pure (Total) Integer Model
Requires that all variables are integers.
0-1 (Yes or No) Integer Model
All the decision variables have integer values of zero or one.
Mutually Exclusive Constraint
When both decision variables are equal to zero.
Multiple-Choice Constraint
Forces a decision between two options where one of the decision variables must be chosen—but not both—the constraint changes to an equation.
Conditional Constraint
One project can only be chosen if another is chosen first.
Corequisite Constraint
A stricter rule where either both facilities are built or neither is built. If one is selected, the other must be selected too.
Mixed Integer Model
Some solution values for decision variables must be integers (whole number) and others can be non-integer or continuous variable (fractions, decimals).
Continuous Variable
A variable that can take on an infinite number of values within some interval.
Constraint
A mathematical relationship that represents limited resources or minimum levels of activity in a mathematical programming model.
Decision Variable
A variable whose value represents a potential decision on the part of the manager.
Integer Programming
A form of linear programming that generates only integer solution values for the model variables.
Mixed Integer Model
An integer linear programming model that can generate a solution with both integer and non-integer values.
Objective Function
A mathematical relationship that represents the objective of a problem solution.
Total Integer Model
An integer programming model that all the decision variables are required to have integer solution values.
Zero-One Integer Model
An integer programming model that can have solution values of only zero or one.