Which of the following is NOT a type of integer optimization problem? Mixed Integer Linear Programming (MILP) Pure Integer Programming (PIP) Zero-one Linear Programming (ZOLP) Dual Integer Programming (DIP)

What type of problem involves both integer and linear decision variables?Mixed-integer linear programming (MILP)Quadratic programmingNonlinear integer programmingDual programming

What kind of solution do you obtain when you solve a relaxation of an integer optimization problem?Always an integer solutionA solution without considering integer constraintsA solution without any constraintsAlways a zero-one solution

One approach to solving integer linear programming problems is to ignore the integer constraint and solve the problem with continuous decision variables. This is referred to as:Group of answer choicesQuick solution methodLP satisfyingLP relaxationLP approximation Previous

Integer linear programs provide substantial modelling flexibility and are harder to solve than linear programs.Group of answer choicesTrueFalse

Types of integer programming models are _____________.Group of answer choicesPure Integer0-1MixedAll of the above