Professional Documents
Culture Documents
1. The LP Relaxation contains the objective function and constraints of the IP problem, but drops all integer restrictions.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: LP relaxation
2. In general, rounding large values of decision variables to the nearest integer value causes fewer problems than rounding
small values.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: LP relaxation
3. The solution to the LP Relaxation of a minimization problem will always be less than or equal to the value of the
integer program minimization problem.
a. True
b. False
ANSWER: False
POINTS: 1
TOPICS: Graphical solution
4. If the optimal solution to the LP relaxation problem is integer, it is the optimal solution to the integer linear program.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: LP relaxation
5. Slack and surplus variables are not useful in integer linear programs.
a. True
b. False
ANSWER: False
POINTS: 1
TOPICS: Capital budgeting
9. The constraint x1 + x2 + x3 + x4 ≤ 2 means that two out of the first four projects must be selected.
a. True
b. False
ANSWER: False
POINTS: 1
TOPICS: k out of n alternatives constraint
10. The constraint x1 − x2 = 0 implies that if project 1 is selected, project 2 cannot be.
a. True
b. False
ANSWER: False
POINTS: 1
TOPICS: Conditional and corequisite constraints
11. The product design and market share optimization problem presented in the textbook is formulated as a 0-1 integer
linear programming model.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: Product design and market share optimization problem
12. The objective of the product design and market share optimization problem presented in the textbook is to choose the
levels of each product attribute that will maximize the number of sampled customers preferring the brand in question.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: Product design and market share optimization problem
14. Dual prices cannot be used for integer programming sensitivity analysis because they are designed for linear
programs.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: A cautionary note about sensitivity analysis
15. Some linear programming problems have a special structure that guarantees the variables will have integer values.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: Introduction to integer linear programming
16. Generally, the optimal solution to an integer linear program is less sensitive to the constraint coefficients than is a
linear program.
a. True
b. False
ANSWER: False
POINTS: 1
TOPICS: A cautionary note about sensitivity analysis
17. The classic assignment problem can be modeled as a 0-1 integer program.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: Applications involving 0-1 variables
19. If the LP relaxation of an integer program has a feasible solution, then the integer program has a feasible solution.
Cengage Learning Testing, Powered by Cognero Page 3
Chapter 7 - Integer Linear Programming
a. True
b. False
ANSWER: False
POINTS: 1
TOPICS: Rounding to obtain an integer solution
21. Most practical applications of integer linear programming involve only 0 -1 integer variables.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: 0 - 1 integer variables
22. Integer linear programs are harder to solve than linear programs.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: Introduction
Multiple Choice
23. Which of the following is the most useful contribution of integer programming?
a. finding whole number solutions where fractional solutions would not be appropriate
b. using 0-1 variables for modeling flexibility
c. increased ease of solution
d. provision for solution procedures for transportation and assignment problems
ANSWER: b
POINTS: 1
TOPICS: Introduction
24. In a model, x1 ≥ 0 and integer, x2 ≥ 0, and x3 = 0, 1. Which solution would not be feasible?
a. x1 = 5, x2 = 3, x3 = 0
b. x1 = 4, x2 = .389, x3 = 1
c. x1 = 2, x2 = 3, x3 = .578
d. x1 = 0, x2 = 8, x3 = 0
ANSWER: c
Cengage Learning Testing, Powered by Cognero Page 4
Chapter 7 - Integer Linear Programming
POINTS: 1
TOPICS: Introduction
26. Rounding the solution of an LP Relaxation to the nearest integer values provides
a. a feasible but not necessarily optimal integer solution.
b. an integer solution that is optimal.
c. an integer solution that might be neither feasible nor optimal.
d. an infeasible solution.
ANSWER: c
POINTS: 1
TOPICS: Graphical solution
27. The solution to the LP Relaxation of a maximization integer linear program provides
a. an upper bound for the value of the objective function.
b. a lower bound for the value of the objective function.
c. an upper bound for the value of the decision variables
d. a lower bound for the value of the decision variables
ANSWER: a
POINTS: 1
TOPICS: Graphical solution
28. The graph of a problem that requires x1 and x2 to be integer has a feasible region
a. the same as its LP relaxation.
b. of dots.
c. of horizontal stripes.
d. of vertical stripes.
ANSWER: b
POINTS: 1
TOPICS: Graphical solution
31. Let x1 and x2 be 0 - 1 variables whose values indicate whether projects 1 and 2 are not done or are done. Which
answer below indicates that project 2 can be done only if project 1 is done?
a. x1 + x2 = 1
b. x1 + x2 = 2
c. x1 − x2 ≤ 0
d. x1 − x2 ≥ 0
ANSWER: d
POINTS: 1
TOPICS: Conditional and corequisite constraints
32. Let x1 , x2 , and x3 be 0 - 1 variables whose values indicate whether the projects are not done (0) or are done (1).
Which answer below indicates that at least two of the projects must be done?
a. x1 + x2 + x3 ≥ 2
b. x1 + x2 + x3 ≤ 2
c. x1 + x2 + x3 = 2
d. x1 − x2 = 0
ANSWER: a
POINTS: 1
TOPICS: k out of n alternatives constraint
33. If the acceptance of project A is conditional on the acceptance of project B, and vice versa, the appropriate constraint
to use is a
a. multiple-choice constraint.
b. k out of n alternatives constraint.
c. mutually exclusive constraint.
d. corequisite constraint.
ANSWER: d
POINTS: 1
TOPICS: Modeling flexibility provided by 0-1 integer variables
38. Assuming W1, W2 and W3 are 0 -1 integer variables, the constraint W1 + W2 + W3 < 1 is often called a
a. multiple-choice constraint.
b. mutually exclusive constraint.
c. k out of n alternatives constraint.
d. corequisite constraint.
ANSWER: b
POINTS: 1
TOPICS: Mutually exclusive constraints
The optimal relaxed solution is at X = 1.538, Y = 4.846 where Z = 11.231. The rounded
b.
solution is X = 1.538, Y = 4.
c. The optimal solution is at X = 2.667, Y = 4, Z = 10.667.
POINTS: 1
TOPICS: Graphical solution
43. Consider a capital budgeting example with five projects from which to select. Let xi = 1 if project i is selected, 0 if
not, for i = 1,...,5. Write the appropriate constraint(s) for each condition. Conditions are independent.
a. Choose no fewer than three projects.
b. If project 3 is chosen, project 4 must be chosen.
c. If project 1 is chosen, project 5 must not be chosen.
d. Projects cost 100, 200, 150, 75, and 300 respectively. The budget is 450.
e. No more than two of projects 1, 2, and 3 can be chosen.
ANSWER:
a. x1 + x2 + x3 + x4 + x5 ≥ 3
b. x3 − x4 ≤ 0
c. x1 + x5 ≤ 1
d. 100x1 + 200x2 + 150x3 + 75x4 + 300x5 ≤ 450
e. x1 + x2 + x3 ≤ 2
POINTS: 1
TOPICS: Capital budgeting
44. Grush Consulting has five projects to consider. Each will require time in the next two quarters according to the table
below.
Project Time in first quarter Time in second quarter Revenue
A 5 8 12000
B 3 12 10000
C 7 5 15000
D 2 3 5000
E 15 1 20000
Revenue from each project is also shown. Develop a model whose solution would maximize revenue, meet the time
45. The Westfall Company has a contract to produce 10,000 garden hoses for a large discount chain. Westfall has four
different machines that can produce this kind of hose. Because these machines are from different manufacturers and use
differing technologies, their specifications are not the same.
Fixed Cost to Set Variable Cost
Machine Capacity
Up Production Run Per Hose
1 750 1.25 6000
2 500 1.50 7500
3 1000 1.00 4000
4 300 2.00 5000
a. This problem requires two different kinds of decision variables. Clearly define each kind.
b. The company wants to minimize total cost. Give the objective function.
c. Give the constraints for the problem.
d. Write a constraint to ensure that if machine 4 is used, machine 1 cannot be.
ANSWER:
a. Let Pi = the number of hoses produced on machine i
Ui = 1 if machine i is used, = 0 otherwise
b. Min 750U1 + 500U2 + 1000U3 + 300U4 + 1.25P 1 + 1.5P2 + P3 + 2P4
c. P1 ≤ 6000U1
P2 ≤ 7500U2
P3 ≤ 4000U3
P4 ≤ 5000U4
P1 + P2 + P3 + P4 ≥ 10000
c. U1 + U4 ≤ 1
POINTS: 1
TOPICS: Fixed costs
46. Hansen Controls has been awarded a contract for a large number of control panels. To meet this demand, it will use its
existing plants in San Diego and Houston, and consider new plants in Tulsa, St. Louis, and Portland. Finished control
panels are to be shipped to Seattle, Denver, and Kansas City. Pertinent information is given in the table.
Min 350000B3 + 200000B4 + 480000B5 + 5P11 + 7P12 + 8P13 + 10P21 + 8P22 + 6P23
+ 9P31 + 4P32 + 3P33 + 12P41 + 6P42 + 2P43 + 4P51 + 10P52 + 11P53
47. Simplon Manufacturing must decide on the processes to use to produce 1650 units. If machine 1 is used, its production
will be between 300 and 1500 units. Machine 2 and/or machine 3 can be used only if machine 1's production is at least
1000 units. Machine 4 can be used with no restrictions.
Fixed Variable Minimum Maximum
Machine
cost cost Production Production
1 500 2.00 300 1500
2 800 0.50 500 1200
3 200 3.00 100 800
4 50 5.00 any any
(HINT: Use an additional 0 - 1 variable to indicate when machines 2 and 3 can be used.)
ANSWER:
Let Ui = the number of units made by machine i
Si = 1 if machine i is used (requiring a set-up), = 0 otherwise
K = 1 if machine 1 produces at least 1000 units, = 0 otherwise
U3 ≥ 100S3
U3 ≤ 800S3
U4 ≤ 1650S4
U1 + U 2 + U3 + U4 = 1650
POINTS: 1
TOPICS: Distribution system design
48. Your express package courier company is drawing up new zones for the location of drop boxes for customers. The
city has been divided into the seven zones shown below. You have targeted six possible locations for drop boxes. The list
of which drop boxes could be reached easily from each zone is listed below.
Zone Can Be Served By Locations:
Downtown Financial 1, 2, 5, 6
Downtown Legal 2, 4, 5
Retail South 1, 2, 4, 6
Retail East 3, 4, 5
Manufacturing North 1, 2, 5
Manufacturing East 3, 4
Corporate West 1, 2, 6
Let xi = 1 if drop box location i is used, 0 otherwise. Develop a model to provide the smallest number of locations yet
make sure that each zone is covered by at least two boxes.
ANSWER:
Min Σxi
s.t. x1 + x2 + x5 + x6 ≥ 2
x2 + x4 + x5 ≥ 2
x1 + x2 + x4 + x6 ≥ 2
x3 + x4 + x5 ≥ 2
x1 + x 2 + x5 ≥ 2
x3 + x4 ≥ 2
x1 + x2 + x6 ≥ 2
POINTS: 1
TOPICS: Applications of integer linear programming
49. Consider the problem faced by a summer camp recreation director who is trying to choose activities for a rainy day.
Information about possible choices is given in the table below.
Time Popularity Popularity with
Category Activity (minutes) with Campers Counselors
Art 1 - Painting 30 4 2
2 - Drawing 20 5 2
3 - Nature craft 30 3 1
Music 4 - Rhythm band 20 5 5
Sports 5 - Relay races 45 2 1
6 - Basketball 60 1 3
Computer 7 - Internet 45 1 1
8 - Creative writing 30 4 3
9 - Games 40 1 2
a. Give a general definition of the variables necessary in this problem so that each activity can
Cengage Learning Testing, Powered by Cognero Page 13
Chapter 7 - Integer Linear Programming
be considered for inclusion in the day's schedule.
The popularity ratings are defined so that 1 is the most popular. If the objective is to keep the
b.
campers happy, what should the objective function be?
Write constraints for these restrictions:
c. At most one art activity can be done.
d. No more than two computer activities can be done.
e. If basketball is chosen, then the music must be chosen.
f. At least 120 minutes of activities must be selected.
g. No more than 165 minutes of activities may be selected.
h. To keep the staff happy, the counselor rating should be no higher than 10.
ANSWER:
a. Let xi = 1 if activity i is chosen, 0 if not, for i = 1, ... , 9
b. Max 4x1 + 5x2 + 3x3 + 5x4 + 2x5 + 1x6 + 1x7 + 4x8 + 1x9
c. x1 + x2 + x3 ≤ 1
d. x7 + x8 + x9 ≤ 2
e. x6 ≤ x4
f. 30x1 + 20x2 + 30x3 + 20x4 + 45x5 + 60x6 + 45x7 + 30x8 + 40x9 ≥ 120
g. 30x1 + 20x 2 + 30x3 + 20x4 + 45x5 + 60x6 + 45x7 + 30x8 + 40x9 ≤ 165
h. 2x1 + 2x2 + 1x3 + 5x4 + 1x5 + 3x6 + 1x7 + 3x8 + 2x9 ≤ 10
POINTS: 1
TOPICS: Applications of integer programming
50. Tower Engineering Corporation is considering undertaking several proposed projects for the next fiscal year. The
projects, the number of engineers and the number of support personnel required for each project, and the expected profits
for each project are summarized in the following table:
Project
1 2 3 4 5 6
Engineers Required 20 55 47 38 90 63
Support Personnel Required 15 45 50 40 70 70
Profit ($1,000,000s) 1.0 1.8 2.0 1.5 3.6 2.2
Formulate an integer program that maximizes Tower's profit subject to the following management constraints:
1) Use no more than 175 engineers
2) Use no more than 150 support personnel
3) If either project 6 or project 4 is done, both must be done
4) Project 2 can be done only if project 1 is done
5) If project 5 is done, project 3 must not be done and vice versa
6) No more than three projects are to be done.
ANSWER:
Max P1 + 1.8P2 + 2P3 + 1.5P4 + 3.6P5 + 2.2P6
s.t. 20P1 + 55P2 + 47P 3 + 38P4 + 90P5 + 63P6 ≤ 175
15P1 + 45P2 + 50P3 + 40P4 + 70P5 + 70P6 ≤ 150
P4 − P6 = 0
P1 − P2 ≥ 0
P3 + P5 ≤ 1
P1 + P2 + P3 + P4 + P5 + P6 ≤ 3
Pi = 0 or 1
a. Solve the problem as a linear program ignoring the integer constraints. Show that the optimal
solution to the linear program gives fractional values for both x1 and x2.
b. What is the solution obtained by rounding fractions greater than of equal to 1/2 to the next
larger number? Show that this solution is not a feasible solution.
c. What is the solution obtained by rounding down all fractions? Is it feasible?
d. Enumerate all points in the linear programming feasible region in which both x1 and x2 are
integers, and show that the feasible solution obtained in (c) is not optimal and that in fact the
optimal integer is not obtained by any form of rounding.
ANSWER:
a. From the graph on the next page, the optimal solution to the linear program is x1 = 2.5, x2 = 1.5, z = 10.5.
b. By rounding the optimal solution of x1 = 2.5, x2 = 1.5 to x1 = 3, x2 = 2, this point lies outside the feasible region.
c. By rounding the optimal solution down to x1 = 2, x2 = 1, we see that this solution indeed is an integer solution within
the feasible region, and substituting in the objective function, it gives z = 8.
d. There are eight feasible integer solutions in the linear programming feasible region with z values as follows:
x1 x2 z
1. 0 0 0
2. 1 0 3
3. 2 0 6
4. 3 0 9 optimal
5. 0 1 2
6. 1 1 5
7. 2 1 8 part (c) solution
8. 1 2 7
x1 = 3, x2 = 0 is the optimal solution. Rounding the LP solution (x1 = 2.5, x2 = 1.5) would not have been optimal.
POINTS: 1
TOPICS: Rounding to obtain an integer solution
52. Tom's Tailoring has five idle tailors and four custom garments to make. The estimated time (in hours) it would take
each tailor to make each garment is listed below. (An 'X' in the table indicates an unacceptable tailor-garment
assignment.)
Tailor
Garment 1 2 3 4 5
Wedding gown 19 23 20 21 18
Clown costume 11 14 X 12 10
Admiral's uniform 12 8 11 X 9
Bullfighter's outfit X 20 20 18 21
Formulate and solve an integer program for determining the tailor-garment assignments that minimize the total estimated
time spent making the four garments. No tailor is to be assigned more than one garment and each garment is to be worked
on by only one tailor.
ANSWER: Define the decision variables:
xij = 1 if garment i is assigned to tailor j; = 0 otherwise.
Number of decision variables = [(number of garments)(number of tailors)]
− (number of unacceptable assignments) = [4(5)] − 3 = 17.
Define the objective function:
Minimize total time spent making garments:
MIN 19x11 + 23x12 + 20x13 + 21x14 + 18x15 + 11x21 + 14x22 + 12x24 + 10x25
+ 12x31 + 8x32 + 11x33 + 9x35 + 20x42 + 20x43 + 18x44 + 21x45
Define the constraints:
Exactly one tailor per garment: No more than one garment per tailor:
1) x11 + x12 + x13 + x14 + x15 = 1 5) x11 + x21 + x31 ≤ 1
2) x21 + x22 + x 24 + x25 = 1 6) x12 + x22 + x32 + x42 ≤ 1
3) x31 + x32 + x33 + x35 = 1 7) x13 + x33 + x43 ≤ 1
4) x42 + x43 + x44 + x45 = 1 8) x14 + x24 + x44 ≤ 1
9) x15 + x25 + x35 + x45 ≤ 1
Nonnegativity: xij ≥ 0 for i = 1,..,4 and j = 1,..,5
Cengage Learning Testing, Powered by Cognero Page 16
Chapter 7 - Integer Linear Programming
Optimal Solution:
Assign wedding gown to tailor 5
Assign clown costume to tailor 1
Assign admiral uniform to tailor 2
Assign bullfighter outfit to tailor 4
Total time spent = 55 hours
POINTS: 1
TOPICS: Assignment problem
53. Market Pulse Research has conducted a study for Lucas Furniture on some designs for a new commercial office desk.
Three attributes were found to be most influential in determining which desk is most desirable: number of file drawers,
the presence or absence of pullout writing boards, and simulated wood or solid color finish. Listed below are the part-
worths for each level of each attribute provided by a sample of 7 potential Lucas customers.
File Drawers Pullout Writing Boards Finish
Consumer 0 1 2 Present Absent Simul. Wood Solid Color
1 5 26 20 18 11 17 10
2 18 11 5 12 16 15 26
3 4 16 22 7 13 11 19
4 12 8 4 18 9 22 14
5 19 9 3 4 14 30 19
6 6 15 21 8 17 20 11
7 9 6 3 13 5 16 28
Suppose the overall utility (sum of part-worths) of the current favorite commercial office desk is 50 for each customer.
What is the product design that will maximize the share of choices for the seven sample participants? Formulate and
solve, using Lindo or Excel, this 0 - 1 integer programming problem.
ANSWER: Define the decision variables:
There are 7 lij decision variables, one for each level of attribute.
lij = 1 if Lucas chooses level i for attribute j; 0 otherwise.
There are 7 Yk decision variables, one for each consumer in the sample.
Yk = 1 if consumer k chooses the Lucas brand, 0 otherwise.
Define the objective function:
Maximize the number of consumers preferring the Lucas brand desk.
Max Y1 + Y2 + Y3 + Y4 + Y5 + Y6 + Y7
Define the constraints:
There is one constraint for each consumer in the sample.
5l11 + 26l21 + 20l31 + 18l12 + 11l22 + 17l13 + 10l23 − 50Y1 ≥ 1
18l11 + 11l21 + 5l31 + 12l12 + 16l22 + 15l13 + 26l23 − 50Y2 ≥ 1
4l11 + 16l21 + 22l31 + 7l12 + 13l22 + 11l13 + 19l23 − 50Y3 ≥ 1
12l11 + 8l21 + 4l31 + 18l12 + 9l22 + 22l13 + 14l23 − 50Y4 ≥ 1
19l11 + 9l21 + 3l31 + 4l12 + 14l22 + 30l13 + 19l23 − 50Y5 ≥ 1
6l11 + 15l21 + 21l31 + 8l12 + 17l22 + 20l13 + 11l23 − 50Y6 ≥ 1
9l11 + 6l21 + 3l31 + 13l12 + 5l22 + 16l13 + 28l23 − 50Y7 ≥ 1
There is one constraint for each attribute.
l11 + l21 + l31 = 1
l12 + l22 = 1
l13 + l23 = 1
Participant 1 (Y1 = 1)
Participant 5 (Y5 = 1)
Participant 6 (Y6 = 1)
POINTS: 1
TOPICS: Product design and market share optimization
54. Kloos Industries has projected the availability of capital over each of the next three years to be $850,000, $1,000,000,
and $1,200,000, respectively. It is considering four options for the disposition of the capital:
(1) Research and development of a promising new product
(2) Plant expansion
(3) Modernization of its current facilities
(4) Investment in a valuable piece of nearby real estate
Monies not invested in these projects in a given year will NOT be available for following year's investment in the projects.
The expected benefits three years hence from each of the four projects and the yearly capital outlays of the four options
are summarized in the table below in $1,000,000's.
In addition, Kloos has decided to undertake exactly two of the projects, and if plant expansion is selected, it will also
modernize its current facilities.
Capital Outlay
Projected
Options Year 1 Year 2 Year 3
Benefits
New Product R&D .35 .55 .75 5.2
Plant Expansion .50 .50 0 3.6
Modernization .35 .40 .45 3.2
Real Estate .50 0 0 2.8
Formulate and solve this problem as a binary programming problem.
ANSWER:
Max 5.2X1 + 3.6X2 + 3.2X3 + 2.8X4
s.t. .35X1 + .50X2 + .35X3 + .50X4 ≤ 0.85 (First Year)
.55X1 + .50X2 + .40X3 ≤ 1.00 (Second Year)
.75X 1 + .45X3 ≤ 1.20 (Third Year)
X1 + X2 + X3 + X4 = 2
X2 + X3 ≥0
Xi = 0 or 1
56. A business manager for a grain distributor is asked to decide how many containers of each of two grains to purchase to
fill its 1,600 pound capacity warehouse. The table below summarizes the container size, availability, and expected profit
per container upon distribution.
Container Containers Container
Grain Size Available Profit
A 500 lbs. 3 $1,200
B 600 lbs. 2 $1,500
a. Formulate as a linear program with the decision variables representing the number of containers purchased of each
grain. Solve for the optimal solution.
b. What would be the optimal solution if you were not allowed to purchase fractional containers?
c. There are three possible results from rounding an LP solution to obtain an integer solution:
(1) the rounded optimal LP solution will be the optimal IP solution;
(2) the rounded optimal LP solution gives a feasible, but not optimal IP solution;
(3) the rounded optimal LP solution is an infeasible IP solution.
For this problem (i) round down all fractions; (ii) round up all fractions; (iii) round off (to the nearest integer) all fractions
(NOTE: Two of these are equivalent.) Which result above (1, 2, or 3) occurred under each rounding method?
ANSWER:
a. 4/5 container of Grain A, 2 containers of Grain B, $3960
b. 2 containers of Grain A, 1 container of Grain B, $3900
c. (i) Round down all fractions: For (0,2) the result is (feasible but not optimal)
(ii) Round up all fractions: For (1,2) the result is (infeasible)
(iii) Round off all fractions: For (1,2) the result is (infeasible)
POINTS: 1
57.
Given the following all-integer linear programming problem:
s. t. 2x1 + x2 < 5
x1 + 6x2 < 9
x 1 - x2 > 2
x1, x2 > 0 and integer
Essay
58. The use of integer variables creates additional restrictions but provides additional flexibility. Explain.
ANSWER: Answer not provided.
POINTS: 1
TOPICS: Introduction
60. Give a verbal interpretation of each of these constraints in the context of a capital budgeting problem.
a. x1 − x2 ≥ 0
b. x1 − x2 = 0
c. x1 + x2 + x3 ≤ 2
ANSWER: Answer not provided.
POINTS: 1
TOPICS: Captial budgeting
61. Explain how integer and 0-1 variables can be used in an objective function to minimize the sum of fixed and variable
costs for production on two machines.
ANSWER: Answer not provided.
POINTS: 1
TOPICS: Distribution system design
63. List and explain four types of constraints involving 0-1 integer variables only.
ANSWER: Answer not provided.
POINTS: 1
TOPICS: Modeling flexibility provided by 0-1 integer variables
Provisions
Salt Beef 400 gr. per man per day
Chocolate 250 gr. „
Biscuits 125 gr. „
Dried milk 100 gr. „
Malted milk 125 gr. „
Total 1000 gr. kg.
Rucksack
1 change, diary, compass, matches tinder, housewife, snow
glasses, cup & spoon, pipe & tobacco, linen thread, sail-cloth gloves, 1
pr. ski-shoes, 1 long knife, 1 pr. skis, 2 staves, 1 pole, 1 sleeping-bag
* * * * *
On the 29th of April the “Fram” attempted to go to Green Harbour
to fetch and take the mail. However, she did not get far before the ice
stopped her. By dinner time the next day she had returned.
Ellsworth and I now went every day to the wireless station in order
to take the time signal from the Eiffel Tower so that we might check our
watches. We had each three watches for use on the flight. Fortunately
they never went wrong. We checked the time signals for fourteen days
before our departure and thus we were absolutely certain of the
correctness of our watches.
On the 4th of May, a strange restless and unsettling sort of day, we
began to long for the moment when we could leave. The
meteorologists announced that that particular morning would be a fine
opportunity to go and we were not long in replying, “All is ready.”
“Fram” and “Hobby” got orders to make ready to sail northwards and
all hands were called on deck to help to get everything in order. In the
meantime a northeasterly wind sprang up and retarded the mechanics
from completing the final little “finishing-off” touches. We were
therefore compelled to put off our intended start until the weather
improved. In the meantime the boats made ready and on the next
evening—May 5th—“Fram” and “Hobby” steered northwards in order
to reconnoiter round the Danske Öen to see if they could find a good
place for us to start off from on the ice. That evening we had -18° c. No
work could be done. On the 6th we received a wireless from the
“Fram” from South Gate which announced that the weather was very
uncertain and that we ought to wait. They announced also that they
had found no suitable starting place on the ice. The ice all around was
uneven and banked up and consequently useless for our purpose.
After the machines were ready to start we saw clearly that the
maximum weight of 2,600 kg., which the factory said we could carry,
was going to be considerably increased. We could see that if we had
to make the flight we must at least carry 3,000 kg.—perhaps more.
The two, Riiser-Larsen and Dietrichson, thought that it would be quite
possible to rise with this from the ice. Director Schulte-Frohlinde
doubted the possibility of this. The two former, however, had great
experience in rising from the ice and my trust in them was complete.
To rise from the water with this weight would hardly have been
possible. On the eighth evening “Hobby” came back announcing that
the ice conditions were bad, the weather was stormy and the
temperature as low as -23° c.
We decided, therefore, to wait some time hoping for an
improvement in the weather and a more reasonable temperature.
On the 9th N 25 left its “cradle” on Spitzbergen for the first time
and made a few trial runs on the ice. Everything went well and the pilot
was very satisfied. On the morning of the 11th “Fram” returned, thus
finishing this part. Now we were all ready to make use of the first
opportunity which the meteorologists should advise. The temperature
rose quickly and steadily and in the days that followed it was quite
clear that spring was coming.
The 17th of May dawned and was spent exactly as it should have
been. A salute in the morning, Olympic games, and a gala dinner in
the evening in the “salon.” On the 18th Dr. Bjerknes announced that
the prospects were so good that we should hold ourselves ready for a
flight at short notice. We were ready. The weather on the 19th was still
not exactly as the prophet wished it to be. In the meantime, however,
we made “all clear” and got the machines down to a definite starting
place where one could slide down a grade direct on to the fjord ice.
Local bad weather on the 20th prevented us from starting. The filling of
the petrol tanks was finished and by eventide we were absolutely
ready.
As I, on the morning of the 20th of May, stuck my nose out of the
window I realized at once, without further confirmation from our
weather prophets, that our day had arrived. It was brilliant summer
weather with a tiny breeze blowing from the fjord, exactly what the pilot
wished for. The starting time was fixed for four p.m. The sun was in a
favorable position for our sun compass and gave us the greatest aid
on our flight. Even at breakfast time we could notice that there was a
little excitement in the camp. Many of the members of the expedition,
who otherwise would still have been invisible during the time I usually
took my breakfast, had in this case already breakfasted and
disappeared. It was unnecessary to send a messenger round to say
the day had arrived. Every one was making his preparations for
departure and the different members could be seen with hands full of
private belongings disappear beside the machines and return empty-
handed. Each of these little journeys brought more weight and by the
time the last pin was fastened we were carrying a load of 3,100 kg., or
about 500 kg. more than we were supposed to carry. Director
Frohlinde had always insisted in his opinion that we ought to make
some trial trips. The airmen said, “No.” As the differences of opinions
will be disentangled later on I shall not say more about this here. All
the morning a crowd of people were crossing over to the starting place.
Everybody who could be there was on the spot. Dinner was taken in
the “salon” and if some one had come in by chance he would have
noticed something unusual going on. The only guests we had in the
“salon” were six Thermos flasks, set up ready for the road. These
contained chocolate; beside them were our only provisions for the
flight, and the box of Mrs. Clausen’s good oatcakes. The only person
who disturbed the dinner’s quiet and friendly course was the steward,
who thought he ought to wish his comrades a good journey and thank
them for assembling there. Thus was the last dinner at an end and the
“salon” again took on its old form as the Coal Company’s sailboat
works. “Sic transit gloria mundi.”
As I left my good and comfortable quarters in the house of the
Director, his good-natured housekeeper Berta stood there with two
packets, which she held out to me. “There is one for each machine,”
she said. “Just a little ‘snack’ for the journey.” Oh, Berta, could you but
see how gladly and with what warm thanks in our hearts we took the
delicious sandwiches and eggs carefully and slowly from the
packages, eating them with pleasure, as our last civilized meal for a
long time to come,—you would certainly be overjoyed!
At three o’clock in the afternoon we were all gathered beside the
machines. As I have already remarked—one is never ready. Director
Frohlinde went round and looked carefully at everything. Green, the
Rolls-Royce mechanic, listened first to the one and then to the other of
the motors. At four o’clock all four motors were warming up. It was a
sign for all of us that our hour was almost there. Both sun compasses,
which had been set at four o’clock, started going—and the motors
started humming. Whilst we put on our heavy flying clothes the two
flying men and observers did likewise, wearing similar garments—thick
underclothes of wool with leather on top. The point which I personally
had always been afraid of during a flight was the condition of my legs.
The tremendous speed, which necessarily causes a strong draught
and lowers the temperature, puts our shoes naturally to a very strong
test. It was not often that my experience proved of actual use to me,
but this time I really did get some good out of it. On my earlier journeys
it had often been necessary for me to stand hour after hour as
observer. When the temperature was below -50° c. and -60° c., which
often happened, one must have very special footwear. I found out then
that one ought to have good warm footwear on, preferably loose
leather stockings and leather shoes (such as the Eskimos wear), and
in addition to this the feet should be put into enormous canvas shoes
filled with senna grass, which forms a complete lining to the shoes and
renders protection to the feet. That time years ago we had taken no
Eskimo shoes, but used felt shoes with a pair of thin stockings and
above these we wore gigantic canvas shoes filled with large quantities
of senna grass. The result was brilliant. Not only did we not freeze, but
one or two grumbled because they were too warm. The pilots wore
thick leather gloves which gave complete protection to their hands.
Personally I wore only an old pair of woolen gloves as I had to write
continually. The mechanics were not so heavily clad, as they were
continually on the move, passing between the petrol store and the
motor, and for this reason they had to be lightly clad. As soon as we
were dressed the various members took their places. Ellsworth and I
were in the observation seats. Riiser-Larsen and Dietrichson were in
the pilots’ seats and the two mechanics, Feucht and Omdal, were
beside the motors. My place was in the observation seat of N 25,
which lay forward. In the seat behind me—the pilot’s seat—was Riiser-
Larsen and in the petrol store behind him was Feucht. In N 24 the
arrangements were the same for Ellsworth, Dietrichson, Omdal.
Feucht, who had accompanied Director Schulte-Frohlinde from Pisa,
was only taken on as a member of the expedition a few days before
the start; he had up to that time remained in the Factory’s service. He
is a German by birth and had been employed by the Factory for a long
time, being considered an exceptionally capable mechanic which will