Chapter 5 Integer Programming

1) The 3 types of integer programming models are total, 0 - 1, and mixed. Answer: TRUE

Diff: 1Page Ref: 182

Main Heading: Integer Programming Models

Key words: integer programming models

2) In a total integer model, all decision variables have integer solution values. Answer: TRUE

Diff: 1Page Ref: 182

Main Heading: Integer Programming Models

Key words: integer programming models

3) In a 0 - 1 integer model, the solution values of the decision variables are 0 or 1. Answer: TRUE

Diff: 1Page Ref: 182

Main Heading: Integer Programming Models

Key words: integer programming models

4) In a mixed integer model, some solution values for decision variables are integer and others can be non-integer. Answer: TRUE

Diff: 1Page Ref: 183

Main Heading: Integer Programming Models

Key words: integer programming models

5) In a mixed integer model, all decision variables have integer solution values. Answer: FALSE

Diff: 2Page Ref: 184

Main Heading: Integer Programming Models

Key words: integer programming models

6) In a mixed integer model, the solution values of the decision variables are 0 or 1. Answer: FALSE

Diff: 2Page Ref: 184

Main Heading: Integer Programming Models

Key words: integer programming models

7) The branch and bound method can only be used for maximization integer programming problems. Answer: FALSE

Diff: 1Page Ref: 187

Main Heading: Integer Programming Models

Key words: integer programming models, branch and bound

8) The branch and bound solution method cannot be applied only to 0-1 integer programming problems. Answer: FALSE

Diff: 2Page Ref: 187

Main Heading: Integer Programming Models

Key words: integer programming models, branch and bound method

9) In a problem involving capital budgeting applications, the 0-1 variables designate the acceptance or rejection of the different projects. Answer: TRUE

Diff: 2Page Ref: 196

Main Heading: Integer Programming Models

Key words: capital budgeting, 0-1 variables

10) In a 0-1 integer programming problem involving a capital budgeting application (where xj = 1, if project j is selected, xj = 0, otherwise) the constraint x1 - x2 ≤ 0 implies that if project 2 is selected, project 1 can not be selected. Answer: FALSE

Diff: 2Page Ref: 196

Main Heading: Integer Programming Models

Key words: capital budgeting, 0-1 variables

11) The divisibility assumption is violated by integer programming. Answer: TRUE

Diff: 1Page Ref: 182

Main Heading: Integer Programming Models

Key words: integer linear programming models, multiple choice constraint

12) One type of constraint in an integer program is a multiple choice constraint. Answer: TRUE

Diff: 1Page Ref: 184

Main Heading: Integer Programming Models

Key words: integer linear programming models, multiple choice constraint

13) If exactly 3 projects are to be selected from a set of 5 projects, this would be written as 3 separate constraints in an integer program. Answer: FALSE

Diff: 2Page Ref: 184

Main Heading: Integer Programming Models

Key words: integer linear programming models, multiple choice constraint

14) A conditional constraint specifies the conditions under which variables are integers or real variables. Answer: FALSE

Diff: 1Page Ref: 184

Main Heading: Integer Programming Models

Key words: integer linear programming models, constraint

15) Rounding non-integer solution values up to the nearest integer value can result in an infeasible solution to an integer programming problem. Answer: TRUE

Diff: 2Page Ref: 184

Main Heading: Integer Programming Models

Key words: integer programming models, graphical solution

16) A feasible solution to an integer programming problem is ensured by rounding down non-integer solution values. Answer: TRUE

Diff: 2Page Ref: 186

Main Heading: Integer Programming Models

Key words:...