Preview

Integer Programming Essay Example

Powerful Essays
Open Document
Open Document
6269 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Integer Programming Essay Example
Introduction to Management Science, 10e (Taylor)
Chapter 5 Integer Programming

1) The 3 types of integer programming models are total, 0 - 1, and mixed.
Answer: TRUE
Diff: 1 Page 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: 1 Page 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: 1 Page 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: 1 Page 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: 2 Page 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: 2 Page 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: 1 Page 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: 2 Page 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:

You May Also Find These Documents Helpful

  • Good Essays

    ECO 550 FINAL EXAM

    • 1177 Words
    • 4 Pages

    9. The integer programming model for a transportation problem has constraints for supply at each source and demand at each destination.…

    • 1177 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Busn312 Hw3A

    • 727 Words
    • 3 Pages

    Linear programming problems have a.|linear objective functions, non-linear constraints.| b.|non-linear objective functions, non-linear constraints.| c.|non-linear objective functions, linear constraints.| d.|linear objective functions, linear constraints.| ____C 7. The first step in formulating a linear programming problem is a.|Identify any upper or lower bounds on the decision variables.| b.|State the constraints as linear combinations of the decision variables.| c.|Understand the problem.| d.|Identify the decision variables.| e.|State the objective…

    • 727 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Mat 540 Week 1 Quiz

    • 501 Words
    • 3 Pages

    5. Which of the following is an equation or an inequality that expresses a resource restriction in a mathematical model?…

    • 501 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    BUS 434 Week 1 Quiz

    • 336 Words
    • 3 Pages

    7. All but which one of the following assumptions are included within the model of perfect comp...…

    • 336 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    MAT 540 MIDTERM EXAM

    • 562 Words
    • 4 Pages

    14. Which of the following is incorrect with respect to the use of models in decision making?…

    • 562 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    mat540 quiz 1 review

    • 668 Words
    • 6 Pages

    7. A model is a mathematical representation of a problem situation including variables, parameters, and equations.…

    • 668 Words
    • 6 Pages
    Satisfactory Essays
  • Powerful Essays

    Freaudian Analysis

    • 3380 Words
    • 14 Pages

    1. Consider the following linear programming problem: Maximize Z = 400 x + 100y Subject to 8 x + 10y ≤ 80 2 x + 6y ≤ 36 x≤ 6 x, y ≥ 0…

    • 3380 Words
    • 14 Pages
    Powerful Essays
  • Satisfactory Essays

    unit 3

    • 313 Words
    • 2 Pages

    4. Assume the variables result, w, x, y , and z are integers, and that w=5, x=4, y=8, and z=2. What value will be stored in result in each of the following statements?…

    • 313 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Mat 540 Week 9 Discussion

    • 374 Words
    • 2 Pages

    Integer programming is concerned with optimization problems in which some of the variables are required to take on discrete values. Rather than allow a variable to assume all real values in a given range, only predetermined discrete values within the range are permitted. In most cases, these values are the integers, giving rise to the name of this class of models. Models with integer variables are very useful. Situations that cannot be modeled by linear programming are easily handled by integer programming. Primary among these involve binary decisions such as yes-no, build-no build or invest-not invest. Although one can model a binary decision in linear programming with a variable that ranges between 0 and 1, there is nothing that keeps the solution from obtaining a fractional value such as 0.5, hardly acceptable to a decision maker. Integer programming requires such a variable to be either 0 or 1, but not in-between. Unfortunately integer programming models of practical size are often very difficult or impossible to solve. Linear programming methods can solve problems orders of magnitude larger than integer programming methods. A typical mathematical program consists of a single objective function, representing either a profit to be maximized or a cost to be minimized, and a set of constraints that circumscribe the decision variables. In the case of a linear program (LP) the objective function and constraints are all linear functions of the decision variables. At first glance these restrictions would seem to limit the scope of the LP model, but this is hardly the case. Because of its simplicity, software has been developed that is capable of solving problems containing millions of variables and tens of thousands of constraints.…

    • 374 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    Ap Psychology Quiz

    • 564 Words
    • 3 Pages

    |1. |If a variable has possible values –2, 6, and 17, then this variable is |…

    • 564 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    4. Assume the variables result, w,x, y, and z are all integers, and that w= 5, x= 4, y=8 and z=2. What will the values be stored in result in each of the following statements?…

    • 748 Words
    • 3 Pages
    Powerful Essays
  • Satisfactory Essays

    b. At least three aspects of the problem you think that the model will struggle to solve and provide reasoning as to why.…

    • 564 Words
    • 3 Pages
    Satisfactory Essays
  • Better Essays

    Assignment Chapter 1

    • 1477 Words
    • 6 Pages

    1.2 Explain how modeling is used in decision analysis. What is meant by the term "requisite decision model"?…

    • 1477 Words
    • 6 Pages
    Better Essays
  • Satisfactory Essays

    1) The model should represent the dynamics of the system configuration being evaluated in a way that is simple enough to understand and manipulate.…

    • 319 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    ___________________________________________________________________________ 1. A Ch3 Student: firm will maximize profit by producing that level of output at which A. the additional revenue from the last unit sold exceeds the additional cost of the last unit by the largest amount. B. the additional revenue from the last unit sold equals the additional cost of the last unit. C. total revenue exceeds total cost by the largest amount. D. total revenue equals total cost. E. both b and c 2. The function a decision maker seeks to maximize or minimize is the ________ function. A. optimal B. decision-making C. objective D. marginal E. none of the above 3. Choice variables A. determine the value of the objective function B. determine the constraint C. can only take on integer values D. cannot be continuous E. both c and d 4. For an unconstrained maximization problem A. the decision maker seeks to maximize net benefits. B. the decision maker seeks to maximize total benefits. C. the decision maker does not take cost into account because there is no constraint. D. the decision maker does not take the objective function into account because there is no constraint. E. none of the above 5. When marginal cost is greater than marginal benefit at the current activity level, the decision maker can increase net benefit by decreasing the activity because A. B. C. D. total benefit will rise by more than total cost will rise. marginal cost is rising faster than marginal benefit is falling. net benefit is upward sloping at this point. total cost will fall by more than total benefit will fall. 6. For a constrained minimization problem, the decision maker A. is constrained by the specific amount of total benefits. B. is…

    • 8076 Words
    • 33 Pages
    Good Essays