Download as pdf or txt
Download as pdf or txt
You are on page 1of 73

Quantitative Analysis For Management

13th Edition Render Test Bank


Go to download the full and correct content document:
https://testbankfan.com/product/quantitative-analysis-for-management-13th-edition-re
nder-test-bank/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Quantitative Analysis For Management 13th Edition


Render Solutions Manual

https://testbankfan.com/product/quantitative-analysis-for-
management-13th-edition-render-solutions-manual/

Quantitative Analysis for Management Global 13th


Edition Render Solutions Manual

https://testbankfan.com/product/quantitative-analysis-for-
management-global-13th-edition-render-solutions-manual/

Quantitative Analysis For Management 11th Edition


Render Test Bank

https://testbankfan.com/product/quantitative-analysis-for-
management-11th-edition-render-test-bank/

Quantitative Analysis for Management 12th Edition


Render Test Bank

https://testbankfan.com/product/quantitative-analysis-for-
management-12th-edition-render-test-bank/
Quantitative Analysis for Management 12th Edition
Render Solutions Manual

https://testbankfan.com/product/quantitative-analysis-for-
management-12th-edition-render-solutions-manual/

Quantitative Analysis For Management 11th Edition


Render Solutions Manual

https://testbankfan.com/product/quantitative-analysis-for-
management-11th-edition-render-solutions-manual/

Quantitative Methods for Business 13th Edition Anderson


Test Bank

https://testbankfan.com/product/quantitative-methods-for-
business-13th-edition-anderson-test-bank/

Introduction to Management Science Quantitative 13th


Edition Anderson Test Bank

https://testbankfan.com/product/introduction-to-management-
science-quantitative-13th-edition-anderson-test-bank/

Quantitative Methods for Business 13th Edition Anderson


Solutions Manual

https://testbankfan.com/product/quantitative-methods-for-
business-13th-edition-anderson-solutions-manual/
Quantitative Analysis for Management, 13e (Render et al.)
Chapter 10 Integer Programming, Goal Programming, and Nonlinear Programming

1) If conditions require that all decision variables must have an integer solution, then the class of
problem described is an integer programming problem.
Answer: TRUE
Diff: Easy
Topic: INTRODUCTION
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

2) An integer programming solution can never produce a greater profit objective than the LP
solution to the same problem.
Answer: TRUE
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

3) 0-1 integer programming might be applicable to selecting the best gymnastics team to
represent a country from among all identified teams.
Answer: TRUE
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept

4) Nonlinear programming is the case in which objectives and/or constraints are nonlinear.
Answer: TRUE
Diff: Easy
Topic: INTRODUCTION
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

5) The following objective function is nonlinear: Max 5X + (1/8)Y - Z.


Answer: FALSE
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept
6) In goal programming, if all the goals are achieved, then the value of the objective function
will always be zero.
Answer: TRUE
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

7) Unfortunately, multiple goals in goal programming are not able to be prioritized and solved.
Answer: FALSE
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

8) The following objective function is nonlinear: Max 5X - 8YZ.


Answer: TRUE
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept

9) Goal programming permits multiple objectives to be satisfied.


Answer: TRUE
Diff: Easy
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

10) The constraint X1 + X2 ≤ 1 with 0 -1 integer programming allows for either X1 or X2 to be a


part of the optimal solution, but not both.
Answer: TRUE
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept
11) Requiring an integer solution to a linear programming problem decreases the size of the
feasible region.
Answer: TRUE
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

12) The transportation problem is a good example of a pure integer programming problem.
Answer: TRUE
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

13) The three types of integer programs are: pure integer programming, impure integer
programming, and 0-1 integer programming.
Answer: FALSE
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

14) When solving very large integer programming problems, we sometimes have to settle for a
"good," not necessarily optimal, answer.
Answer: TRUE
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

15) Quadratic programming contains squared terms in the constraints.


Answer: FALSE
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept
16) In goal programming, our goal is to drive the deviational variables in the objective function
as close to zero as possible.
Answer: TRUE
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

17) There is no general method for solving all nonlinear problems.


Answer: TRUE
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept

18) A 0-1 programming representation could be used to assign sections of a course to specific
classrooms.
Answer: TRUE
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept

19) In goal programming, the deviational variables have the same objective function coefficients
as the surplus and slack variables in a normal linear program.
Answer: FALSE
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

20) Unfortunately, goal programming, while able to handle multiple objectives, is unable to
prioritize these objectives.
Answer: FALSE
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept
21) The constraint X1 - X2 ≤ 0 with 0 -1 integer programming allows for X1 to be selected as
part of the optimal solution only if X2 is selected to be a part of the optimal solution, but not
both.
Answer: FALSE
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept

22) The constraint X1 - X2 = 0 with 0 -1 integer programming allows for either both X1 and X2
to be selected to be a part of the optimal solution, or for neither to be selected.
Answer: TRUE
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept

23) The constraint X1 + X2 + X3+ X4 ≤ 2 with 0 -1 integer programming allows at most two of
the items X1, X2, X3, and X4 to be selected to be a part of the optimal solution.
Answer: TRUE
Diff: Easy
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept

24) The following objective function is nonlinear: Max 5X + X/Y - Z.


Answer: TRUE
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept

25) The global optimum point may be superior to nearby points, but the local optimum point is
the true optimal solution-n to a nonlinear programming problem.
Answer: FALSE
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept
26) A model containing a linear objective function and linear constraints but requiring that one
or more of the decision variables take on an integer value in the final solution is called
A) a goal programming problem.
B) an integer programming problem.
C) a nonlinear programming problem.
D) a multiple objective LP problem.
Answer: B
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

27) Assignment problems solved previously by linear programming techniques are also
examples of
A) pure-integer programming problems.
B) mixed-integer programming problems.
C) zero-one integer programming problems.
D) goal programming problems.
Answer: C
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept

28) A mathematical programming model that permits decision makers to set and prioritize
multiple objective functions is called a
A) pure-integer programming problem.
B) mixed-integer programming problem.
C) zero-one integer programming problem.
D) goal programming problem.
Answer: D
Diff: Easy
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept
29) Goal programming differs from linear programming in which of the following aspects?
A) It tries to maximize deviations between set goals and what can be achieved within the
constraints.
B) It minimizes instead of maximizing as in LP.
C) It permits multiple goals to be combined into one objective function.
D) It maximizes instead of minimizing as in LP.
Answer: C
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

30) Which of the following is a category of mathematical programming techniques that doesn't
assume linearity in the objective function and/or constraints?
A) integer programs
B) goal programming problems
C) nonlinear programs
D) multiple objective programming problems
Answer: C
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept

31) Which of the following functions is nonlinear?


A) 4X + 2Y + 7Z
B) -4X + 2Y
C) 4X + (1/2)Y + 7Z
D) 4X/Y + 7Z
Answer: D
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept
32) Goal programming is characterized by
A) all maximization problems.
B) setting of lower and upper bounds.
C) the deviation from a high-priority goal must be minimized before the next-highest-priority
goal may be considered.
D) deviation from certainty.
Answer: C
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

33) An integer programming (maximization) problem was first solved as a linear programming
problem, and the objective function value (profit) was $253.67. The two decision variables (X,
Y) in the problem had values of X = 12.45 and Y = 32.75. If there is a single optimal solution,
which of the following must be true for the optimal integer solution to this problem?
A) X = 12 Y = 32
B) X = 12 Y = 33
C) The objective function value must be less than $253.67.
D) The objective function value will be greater than $253.67.
Answer: C
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Application

34) An integer programming (minimization) problem was first solved as a linear programming
problem, and the objective function value (cost) was $253.67. The two decision variables (X, Y)
in the problem had values of X = 12.45 and Y = 32.75. If there is a single optimal solution,
which of the following must be true for the optimal integer solution to this problem?
A) X = 13 Y = 33
B) X = 12 Y = 32
C) The objective function value must be less than $253.67.
D) The objective function value will be greater than $253.67.
Answer: D
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Application
35) In a goal programming problem with two goals at the same priority level, all the deviational
variables are equal to zero in the optimal solution. This means
A) there is no feasible solution to the problem.
B) all goals are fully achieved.
C) nonlinear programming must be used to solve this.
D) this problem was an integer programming problem.
Answer: B
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

36) A goal programming problem had two goals (with no priorities assigned). Goal number 1
was to achieve a profit of $2,400 and goal number 2 was to have no idle time for workers in the
factory. The optimal solution to this problem resulted in a profit of $2,300 and no idle time.
What was the value for the objective function for this goal programming problem?
A) 2300
B) 100
C) -100
D) 0
Answer: B
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

37) A goal programming problem had two goals (with no priorities assigned). Goal number 1
was to achieve a profit of $3,600 and goal number 2 was to have no wasted material. The optimal
solution to this problem resulted in a profit of $3,300 and no wasted material. What was the
value for the objective function for this goal programming problem?
A) 300
B) -300
C) 3300
D) 0
Answer: A
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
38) In an integer programming problem, if it is desired to have variable X be exactly twice the
value of variable Y, the constraint would be written
A) 2X + Y = 0.
B) X + 2Y = 0.
C) 2X - Y = 0.
D) X - 2Y = 0.
Answer: D
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application

Table 10-1

A company has decided to use 0-1 integer programming to help make some investment
decisions. There are three possible investment alternatives from which to choose, but if it is
decided that a particular alternative is to be selected, the entire cost of that alternative will be
incurred (i.e., it is impossible to build one-half of a factory). The integer programming model is
as follows:

Maximize 5000 X1 + 7000X2 + 9000X3


Subject to: X1 + X2 + X3 ≤ 2 (only 2 may be chosen)
25000X1 + 32000X2 + 29000X3 ≤ 62,000 (budget limit)
16 X1 + 14 X2 + 19 X3 ≤ 36 (resource limitation)
all variables = 0 or 1

where X1 = 1 if alternative 1 is selected, 0 otherwise


X2 = 1 if alternative 2 is selected, 0 otherwise
X3 = 1 if alternative 3 is selected, 0 otherwise

The optimal solution is X1 = 0, X2 = 1, X3 = 1

39) According to Table 10-1, which presents an integer programming problem, if the optimal
solution is used, what would the value of the objective function be?
A) 21,000
B) 12,000
C) 16,000
D) 2
Answer: C
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application
40) According to Table 10-1, which presents an integer programming problem, if the optimal
solution is used, how much of the budget would be spent?
A) $32,000
B) $29,000
C) $61,000
D) $62,000
Answer: C
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application

41) In Table 10-1, which presents an integer programming problem, using the optimal solution
means only two of the alternatives would be selected. How much slack is there in the third
constraint?
A) 0
B) 3
C) 33
D) 36
Answer: B
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application

42) According to Table 10-1, which presents an integer programming problem, the optimal
solution is to select only two of the alternatives. Suppose you wished to add a constraint that
stipulated that alternative 2 could only be selected if alternative 1 is also selected (i.e., if
alternative 1 is not selected, you may not select alternative 2; however, you may select #1 and
not select #2). How would this constraint be written?
A) X1 = X2
B) X1 ≤ X2
C) X1 ≥ X2
D) X1 + X2 = 2
Answer: C
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application
Table 10-2

Maximize Z = 34 X1 + 43 X2 + 29 X3
Subject to: 5 X1 + 4 X2 + 7 X3 ≤ 50
1 X1 + 2 X2 + 2 X3 ≤ 16
3 X1 + 4 X2 + 1 X3 ≤ 9
all Xi are integer and non-negative

Final Integer Solution: Z = 208

Decision
Variable Solution
X1 1
X2 0
X3 6

43) According to Table 10-2, which presents a solution for an integer programming problem, at
the optimal solution, how much slack exists in the third constraint?
A) 0
B) 9
C) 5
D) 6
Answer: A
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Application

44) We do not have a general method for solving all types of ________ problems.
A) mixed-integer programming
B) 0-1 integer programming
C) goal programming
D) nonlinear programming
Answer: D
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept
45) A capital budgeting problem involving the selection of possible projects under budget
constraints is solved by which of the following?
A) mixed-integer programming
B) 0-1 integer programming
C) goal programming
D) nonlinear programming
Answer: B
Diff: Easy
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept

46) A transportation problem is an example of


A) a pure-integer programming problem.
B) a mixed-integer programming problem.
C) a zero-one integer programming problem.
D) a goal programming problem.
Answer: A
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

47) If we wish to develop a stock portfolio wherein we maximize return and minimize risk, we
would have to use
A) pure-integer programming.
B) goal programming.
C) zero-one integer programming.
D) mixed-integer programming.
Answer: B
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept
48) Another name for a 0-1 variable is a(n) ________ variable.
A) either-or
B) binary
C) yes-no
D) quadratic
Answer: B
Diff: Easy
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept

49) Terms that are minimized in goal programming are called


A) deviational variables.
B) global variables.
C) decision variables.
D) minimization variables.
Answer: A
Diff: Easy
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

50) The concept of a local optimum is affiliated with which of the following?
A) mixed integer programming
B) integer programming
C) linear programming
D) nonlinear programming
Answer: D
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept

51) The concept of "satisficing" is affiliated with which of the following?


A) mixed integer programming
B) integer programming
C) nonlinear programming
D) goal programming
Answer: D
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

52) The following


Maximize: 7X1 + 3X2
Subject to: 5X1 + 7X2 ≤ 27
4X1 + X2 ≤ 14
3X1 - 2X2 ≤ 9
X1, X2 ≥ 0
X1 integer
represents a:
A) goal programming problem.
B) mixed integer programming problem.
C) nonlinear programming problem.
D) 0-1 integer programming problem.
Answer: B
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

53) As part of a larger problem, you are trying to determine whether or not to open a plant with a
capacity of 10,000 units (using binary variable Y). You also define X as the number of units (if
any) produced at that plant. How will you ensure that Y will equal 1 if the plant is open?
A) Y ≥ X
B) Y ≤ X
C) X = 10000Y
D) X ≤ 10000Y
Answer: D
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application

54) Which of the following is not considered nonlinear programming?


A) nonlinear objective and nonlinear constraints
B) nonlinear objective with linear constraints
C) binary decision variable with nonlinear constraints
D) integer decision variable with linear constraints
Answer: D
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept

55) A quadratic programming problem involves which of the following conditions?


A) squared terms in the objective function and linear constraints
B) linear objective function and squared terms in the constraints
C) squared terms in both the objective function and constraints
D) a strictly goal programming problem with squared terms in the objective function
Answer: A
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept

56) Which of the following statements is false concerning goal programming?


A) The objective function is the main difference between linear programming and goal
programming.
B) The objective in goal programming is to minimize deviational variables.
C) Deviational variables are zero if a goal is completely obtained.
D) It is not possible for two goals to have equal priority.
Answer: D
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

57) Consider the following 0-1 integer programming problem:

Minimize 20X + 36Y +24Z


Subject to: 2X + 4Y + 3Z ≥ 7
12X + 8Y + 10Z ≥ 25
X, Y, Z must be 0 or 1

If we wish to add the constraint that no more than two of these variables must be positive, how
would this be written?
A) 2X + 2Y + 2Z ≤ 3
B) X + Y + Z ≤ 2
C) X ≤ 2, and Y ≤ 2, and Z ≤ 2
D) X, Y, Z ≤ 2
Answer: B
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application
58) Consider the following 0-1 integer programming problem:

Minimize 20X + 36Y + 24Z


Subject to: 2X + 4Y + 3Z ≥ 7
12X + 8Y + 10Z ≥ 25
X, Y, Z must be 0 or 1

If we wish to add the constraint that X must be positive, and that only Y or Z, but not both, can
be positive, how would the additional constraint(s) be written?
A) X + Y + Z ≤ 3, Y + Z ≤ 1
B) X ≤ 1, Y + Z = 1
C) X ≤ 2, and Y ≤ 2, and Z ≤ 2
D) X = 1, Y + Z ≤ 1
Answer: D
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application

59) The overall best solution in a nonlinear program is a


A) global optimum.
B) local optimum.
C) binary optimum.
D) nonlinear optimum.
Answer: A
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept

60) A goal programming problem had two goals (with no priorities assigned). Goal number 1
was to achieve a cost of $2,400 and goal number 2 was to have no idle time for workers in the
factory. The optimal solution to this problem resulted in a cost of $2,400 and no idle time. What
was the value for the objective function for this goal programming problem?
A) 2300
B) 100
C) -100
D) 0
Answer: D
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

61) A goal programming problem had two goals (with no priorities assigned). Goal number 1
was to achieve a cost of $3,600 and goal number 2 was to have no wasted material. The optimal
solution to this problem resulted in a cost of $3,900 and no wasted material. What was the value
for the objective function for this goal programming problem?
A) 300
B) -300
C) 3300
D) 0
Answer: A
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

Table 10-3

A company has decided to use 0−1 integer programming to help make some investment
decisions. There are three possible investment alternatives from which to choose, but if it is
decided that a particular alternative is to be selected, the entire cost of that alternative will be
incurred (i.e., it is impossible to build one-half of a factory). The integer programming model is
as follows:

Maximize 5000 X1 + 7000X2 + 9000X3


Subject to: X1 + X2 + X3 ≤ 2 Constraint 1
-X1 + X2 ≤ 0 Constraint 2
25,000 X1 + 32,000 X2 + 29,000 X3 ≤ 62,000 (budget limit)
16 X1 + 14 X2 + 19 X3 ≤ 36 (resource limitation)
all variables = 0 or 1

where X1 = 1 if alternative 1 is selected, 0 otherwise


X2 = 1 if alternative 2 is selected, 0 otherwise
X3 = 1 if alternative 3 is selected, 0 otherwise

Solution x1 = 1, x2 = 0, x3 = 1, objective value = 14,000.

62) Table 10-3 presents an integer programming problem. What is the meaning of Constraint 1?
A) If X1 is selected, X2 must also be selected.
B) No more than two alternatives may be selected.
C) At least two alternatives must be selected.
D) If X2 is selected, X1 must also be selected.
Answer: B
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application

63) Table 10-3 presents an integer programming problem. What is the meaning of Constraint 2?
A) Both alternatives 1 and 2 must be selected.
B) If alternative 2 is selected, alternative 1 must also be selected.
C) Either alternative 1 or alternative 2 must be selected.
D) No more than one alternative may be selected.
Answer: B
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application

64) Table 10-3 presents an integer programming problem. If the optimal solution is used, then
only two of the alternatives would be selected. How much slack would there be in the third
constraint?
A) 1000
B) 5000
C) 3300
D) 8000
Answer: D
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application

65) Table 10-3 presents an integer programming problem. Suppose you wish to add a constraint
that stipulates that both alternative 2 and alternative 3 must be selected, or neither can be
selected. How would this constraint be written?
A) X2 = X3
B) X2 ≤ X3
C) X2 ≥ X3
D) X2 + X3 = 1
Answer: A
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application
Table 10-4

Minimize Z = P1 d1+ + P1 d1- + P1 d2+ + P1 d2- + P1 d3+ + P1 d3-


Subject to: 4 X1 + 3 X2 + 5 X3 + d1- - d1+ = 240
24 X1 + 30 X2 + 32 X3 + d2- - d2+ = 1500
1 X1 + 2 X2 + X3 + d3- - d3+ = 50

Optimal Solution Data:


Decision Solution
Variable Value Goal d+ d- Priority Non-achievement
X1 12.5 1 0 2.5 P1 2.5
X2 0 2 0 0 P1
X3 37.5 3 0 0 P1

66) Table 10-4 represents a solution to a goal programming problem. There are three goals (each
represented by a constraint). Which goals are only partly achieved?
A) number 1 only
B) number 1 and number 2
C) number 2 and number 3
D) number 1 and number 3
Answer: A
Diff: Easy
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

67) Table 10-4 represents a solution to a goal programming problem. There are three goals (each
represented by a constraint). Goal number 3 represents a resource usage goal. How much of this
resource would be used by this solution?
A) 50 units
B) 70 units
C) 2500 units
D) 240 units
Answer: A
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
68) Table 10-4 represents a solution to a goal programming problem. There are three goals (each
represented by a constraint). Which of the goals is assigned the highest priority?
A) goal 1
B) goal 2
C) goal 3
D) All goals have the same priority.
Answer: D
Diff: Easy
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

Table 10-5

Maximize Z = 34 X1 + 43 X2 + 29 X3
Subject to: 5 X1 + 4 X2 + 7 X3 ≤ 50
1 X1 + 2 X2 + 2 X3 ≤ 16
3 X1 + 4 X2 + 1 X3 ≤ 9
all Xi are integer and non-negative

Final Integer Solution: Z = 208

Decision
Variable Solution
X1 1
X2 0
X3 6

69) Table 10-5 represents a solution for an integer programming problem. If this problem had
been solved as a simple linear programming problem, what would you expect the value of the
objective function to be?
A) less than 208
B) greater than 208
C) less than 104
D) greater than 416
Answer: B
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Application
70) Table 10-5 represents a solution for an integer programming problem. If one uses the optimal
solution presented, how much slack is there in the first equation?
A) 0 units
B) 5 units
C) 3 units
D) 2 units
Answer: C
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Application

71) A model containing a linear objective function and requiring that one or more of the decision
variables take on an integer value in the final solution is called
A) an integer programming problem.
B) a nonlinear programming problem.
C) a multiple objective LP problem.
D) mixed integer program.
Answer: D
Diff: Moderate
Topic: INTRODUCTION
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

Table 10-6

The profit function for a set of two electronics products can be expressed by the following
expression: - 2X1 - 3X2 + 2 where X1 = the number of product 1 units produced and X2

= the number of product 2 units produced. At least 10 units of X1 must be produced and at least
20 units of X2 must be produced. No more than 50 units total can be produced.

72) What type of mathematical programming model is required for the problem described in
Table 10-6?
A) an integer programming model
B) a goal programming model
C) a nonlinear programming model
D) a zero-one integer programming model
Answer: C
Diff: Easy
Topic: VARIOUS
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

73) According to Table 10-6, how is the constraint expressed that no more than 50 units can be
produced?
A) X1 + X2 ≥ 50
B) X1 + X2 ≤ 50
C) X12 + X22 ≥ 50
D) X12 + X22 ≤ 50
Answer: B
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

74) What is the optimal solution to the problem described in Table 10-6?
A) X1 = 50; X2 = 0
B) X1 = 30; X2 = 20
C) X1 = 20; X2 = 30
D) X1 = 25; X2 = 25
Answer: C
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

75) A goal programming problem had two goals (with no priorities assigned). Goal number 1
was to achieve a cost of $3,600 and goal number 2 was to complete the task in 400 hours or
fewer. The optimal solution to this problem resulted in a cost of $3,600 and a completion time of
420 hours. What was the value for the objective function for this goal programming problem?
A) 400
B) -400
C) 20
D) 0
Answer: C
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
76) Agile Bikes has manufacturing plants in Salt Lake City, Dallas, and Chicago. The bikes are
shipped to retail stores in Los Angeles, New York, Miami, and Seattle. Information on shipping
costs, supply, and demand is given in the following table:

To
From Los Angeles New York Miami Seattle Supply
Salt Lake
City $50 $150 $200 $75 1500
Dallas $100 $75 $75 $150 1200
Chicago $100 $75 $100 $150 1400
Demand 900 1200 900 800

What type of mathematical programming is required to solve this problem?


A) linear programming
B) integer programming
C) mixed-integer programming
D) zero-one integer programming
Answer: D
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Concept

77) Agile Bikes has manufacturing plants in Salt Lake City, Dallas, and Chicago. The bikes are
shipped to retail stores in Los Angeles, New York, Miami, and Seattle. Information on shipping
costs, supply, and demand is given in the following table:

To
From Los Angeles New York Miami Seattle Supply
Salt Lake
City $50 $150 $200 $75 1500
Dallas $100 $75 $75 $150 1200
Chicago $100 $75 $100 $150 1400
Demand 900 1200 900 800

Where should Los Angeles receive their bicycles from?


A) Salt Lake City and Chicago
B) Salt Lake City and Dallas
C) Chicago and Dallas
D) Dallas
Answer: A
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application
Table 10-7

The Elastic Firm has two products coming on the market: Zigs and Zags. To make a Zig, the firm
needs 10 units of product A and 15 units of product B. To make a Zag, they need 20 units of
product A and 30 units of product B. There are only 2,000 units of product A and 3,200 units of
product B available to the firm. The profit on a Zig is $4 and on a Zag it is $6. Management
objectives in order of their priority are:
Produce exactly 50 Zigs.
Achieve a target profit of at least $750.
Use all of the product B available.

Let X1 = number of Zigs, X2 = number of Zags.


d1- = underachievement of Zig goal
d1+ = overachievement of Zig goal
d2- = underachievement of profit target
d2+ = overachievement of profit target
d3- = unused product B
d3+ = additional amount of product B needed

78) In the goal programming problem described in Table 10-7, what is the objective function?
A) Min: P1d1- + P1d1+ + P2d2+ + P2d2- + P3d3- + P3d3+
B) Min: P1d1- + P1d1+ + P2d2+ + P3d3+
C) Min: P1d1- + P1d1+ + P2d2- + P3d3-
D) Min: P1d1- + P2d2- + P3d3-
Answer: C
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

79) In the goal programming problem described in Table 10-7, how is the goal of producing
exactly 50 Zigs expressed?
A) X1 + d1+ = 50
B) X1 + d1- = 50
C) X1 - d1- = 50
D) X1 + d1- - d1+ = 50
Answer: D
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
80) In the goal programming problem described in Table 10-7, how is the goal of achieving a
target profit of at least $750 expressed?
A) X1 + X2 + d2- = 750
B) X1 + X2 + d2- - d2+ = 750
C) 4X1 +6 X2 + d2- = 750
D) 4X1 + 6X2 + d2- - d2+ = 750
Answer: D
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

81) In the goal programming problem described in Table 10-7, how is the goal of the use of all
product B available expressed?
A) 15X1 + 30X2 + d3- - d3+ = 3200
B) X1 + X2 + d3- - d3+ = 3200
C) X1 + X2 + d3- = 3200
D) 15X1 + 30X2 + d3- = 3200
Answer: D
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

82) In the goal programming problem described in Table 10-7, what is the optimal solution?
A) X1 = 75 + X2 = 91.67
B) X1 = 91.67 + X2 = 50
C) X1 = 50 + X2 = 75
D) X1 = 50 + X2 = 91.67
Answer: C
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
Table 10-8

A haberdashery produces scarves, ascots, and capes. The haberdashery makes $4 profit for each
scarf, $2 for an ascot, and $5 for a cape. In addition, they are able to enjoy some economies of
scale if the batch exceeds one scarf, ascot, or cape so they always make at least two consecutive
units of each item. For a scarf, the additional profit is 0.8S2; for an ascot, the profit made by
making consecutive items results in an extra 1.4A2; and for a cape, the bump is 2C2. There is
also a little extra profit due to the synergy of the scarves, ascots, and capes that adds an
additional 2SAC. It takes 10 minutes to produce a scarf, 15 minutes to produce an ascot and 30
minutes to produce a cape. There is a total of 50 hours available for labor each week. There must
be at least 50 scarves, 100 ascots, and 25 capes produced each week.

83) Use the information in Table 10-8 to formulate an appropriate objective function for a
nonlinear program for the haberdashery.
A) Maximize 4S + 2A + 5C + 0.8S2 + 1.4A2 + 2C2 + 2SAC
B) Maximize 4S + 2A + 5C
C) Maximize 4S + 2A + 5C - 0.8S2 - 1.4A2 - 2C2 - 2SAC
D) Maximize 4S + 2A + 5C - 0.8S2 - 1.4A2 - 2C2 + 2SAC
Answer: A
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

84) Use the information in Table 10-8 to formulate an appropriate constraint for the production
time at the haberdashery.
A) 10S + 15A + 30C ≤ 50
B) 10S + 15A + 30C ≤ 3000
C) 10S + 15A + 30C ≥ 50
D) 10S + 15A + 30C ≥ 3000
Answer: B
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application
85) How many constraints (exclusive of the non-negativity constraint) are needed for the
scenario described in Table 10-8?
A) 3
B) 5
C) 4
D) 7
Answer: C
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

86) Use Solver to determine the optimal product mix for the scenario described in Table 10-8.
A) 50 scarves, 100 ascots, 25 capes
B) 50 scarves, 100 ascots, 50 capes
C) 75 scarves, 100 ascots, 50 capes
D) 75 scarves, 100 ascots, 25 capes
Answer: D
Diff: Difficult
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

87) How many decision variables are needed for the scenario described in Table 10-8?
A) 3
B) 5
C) 6
D) 7
Answer: A
Diff: Easy
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application
88) Use Solver to determine the optimal product mix for the scenario described in Table 10-8.
What is the resulting profit?
A) $267,775
B) $395,375
C) $774,250
D) $521,650
Answer: B
Diff: Difficult
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

Table 10-9

A haberdashery produces scarves, ascots, and capes. The haberdashery makes $4 profit for each
scarf, $2 for an ascot, and $5 for a cape. In addition, they are able to enjoy some economies of
scale if the batch exceeds one scarf, ascot, or cape so they always make at least two consecutive
units of each item. For a scarf, the additional profit is 2S2; for an ascot, the profit made by
making consecutive items results in an extra 1.1A2; and for a cape, the bump is 0.8C2. There is
also an extra profit due to the synergy of the scarves, ascots, and capes that adds an additional
SAC.

It takes 9 minutes to produce a scarf, 13 minutes to produce an ascot and 30 minutes to produce a
cape. There is also a nonlinear element to the usage of time governed by the double the product
of scarves, ascots and capes produced. There is a total of 50 hours available for labor each week.
Shipping poses another issue for the haberdashery; packaging and loading trucks for online
orders is time consuming and that function is handled by the haberdashery owner's mother who
comes in after her afternoon walk around a local almost-deserted mall. It takes 1.5 minutes to
pack and load a scarf, 2.5 minutes to pack and load an ascot, and 3.5 minutes to pack and load a
cape. There is also a cross product term for packing and loading that is 0.15SA + 0.075SC +
0.025AC that must be considered. The haberdasher's mother is available only 30 hours a week,
but the haberdasher is prepared to lay down the law and insist she stop this mall walking
foolishness and devote herself completely to his business. For the time being, consider her time
as only 30 hours. Thanks to some arcane law governing haberdasheries, there must be at least 50
scarves, 100 ascots, and 25 capes produced each week.
89) Formulate an appropriate objective function for a nonlinear integer program for the
haberdashery described in Table 10-9.
A) Maximize 4S + 2A + 5C + 0.8S2 + 1.4A2 + 2C2 + 2SAC
B) Maximize 4S + 2A + 5C- 0.8S2 - 1.4A2 - 2C2 + 2SAC
C) Maximize 4S + 2A + 5C+ 2S2 + 1.1A2 + 0.8C2 + SAC
D) Maximize 4S + 2A + 5C- 2S2 - 1.1A2 - 0.8C2 + SAC
Answer: C
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

90) Formulate an appropriate constraint for the production time for the haberdashery described in
Table 10-9.
A) 1.5S + 2.5A + 3.5C + 0.15SA + 0.075SC + 0.025AC ≤ 30
B) 9S + 13A + 30C + 2SAC ≤ 50
C) 1.5S + 2.5A + 3.5C + 0.15SA + 0.075SC + 0.025AC≤ 1800
D) 9S + 13A + 30C + 2SAC ≤ 3000
Answer: D
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

91) Formulate an appropriate constraint for the poor gray-headed haberdasher's mother for the
haberdashery described in Table 10-9.
A) 1.5S + 2.5A + 3.5C + 0.15SA + 0.075SC + 0.025AC ≤ 1800
B) 1.5S + 2.5A + 3.5C + 0.15SA + 0.075SC + 0.025AC ≤ 30
C) 9S + 13A + 30C + 2SAC ≤ 50
D) 9S + 13A + 30C + 2SAC ≤ 3000
Answer: A
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application
92) Use Solver to determine an integer solution to the haberdashery problem described in Table
10-9. What is the maximum profit?
A) $142,025.00
B) $266,736.80
C) $197,616.80
D) $191,345.00
Answer: B
Diff: Difficult
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

93) Use Solver to determine an integer solution to the haberdashery problem described in Table
10-9. What is the best product mix?
A) 68 scarves, 100 ascots, 30 capes
B) 50 scarves, 100 ascots, 30 capes
C) 68 scarves, 100 ascots, 36 capes
D) 50 scarves, 100 ascots, 36 capes
Answer: C
Diff: Difficult
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

94) How many constraints are required to develop an integer solution to the haberdashery
problem described in Table 10-9?
A) 4
B) 5
C) 6
D) 7
Answer: D
Diff: Difficult
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application
95) How many constraints are required to develop an integer solution to the haberdashery
problem described in Table 10-9?
A) 4
B) 5
C) 6
D) 7
Answer: D
Diff: Difficult
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

96) Classify the following problems as to whether they are pure-integer, mixed-integer, zero-one,
goal, or nonlinear programming problems.

(a) Maximize Z = 5 X1 + 6 X1 X2 + 2 X2
Subject to: 3 X1 + 2 X2 ≥ 6
X1 + X2 ≤ 8
X1, X2 ≥ 0

(b) Minimize Z = 8 X1 + 6 X2
Subject to: 4 X1 + 5 X2 ≥ 10
X1 + X2 ≤ 3
X1, X2 ≥ 0
X1, X2 = 0 or 1

(c) Maximize Z = 10 X1 + 5 X2
Subject to: 8 X1 + 10 X2 = 10
4 X1 + 6 X2 ≥ 5
X1, X2 integer

(d) Minimize Z = 8 X12 + 4 X1 X2 + 12 X22


Subject to: 6 X1 + X2 ≥ 50
X1 + X2 ≥ 40
Answer:
(a) nonlinear
(b) zero-one
(c) pure integer
(d) nonlinear
Diff: Easy
Topic: VARIOUS
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application
97) A package express carrier is considering expanding the fleet of aircraft used to transport
packages. There is a total of $220 million allocated for purchases. Two types of aircraft may be
purchased — the C1A and the C1B. The C1A costs $25 million, while the C1B costs $18
million. The C1A can carry 60,000 pounds of packages, while the C1B can only carry 40,000
pounds of packages. The company needs at least eight new aircraft. In addition, the firm wishes
to purchase at least twice as many C1Bs as C1As. Formulate this as an integer programming
problem to maximize the number of pounds that may be carried.
Answer: Let A = number of C1As to purchase
B = number of C1Bs to purchase

Maximize 60000A + 40000B


Subject to: 25A + 18B ≤ 220 (budget in millions)
A + B ≥ 8 (aircraft)
B ≥ 2A (at least twice as many C1Bs as C1As)
A, B ≥ 0 and integer
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Application

98) Smalltime Investments Inc. is going to purchase new computers for most of the employees.
There are ten employees, and at least eight computers must be purchased. The cost of the basic
personal computer with monitor and disk drive is $2,000, while the deluxe version with VGA
and advanced processor is $3,500. Due to internal politics, the number of deluxe computers must
be no more than half the number of regular computers, but at least three deluxe computers must
be purchased. The budget is $27,000. Formulate this as an integer programming problem to
maximize the number of computers purchased.

Answer: Let R = number of regular computers purchased


D = number of deluxe computers purchased

Maximize R+D
Subject to: 2000R + 3500D ≤ 27,000 (budget)
-0.5R + D ≤ 0 (political limitation)
D ≥ 3 (minimum # of deluxe)
R + D ≥ 8 (minimum # of computers)
all variables ≥ 0 and integer
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Application
99) Smalltime Investments Inc. is going to purchase new computers. There are ten employees,
and the company would like one for each employee. The cost of the basic personal computer
with monitor and disk drive is $2,000, while the deluxe version with VGA and advanced
processor is $3,500. Due to internal politics, the number of deluxe computers should be less than
half the number of regular computers, but at least three deluxe computers must be purchased.
The budget is $27,000, although additional money could be used if it were deemed necessary.
All of these are goals that the company has identified. Formulate this as a goal programming
problem.
Answer: Let R = number of regular computers purchased
D = number of deluxe computers purchased
d1- = underachievement of goal of 10 computers to purchase
d1+ = overachievement of goal of 10 computers to purchase
d2- = unused budget
d2+ = additional monies required
d3- = underachievement of goal of the number of deluxe computers should be less than half the
number of regular computers
d3+ = overachievement of goal of the number of deluxe computers should be less than half the
number of regular computers
d4- = underachievement of goal that the number of deluxe computers should be at least 3
d4+ = overachievement of goal that the number of deluxe computers should be at least 3

Minimize d1- + d1+ + d3+ + d4-


Subject to: R + D + d1- - d1+ = 10
2000R + 3500D + d2- - d2+ = 27,000
-0.5R + D + d3- - d3+ = 0
D + d4- - d4+ = 3
all variables ≥ 0
Diff: Difficult
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
100) Allied Manufacturing has three factories located in Dallas, Houston, and New Orleans.
They each produce the same product and ship to three regional warehouses: #1, #2, and #3. The
cost of shipping one unit of each product to each of the three destinations is given below.

TO ==> #1 #2 #3
FROM Dallas 4 6 5 100
Houston 5 7 8 100
New Orleans 4 3 5 100
DEMAND 120 130 150

There is no way to meet the demand for each warehouse. Therefore, the company has decided to
set the following goals: (1) the number shipped from each source should be as close to 100 units
as possible (overtime may be used if necessary), (2) the number shipped to each destination
should be as close to the demand as possible, (3) the total cost should be close to $1,400.
Formulate this as a goal programming problem.

Answer: Let X11 = number of units shipped from Dallas to #1


X12 = number of units shipped from Dallas to #2
X13 = number of units shipped from Dallas to #3
X21 = number of units shipped from Houston to #1
X22 = number of units shipped from Houston to #2
X23 = number of units shipped from Houston to #3
X31 = number of units shipped from New Orleans to #1
X32 = number of units shipped from New Orleans to #2
X33 = number of units shipped from New Orleans to #3

d1- = underachievement of goal to ship 100 units from Dallas


d1+ = overachievement of goal to ship 100 units from Dallas
d2- = underachievement of goal to ship 100 units from Houston
d2+ = overachievement of goal to ship 100 units from Houston
d3- = underachievement of goal to ship 100 units from New Orleans
d3+ = overachievement of goal to ship 100 units from New Orleans
d4- = underachievement of target to ship to warehouse #1 close to its demand
d4+ = overachievement of target to ship to warehouse #1 close to its demand
d5- = underachievement of target to ship to warehouse #2 close to its demand
d5+ = overachievement of target to ship to warehouse #2 close to its demand
d6- = underachievement of target to ship to warehouse #3 close to its demand
d6+ = overachievement of target to ship to warehouse #3 close to its demand
d7- = underachievement of target total cost
d7+ = overachievement of target total cost
Minimize d1+ + d2+ + d3+ + d4+ + d4- + d5- + d5+ + d6+ + d6- + d7+
Subject to: X11 + X12 + X13 + d1- - d1+ = 100
X21 + X22 + X23 + d2- - d2+ = 100
X31 + X32 + X33 + d3- - d3+ = 100
X11 + X21 + X31 + d4- - d4+ = 120
X12 + X22 + X32 + d5- - d5+ = 130
X13 + X23 + X33 + d6- - d6+ = 150
4 X11 + 6 X12 + 5 X13 + 5 X21 + 7 X22 + 8 X23 + 4 X31 + 3 X32 + 5 X33 + d7- - d7+ = 1400
all variables ≥ 0
Diff: Difficult
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
101) The Elastic Firm has two products coming on the market, Zigs and Zags. To make a Zig,
the firm needs 10 units of product A and 15 units of product B. To make a Zag, they need 20
units of product A and 15 units of product B. There are only 2,000 units of product A and 3,000
units of product B available to the firm. The profit on a Zig is $4 and on a Zag it is $6.
Management objectives in order of their priority are:

(1) Produce at least 40 Zags.


(2) Achieve a target profit of at least $750.
(3) Use all of the product A available.
(4) Use all of the product B available.
(5) Avoid the requirement for more product A.

Formulate this as a goal programming problem.


Answer: Let X1 = number of Zigs, X2 = number of Zags.
d1- = underachievement of Zag goal
d1+ = overachievement of Zag goal
d2- = underachievement of profit target
d2+ = overachievement of profit target
d3- = unused product A
d3+ = additional amount of product A needed
d4- = unused product B
d4+ = additional amount of product B needed

Minimize P1 d1- + P2 d2- + P3 d3- + P4 d4+ + P5 d3-


Subject to: X2 + d1- - d1+ = 40 (Zag constraint)
4 X1 + 6 X2 + d2- - d2+ = 750 (profit)
10 X1 + 20 X2 + d3- - d3+ = 2000 (product A)
15 X1 + 15 X2 + d4- - d4+ = 3000 (product B)
all variables ≥ 0
Diff: Difficult
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
102) Data Equipment Inc. produces two models of a retail price scanner, a sophisticated model
that can be networked to a central processing unit and a stand-alone model for small retailers.
The major limitations of the manufacturing of these two products are labor and material
capacities. The following table summarizes the usages and capacities associated with each
product.

Product Labor Materials Profit


Hr/Unit Components/Unit $/Unit
Network (X1) 8 20 $160
Basic (X2) 5 7 $95
Capacity 800 hr/day 1,500 comp/day

The typical LP formulation for this problem is:


Maximize $160 X1 + $95 X2
Subject to: 8 X1 + 5 X2 ≤ 800
20 X1 + 7 X2 ≤ 1500
X1, X2 ≥ 0

However, the management of DEI has prioritized several goals that are to be attained by
manufacturing:
Since the labor situation at the plant is uneasy (i.e., there are rumors that a local union is
considering an organizing campaign), management wants to assure full employment of all its
employees.
Management has established a profit goal of $12,000 per day.
Due to the high prices of components from nonroutine suppliers, management wants to minimize
the purchase of additional materials.

Given the above additional information, set this up as a goal programming problem.
Answer: Let d1- = underachievement of full employment goal
d1+ = overachievement of full employment goal
d2- = underachievement of profit target
d2+ = overachievement of profit target
d3- = unused components
d3+ = additional amount of components needed

Minimize P1 d1- + P2 d2- + P3 d3+


Subject to: 8 X1 + 5 X2 + d1- - d1+ = 800
160 X1 + 95 X2 + d2- - d2+ = 12000
20 X1 + 7 X2 + d3- - d3+ = 1500
all variables ≥ 0
Diff: Difficult
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
103) Data Equipment Inc. produces two models of a retail price scanner, a sophisticated model
that can be networked to a central processing unit and a stand-alone model for small retailers.
The major limitations of the manufacturing of these two products are labor and material
capacities. The following table summarizes the usages and capacities associated with each
product.

Product Labor Materials Profit


Hr/Unit Components/Unit $/Unit
Network (X1) 8 20 $160
Basic (X2) 5 7 $95
Capacity 800 hr/day 1,500 comp/day

The typical LP formulation for this problem is:


Maximize P = $160 X1 + $95 X2
Subject to: 8 X1 + 5 X2 ≤ 800
20 X1 + 7 X2 ≤ 1500
X1, X2 ≥ 0

However, the management of DEI has prioritized several goals that are to be attained by
manufacturing:
Management had decided to severely limit overtime.
Management has established a profit goal of $15,000 per day.
Due to the difficulty of obtaining components from non-routine suppliers, management wants to
end production with at least 50 units of each component remaining in stock.
Management also believes that they should produce at least 30 units of the network model.

Given the above additional information, set this up as a goal programming problem.
Answer: Let d1- = underachievement of labor hours
d1+ = overachievement of labor hours
d2- = underachievement of profit target
d2+ = overachievement of profit target
d3- = unused components
d3+ = additional amount of components needed
d4- = underachievement of target for number of network models
d4+ = overachievement of target for number of network models

Minimize P1 d1+ + P2 d2- +P3 d3+ + P4 d4-


Subject to: 8 X1 + 5 X2 + d1- - d1+ = 800
160 X1 + 95 X2 + d2- - d2+ = 15000
20 X1 + 7 X2 + d3- - d3+ = 1450
X1 + d4- - d4+ = 30
all variables ≥ 0
Diff: Difficult
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application
104) A package express carrier is considering expanding the fleet of aircraft used to transport
packages. Of primary importance is that there is a total of $350 million allocated for purchases.
Two types of aircraft may be purchased - the C1A and the C1B. The C1A costs $25 million,
while the C1B costs $18 million. The C1A can carry 60,000 pounds of packages, while the C1B
can only carry 40,000 pounds of packages. Of secondary importance is that the company needs
at least 10 new aircraft. It takes 150 hours per month to maintain the C1A, and 100 hours to
maintain the C1B. The least level of importance is that there are a total of 1,200 hours of
maintenance time available per month.

(a) First, formulate this as an integer programming problem to maximize the number of pounds
that may be carried.
(b) Second, rework the problem differently than in part (a) to suppose the company decides that
what is most important to them is that they keep the ratio of C1Bs to C1As in their fleet as close
to 1.2 as possible to allow for flexibility in serving their routes. Formulate the goal programming
representation of this problem, with the other three goals having priorities P2, P3, and P4,
respectively.
Answer:
(a) Let A = number of C1As to purchase
B = number of C1Bs to purchase
Maximize 60000A + 40000B
Subject to: 25A + 18B ≤ 350 (budget, in millions)
A + B ≥ 10 (minimum number of aircraft)
150A + 100B ≤ 1200 (maintenance)
A, B ≥ 0 and integer
(b) Let A = number of C1As to purchase
B = number of C1Bs to purchase
d1- = underachievement of ratio of C1B to C1A
d1+ = overachievement of ratio of C1B to C1A
d2- = underachievement of budget target
d2+ = overachievement of budget target
d3- = underachievement of planes
d3+ = overachievement of planes
d4- = underachievement of maintenance hours
d4+ = overachievement of maintenance hours

Minimize P1d1- + P1d1+ + P2d2+ + P3d3- + P4d4+


Subject to: -1.2A + B + d1- - d1+ = 0 (ratio of 1.2 C1Bs to C1As)
25A + 18B + d2- - d2+ = 350 (budget, in millions)
A + B + d3- - d3+ = 10 (minimum number of aircraft)
150A + 100B + d4- - d4+ = 1200 (maintenance)
all variables ≥ 0
Diff: Difficult
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

105) Bastille College is going to purchase new computers for both faculty and staff. There are a
total of 50 people who need new machines — 30 faculty and 20 staff. The cost of the basic
personal computer with monitor and disk drive is $2,000, while the deluxe version with VGA
and advanced processor is $3,500. Due to internal politics, the number of deluxe computers
assigned to staff must be less than half the number of deluxe computers assigned to faculty. The
College feels that it must purchase at least 5 deluxe computers for the faculty; if possible, it
would like to purchase as many as 20 deluxe computers for the faculty. Staff members do feel
somewhat "put upon" by having a limit placed upon the number of deluxe machines purchased
for their use, so the College would like to purchase as many deluxe machines for the staff as
possible (up to 10). The budget is $100,000. Develop a goal programming formulation of this
problem that treats each of the requirements stated above as an equally weighted goal.
Answer: Let FR = number of regular computers purchased for faculty use
FD = number of deluxe computers purchased for faculty use
SR = number of regular computers purchased for staff use
SD = number of deluxe computers purchased for staff use
d1- = underachievement of minimum faculty deluxe computers
d1+ = overachievement of minimum faculty deluxe computers
d2- = underachievement of maximum faculty deluxe computers
d2+ = overachievement of maximum faculty deluxe computers
d3- = underachievement of deluxe ratio
d3+ = overachievement of deluxe ratio
d4- = underachievement of total faculty computers
d4+ = overachievement of total faculty computers
d5- = underachievement of maximum staff deluxe computers
d5+ = overachievement of maximum staff deluxe computers
d6- = underachievement of total staff computers
d6+ = overachievement of total staff computers
d7- = underachievement of budget
d7+ = overachievement of budget

Minimize d1- + d2+ + d3+ + d4- + d5- + d6- + d7+


Subject to: FD + d1- - d1+ = 5 Deluxe faculty
FD + d2- - d2+ = 20 Deluxe faculty
-0.5FD + SD + d3- - d3+ = 0 Deluxe ratio
FD + FR + d4- - d4+ = 30 Total faculty
SD + d5- - d5+ = 10 Deluxe Staff
SR + SD + d6- - d6+ = 20 Total staff
3500FD + 2000FR + 2000SR + 3500SD + d7- - d7+ = 100000 Budget
all variables ≥ 0

Diff: Difficult
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

106) Allied Manufacturing has three factories located in Dallas, Houston, and New Orleans.
They each produce the same 281 products and ship to three regional warehouses - #1, #2, and #3.
The cost of shipping one unit of each product to each of the three destinations is given in the
table below:
TO ==> #1 #2 #3
FROM Dallas 4 6 5 100
Houston 5 7 8 100
New Orleans 4 3 5 100
DEMAND 120 130 150

There is no way to meet the demand for each warehouse. Therefore, the company has decided to
set the following equally weighted goals: (1) each source should ship as much of its capacity as
possible, (2) the number shipped to each destination should be as close to the demand as
possible, (3) the capacity of New Orleans should be divided as evenly as possible between
warehouses #1 and #2, and (4) the total cost should be less than $1,400. Formulate this as a goal
program, which includes a strict requirement that capacities cannot be violated.
Answer: Let X11 = number of units shipped from Dallas to #1
X12 = number of units shipped from Dallas to #2
X13 = number of units shipped from Dallas to #3
X21 = number of units shipped from Houston to #1
X22 = number of units shipped from Houston to #2
X23 = number of units shipped from Houston to #3
X31 = number of units shipped from New Orleans to #1
X32 = number of units shipped from New Orleans to #2
X33 = number of units shipped from New Orleans to #3
d1- = underachievement of goal to ship 100 units from Dallas
d2- = underachievement of goal to ship 100 units from Houston
d3- = underachievement of goal to ship 100 units from New Orleans
d4- = underachievement of target to ship to warehouse #1 close to its demand
d4+ = overachievement of target to ship to warehouse #1 close to its demand
d5- = underachievement of target to ship to warehouse #2 close to its demand
d5+ = overachievement of target to ship to warehouse #2 close to its demand
d6- = underachievement of target to ship to warehouse #3 close to its demand
d6+ = overachievement of target to ship to warehouse #3 close to its demand
d7- = underachievement of target to ship about same quantities from New Orleans to warehouse
1 and 2
d7+ = overachievement of target to ship about same quantities from New Orleans to warehouse 1
and 2
d8- = underachievement of target total cost
d8+ = overachievement of target total cost
Minimize d1- + d2- + d3- + d4- + d4+ + d5- + d5+ + d6- + d6+ + d7- + d7+ + d8+
Subject to: X11 + X12 + X13 + d1- = 100
X21 + X22 + X23 + d2- = 100
X31 + X32 + X33 + d3- = 100
X11 + X21 + X31 + d4- - d4+ = 120
X12 + X22 + X32 + d5- - d5+ = 130
X13 + X23 + X33 + d6- - d6+ = 150
X31 - X32 + d7- - d7+ = 0
4 X11 + 6 X12 + 5 X13 + 5 X21 + 7 X22 + 8 X23 + 4 X31 + 3 X32 + 5 X33 + d8- - d8+ = 1400
all variables ≥ 0
Diff: Difficult
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Application

107) A bakery produces muffins and doughnuts. Let x1 be the number of doughnuts produced
and x2 be the number of muffins produced. The profit function for the bakery is expressed by the
following equation: profit = 4x1 + 2x2 + 0.3x12 + 0.4x22. The bakery has the capacity to
produce 800 units of muffins and doughnuts combined and it takes 30 minutes to produce 100
muffins and 20 minutes to produce 100 doughnuts. There is a total of 4 hours available for
baking time. There must be at least 200 units of muffins and at least 200 units of doughnuts
produced. Formulate a nonlinear program representing the profit maximization problem for the
bakery.
Answer: Maximize profit = 4x1 + 2x2 + 0.3x12 + 0.4x22
Subject to: x1 + x2 ≤ 800
x1/200 + x2/300 ≤ 4
x1 ≥ 200
x2 ≥ 200
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application
108) A bakery produces muffins and doughnuts. Let x1 be the number of doughnuts produced
and x2 be the number of muffins produced. The profit function for the bakery is expressed by the
following equation: profit = 4x1 + 2x2 + 0.3x12 + 0.4x22. The bakery has the capacity to
produce 800 units of muffins and doughnuts combined and it takes 30 minutes to produce 100
muffins and 20 minutes to produce 100 doughnuts. There is a total of 4 hours available for
baking time. There must be at least 200 units of muffins and at least 200 units of doughnuts
produced. How many doughnuts and muffins should the bakery produce in order to maximize
profit?
Answer: x1 = 200, x2 = 600
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

109) Johnny's apple shop sells homemade apple pies and freshly squeezed apple juice. Each
apple pie requires 2 apples, and 1 apple yields 4 ounces of juice. Customers use a self-service
dispenser to pour apple juice in a container and are charged by the ounce at a rate of $0.50 per
ounce. The contribution to profit of the apple pie, factoring in the apples and remaining
ingredients are $2 per pie, and the contribution to profit of freshly squeezed apple juice is $0.20
per ounce. In a given day, there must be at least 100 ounces of apple juice produced and at least
10 apple pies. The company has a supply of 60 apples per day. Formulate this problem as a
mixed integer program. Apple pies must be produced in whole quantities, but any positive value
is positive for juice production.
Answer: Maximize: 0.2X1 + 2X2
Subject to: 0.25X1 + 2X2 ≤ 60
X1 ≥ 100
X2 ≥ 10
X2 must be integer

Where X1 = # of ounces of apple juice produced and X2 = # of apple pies produced


Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Application
110) Johnny's apple shop sells homemade apple pies and freshly squeezed apple juice. Each
apple pie requires 2 apples, and 1 apple yields 4 ounces of juice. Customer's use a self-service
dispenser to pour apple juice in a container and are charged by the ounce at a rate of $0.50 per
ounce. The contribution to profit of the apple pie, factoring in the apples and remaining
ingredients are $2 per pie, and the contribution to profit of freshly squeezed apple juice is $0.20
per ounce. In a given day, there must be at least 100 ounces of apple juice produced and at least
10 apple pies. The company has a supply of 60 apples per day. What is the optimal solution?
Apple pies must be produced in whole quantities, but any positive value is positive for juice
production.
Answer: Maximize: 0.2X1 + 2X2
Subject to: 0.25X1 + 2X2 ≤ 60
X1 ≥ 100
X2 ≥ 10
X2 must be integer

Where X1 = # of ounces of apple juice produced and X2 = # of apple pies produced


Optimal solution is X1 = 104 and X2 = 17
Diff: Moderate
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Application

111) Define deviational variables.


Answer: In goal programming, they constitute the objective function terms and capture the gap
between set goals and what can be actually achieved given the constraints.
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept

112) State the advantage of goal programming over linear programming.


Answer: Goal programming allows for multiple objectives, unlike linear programming.
Diff: Moderate
Topic: GOAL PROGRAMMING
LO: 10.3: Formulate and solve goal programming problems using Excel and QM for Windows.
AACSB: Analytical thinking
Classification: Concept
113) Define quadratic programming.
Answer: A quadratic programming problem occurs when the objective function contains
squared terms and the problem's constraints are linear.
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Concept

114) What is mixed integer programming?


Answer: Integer programming involves cases where some, but not all, decision variables require
integer values.
Diff: Easy
Topic: INTEGER PROGRAMMING
LO: 10.1: Understand the difference between LP and integer programming.
AACSB: Analytical thinking
Classification: Concept

115) A haberdashery produces scarves, ascots, and capes. The profit function for the
haberdashery is expressed by the following equation: profit = 4S + 2A + 5C + 0.8S2 + 1.4A2 +
2C2 + 2SAC. It takes 10 minutes to produce a scarf, 15 minutes to produce an ascot and 30
minutes to produce a cape. There is a total of 50 hours available for labor each week. There must
be at least 50 scarves, 100 ascots, and 25 capes produced each week. Formulate a nonlinear
program representing the profit maximization problem for the haberdashery.
Answer: Maximize profit = 4S + 2A + 5C + 0.8S2 + 1.4A2 + 2C2 + 2SAC
Subject to: 10S + 15A + 30C ≤ 3000
S ≥ 50
A ≥ 100
C ≥ 25
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application
116) A haberdashery produces scarves, ascots, and capes. The profit function for the
haberdashery is expressed by the following equation: profit = 4S + 2A + 5C + 0.8S2 + 1.4A2 +
2C2 + 2SAC. It takes 10 minutes to produce a scarf, 15 minutes to produce an ascot and 30
minutes to produce a cape. There is a total of 50 hours available for labor each week. There must
be at least 50 scarves, 100 ascots, and 25 capes produced each week. Formulate a nonlinear
program representing the profit maximization problem for the haberdashery and solve using
Solver's GRG Nonlinear routine.
Answer: Maximize profit = 4S + 2A + 5C + 0.8S2 + 1.4A2 + 2C2 + 2SAC
Subject to: 10S + 15A + 30C ≤ 3000
S ≥ 50
A ≥ 100
C ≥ 25
The optimal product mix is 75 Scarves, 100 Ascots, and 25 Capes for a tidy profit of $395,375.
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application
117) A haberdashery produces scarves, ascots, and capes. The profit function for the
haberdashery is expressed by the following equation: profit = 4S + 2A + 5C + 0.8S2 + 1.4A2 +
2C2 + 2SAC. It takes 9 minutes to produce a scarf, 13 minutes to produce an ascot and 30
minutes to produce a cape. There is also a nonlinear element to the usage of time governed by
the double the product of scarves, ascots and capes produced. There is a total of 50 hours
available for labor each week. Shipping poses another issue for the haberdashery; packaging and
loading trucks for online orders is time consuming and that function is handled by the
haberdashery owner's mother who comes in after her afternoon walk around a local almost-
deserted mall. It takes 1.5 minutes to pack and load a scarf, 2.5 minutes to pack and load an
ascot, and 3.5 minutes to pack and load a cape. There is also a cross product term for packing
and loading that is 0.15SA + 0.075SC + 0.025AC that must be considered. The haberdasher's
mother is available only 30 hours a week, but the haberdasher is prepared to lay down the law
and insist she stop this mall walking foolishness and devote herself completely to his business.
For the time being, consider her time as only 30 hours. There must be at least 50 scarves, 100
ascots, and 25 capes produced each week. Formulate a nonlinear integer program representing
the profit maximization problem for the haberdashery.
Answer: Maximize profit = 4S + 2A + 5C + 0.8S2 + 1.4A2 + 2C2 + 2SAC
Subject to: 9S + 13A + 30C + 2SAC ≤ 3000
S ≥ 50
A ≥ 100
C ≥ 25
1.5S + 2.5A + 3.5C + 0.15SA + 0.075SC + 0.025AC ≤ 1800
S, A, C integers
S, A, C ≥ 0
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application
118) A haberdashery produces scarves, ascots, and capes. The profit function for the
haberdashery is expressed by the following equation: profit = 4S + 2A + 5C + 0.8S2 + 1.4A2 +
2C2 + 2SAC. It takes 9 minutes to produce a scarf, 13 minutes to produce an ascot and 30
minutes to produce a cape. There is a total of 50 hours available for labor each week. There must
be at least 50 scarves, 100 ascots, and 25 capes produced each week. Formulate a nonlinear
program representing the profit maximization problem for the haberdashery and solve using
Solver's GRG Nonlinear routine.
Answer: Maximize profit = 4S + 2A + 5C + 0.8S2 + 1.4A2 + 2C2 + 2SAC
Subject to: 10S + 15A + 30C ≤ 3000
S ≥ 50
A ≥ 100
C ≥ 25
1.5S + 2.5A + 3.5C + 0.15SA + 0.075SC + 0.025AC ≤ 1800
S, A, C integers
S, A, C ≥ 0
The optimal product mix is 68 Scarves, 100 Ascots, and 36 Capes for a tidy profit of $510,543.
Diff: Moderate
Topic: NONLINEAR PROGRAMMING
LO: 10.4: Formulate and solve nonlinear programming problems using Excel.
AACSB: Analytical thinking
Classification: Application

119) Agile Bikes has manufacturing plants in Salt Lake City, Dallas, and Chicago. The bikes are
shipped to retail stores in Los Angeles, New York, Miami, and Seattle. Information on shipping
costs, supply, and demand is given in the below table. What is the minimum cost solution to this
bicycle shipment scenario?

To
From Los Angeles New York Miami Seattle Supply
Salt Lake
City $50 $150 $200 $75 1500
Dallas $100 $75 $75 $150 1200
Chicago $100 $75 $100 $150 1400
Demand 900 1200 900 800

Answer: Los Angeles should receive 200 units from Chicago and 700 from Salt Lake City.
New York receives all 1200 bicycles from Chicago.
Miami receives all 900 bicycles from Dallas.
Seattle receives all 800 bicycles from Salt Lake
300 bicycles aren't sent anywhere.
The total cost is $272,500
Diff: Moderate
Topic: MODELING WITH 0-1 (BINARY) VARIABLES
LO: 10.2: Formulate and solve the three types of integer programming problems.
AACSB: Analytical thinking
Classification: Application
Another random document with
no related content on Scribd:
imperative; and the Drayhy made the most skilful and best combined
dispositions for ensuring the triumph of courage over numbers: he
displayed all the resources of his military genius and long
experience, and himself performed prodigies of valour,—he had
never commanded more calmly, nor fought more impetuously:
accordingly, the enemy was obliged to retreat, leaving us at full
liberty to pursue our homeward journey. The Drayhy, however,
considering that it would not be prudent to leave behind him a hostile
though beaten tribe, slackened his march, and sent a courier to the
Emir Sahid, to give him intelligence of what had passed. The
messenger returned in a few days, bringing a very friendly letter to
the Drayhy, enclosing a second, addressed in the following terms to
Redaini:
“In the name of God the supreme: Be homage and respectful
prayers ever addressed to the greatest, the most powerful, the most
honorable, the wisest, and the handsomest of prophets! the bravest
of the brave, the greatest of the great, the caliph of caliphs, the
master of the sabre and of the red ruby, the converter of souls, the
Iman Ali. This letter is from Sahid el Bokhrani, the grandee of the two
seas and of the two Persias, to his brother the Emir Redaini, the son
of Kronkiar. We give you to know that our brother the Emir Drayhy
Ebn Chahllan, of the country of Bagdad and Damascus, is come
from far to visit us and form an alliance with us. He has marched on
our land and eaten of our bread; we have granted him our friendship,
and moreover have entered into particular engagements with him,
from which great good and general tranquillity will result. We desire
that you do the same: take care that you do not fail in this point, or
you will lose our esteem, and act in opposition to the will of God, and
of the glorious Iman Ali.”
Here followed many citations from their holy books, the Giaffer el
Giameh, and the customary salutations.
We sent this letter to the Emir Redaini, who thereupon came to us,
accompanied by five hundred horsemen, all richly dressed in gold
brocades: their arms were mounted in chased silver, and the
Damascus blades of their sabres exquisitely worked. Some amicable
explanations having passed, Redaini copied with his own hand the
particular treaty of the Emir Sahid, and signed it: he then took coffee,
but refused to dine with us, the fanatics of the sect of Ali being
prohibited from eating either with Christians or Turks. To ratify his
contract, however, he swore upon bread and salt, and then
embraced the Drayhy with great protestations of fraternity. His tribe,
called El Mehaziz, numbers ten thousand tents. After taking leave of
him, we continued our journey by forced marches, advancing fifteen
leagues a day without halting. On reaching Bagdad, Sheik Ibrahim
went into the city to take up money; but the season requiring
expedition, we lost as little time as possible. In Mesopotamia we got
news of the Wahabees. Ebn Sihoud had given a very ill reception to
his general, Hedal, after his defeat, and had sworn to send a more
powerful army than the former, under his son, to take vengeance
upon the Drayhy, and exterminate the Bedouins of Syria; but after
having obtained more correct information respecting the resources
and personal reputation of the Drayhy, he changed his tone, and
resolved to make an effort towards concluding an alliance with him.
Foreign events also gave an air of probability to these rumours; for
the Pacha of Egypt, Mehemet Ali, was preparing an expedition to
invade Arabia Petrea, and to take possession of the riches of Mecca,
which, for the present, were in the hands of Ebn Sihoud. Either of
these prospects was agreeable to our projects, which would have
been equally forwarded, whether his proposed alliance took effect, or
whether he was weakened by a foreign power. We were continually
meeting on our route tribes which had not yet signed the treaty, but
which eagerly took advantage of the opportunity of doing so.[T] On
arriving in Syria, we received a courier from the King of the
Wahabees, who brought us a little bit of paper, about three fingers in
breadth, and twice as long. They affect to use these diminutive
missives in contrast to the Turks, who write their firmans upon large
sheets of paper. The Arabian character takes so little room, that in
this small space was written a very long and sufficiently imperious
letter. It commenced with a sort of confession of faith, or declaration,
that God is one, universal, and without equal; then came all the titles
of the king whom God has invested with his sabre to maintain his
unity against the idolaters (the Christians) who affirm the contrary.
And it continued thus:—
“We, Abdallah, son of Abdel Aziz, son of Abdel Wahabs, son of
Sihoud: We give you to know, O son of Chahllan, (may the only
adorable God direct you in the right way!) that if you believe in God,
you must obey his slave Abdallah, to whom he has delegated his
power, and come and see us without fear. You shall be our well-
beloved son; we will pardon the past, and treat you as one of
ourselves. But beware of obstinacy and resistance to our call; for he
who listens to us is reckoned in the number of the inhabitants of
paradise.
“Health.
“Signed,
El Manhoud Menalla Ebn Sihoud Abdallah.”
On the reception of this letter we held a great council of war; and
after having deliberately weighed all the perils of the journey against
the advantages of the alliance of Ebn Sihoud, the Drayhy determined
to comply with this authoritative invitation. Sheik Ibrahim having
asked me if I felt my courage equal to undertaking a visit to this
fanatic, I replied:
“I am well aware that my risk is greater than that of others, on
account of his hatred of all Christians; but I put my confidence in
God. I must die once, and having already made a sacrifice of my life,
I am willing to undertake any task likely to promote the entire
execution of the enterprise upon which I have entered.”
A desire of seeing this extraordinary man and his curious country
also excited my courage, and having earnestly recommended my
poor mother to the protection of M. Lascaris, if I should die in this
expedition, I set out with the Drayhy, his second son Sahdoun, his
nephew, his cousin, two of the principal chiefs, and five negroes, all
mounted on dromedaries. During his father’s absence, Saher was to
command the tribe, and conduct it to Horran, to meet the Drayhy,
who proposed returning by the Hegiaz. We made our first halt
among the Bedouins Beny Toulab, whose sole wealth consists in a
few asses, and who live by hunting gazelles and ostriches. They
wear the skins of gazelles coarsely sewed together, forming long
robes with very large sleeves; and the fur being outside, their
appearance much resembles that of wild beasts: I have never seen
anything so savage as their aspect. They showed us an ostrich hunt,
in which I was greatly interested. The female ostrich lays her eggs in
the sand, and takes up her station at some distance, looking fixedly
upon them: she covers them as it were, with her eyes, which she
never turns from the nest. She remains thus immovable for half the
day, until the male comes to relieve her. She then goes in search of
food whilst her mate keeps guard in his turn. The hunter, when he
has discovered the eggs, constructs a sort of shed with stones to
conceal himself, and waits behind it for the favourable moment.
When the female is left alone, and the male at a sufficient distance to
prevent his taking alarm at the report, he draws his trigger, runs to
pick up the unfortunate bird who has received her mortal wound,
wipes away the blood, and replaces her in her former position near
the eggs; the male, on his return, approaches fearlessly to assume
his office of guard, when the hunter, who has remained in
ambuscade, shoots him also, and thus bears away a double prize. If
the male has had any cause of alarm, he runs with velocity to a
distance; and if pursued, defends himself by flinging stones behind
him with extraordinary force, to the extent of a musket-shot:—it is
moreover prudent to keep at a distance from him when in a state of
irritation, for his elevated stature and vigorous strength would render
a close encounter very perilous, especially to the hunter’s eyes.
When the season of the ostrich chase is over, the Bedouins carry the
feathers to Damascus, or even as far as Bagdad, for sale.
These hunters, when about to marry, pledge half the profits of the
ensuing year’s chase to the father of the intended bride, as her
dowry. They hold the memory of Antar in high veneration, and
proclaim themselves his descendants: but how far the pretension is
admissible, I know not. They recite, however, numerous fragments of
his poem.
After taking leave of them, we still proceeded at the rapid pace of our
dromedaries, and encamped on the borders of a very extensive lake,
called Raam Beni Hellal, which receives its waters from a mountain
which we had skirted.
The next day, having reached the middle of a dry and barren desert,
we discovered a little oasis, formed by the shrub called jorfa, and
had arrived within a few paces of it, when our dromedaries suddenly
stopped short, which we at first attributed to their inclination for
resting in a spot where the appearance of vegetation announced the
probable presence of water; but it was soon evident that their
repugnance arose from instinctive terror, manifested by all its
outward tokens: neither caresses nor menaces could induce them to
stir. My curiosity being excited to the highest degree, I alighted to
investigate the cause of their alarm: but I had no sooner entered the
thicket, than I involuntarily recoiled, for the ground was strewed with
the skins of serpents of all sizes and species. There were thousands
of them; some of the thickness of a ship’s cable, others as small as
needles. We hurried from the spot, offering up thanksgivings to God
that the skins alone of these venomous reptiles had fallen in our way.
No shelter appearing as night closed in, we were obliged to pass it in
the open desert: but the horrible spectacle of the thicket was too
forcibly impressed upon my imagination to permit me to close my
eyes; I expected every moment to see an enormous serpent glide
under the covering of my tent, and rear its menacing head beside my
pillow.
The following day we overtook a considerable tribe of Wahabees
coming from Samarcand: we carefully concealed our pipes from
them,—for Ebn Sihoud severely prohibits smoking, and punishes
any infraction of his laws with death. The Emir Medjioun hospitably
entertained us, but could not suppress his surprise at our hardihood
in thus placing ourselves at the mercy of the Wahabee, whose
ferocious character he depicted to us in the most frightful terms. He
did not dissemble that we ran great hazard; Ebn Sihoud’s deceitful
promises, which he lavishes without scruple, being no guarantee
against the most infamous treachery. The Drayhy himself, full of
loyalty, had advanced on the faith of the king’s invitation, his
imagination never suggesting the possibility of a breach of promise,
and began now to repent his too credulous confidence; but pride
prevented his retreating, and we prosecuted our journey. We soon
reached the Nedgde, a country intersected with mountains and
valleys, studded with nomade camps, and abounding in towns and
villages, the former of which appear to be very ancient, and attest a
former population much richer and more numerous than that by
which they are now occupied. The villages are peopled with Bedouin
husbandmen; and the soil produces corn, table vegetables, and
dates in abundance. We were told by the inhabitants, that the
aborigines had abandoned their country to establish themselves in
Africa, under the conduct of one of their princes, named Beni Hetal.
We everywhere experienced a warm-hearted hospitality, but heard
interminable complaints of the tyranny of Ebn Sihoud, under whose
dominion these people seem to be retained by fear alone.
At length after fourteen days’ journey, at the pace of our
dromedaries, which may be reckoned at triple the distance traversed
by a caravan in the same space of time, we arrived in the capital of
the Wahabees. The city is surrounded and concealed by a wood of
palms, called the Palm-trees of Darkisch, which serves it as a
rampart, and is so thickly planted as scarcely to admit the passage
of a horseman between the trunks of the trees. Having made our
way through these, we came to a second barrier, composed of little
hillocks of date-stones, resembling a bank of small pebbles, and
behind it the town-wall, along which we rode to the entrance-gate,
and, passing through it, soon reached the king’s palace, a large
edifice of two stories, built of white hewn stones.
Ebn Sihoud, on being informed of our arrival, ordered us to be
ushered into an elegant and well-furnished apartment, where a
plentiful repast was set before us. This beginning seemed to augur
well, and we congratulated ourselves upon not having yielded to the
suspicions which had been suggested to us. The same night, having
suitably attired ourselves, we were presented to the king; whom we
found to be about forty-five years of age, with a harsh countenance,
a bronzed complexion, and a very black beard. He was dressed in a
robe fastened round the loins by a white sash, a striped turban of red
and white on his head, and a black embroidered mantle thrown over
his left shoulder, holding in his right hand the sceptre of the King of
Mahlab, the ensign of his authority. He was seated, surrounded by
the grandees of his court, at the extremity of a large audience-
chamber, richly furnished with mats, carpets, and cushions. The
draperies, as well as the king’s habiliments, were of cotton or the
wool of Yemen,—silk being prohibited in his dominions, together with
everything that would recall the luxury or customs of the Turks. I had
leisure for making my observations; for when Ebn Sihoud had
answered concisely and in a chilling tone to the Drayhy’s
compliments, we seated ourselves, and waited in silence till he
should propose a subject of conversation. The Drayhy, however,
observing that after half an hour had elapsed he neither ordered
coffee nor cleared his brow, opened the conference himself by thus
addressing him:—
“I see, O son of Sihoud, that our reception from you is not such as
we had a right to expect. We have travelled through your territories,
and are come under your roof, upon your own invitation: if you have
anything to allege against us, speak—conceal nothing from us.”
Ebn Sihoud, casting a fiery glance at him, replied:
“Yes, truly, I have many things to allege against you: your crimes are
unpardonable! You have revolted against me; you have refused to
obey me, and you have devastated the tribe of Sachrer, in Galilee,
knowing that it belonged to me.
“You have corrupted the Bedouins, and confederated them against
me, and against my authority.
“You have destroyed my armies, pillaged my camps, and supported
my mortal enemies, those idolaters, those profaners, those rascals,
those debauchees, the Turks.”
Growing more and more exasperated as he spoke, and
accumulating invective upon invective, his rage at last exceeded all
bounds, and he concluded by commanding us to leave his presence
and await his pleasure.
I saw the Drayhy’s eyes kindle, his nostrils swell, and I dreaded
every instant an explosion of impotent wrath, which could only have
served to drive the king to extremities; but, reflecting that he was
entirely defenceless, he refrained himself, rose with dignity, and
slowly retired to meditate what course he should pursue. All men
trembled before the fury of Ebn Sihoud, and none dared to oppose
his will. For two days and nights we remained in our apartment,
hearing and seeing nothing. No one cared to approach us; even
those who on our first arrival appeared most forward in our service,
either shunned us, or laughed at our easy credulity in the good faith
of a man whose perfidious and sanguinary character was so well
known. We expected momentarily to see the tyrant’s satellites
appear to massacre us, and sought in vain for some means of
extricating ourselves from his grasp. On the third day, the Drayhy,
declaring he preferred death to suspense, sent for one of the
ministers of the Wahabee, named Abou el Sallem, and
commissioned him to deliver this message to his master.
“What you propose to do, do quickly; I shall not reproach you—I shall
blame myself alone for surrendering myself into your hands.”
El Sallem obeyed, but returned not; and our only answer was the
sight of twenty-five armed negroes, who ranged themselves before
our door. We were then decidedly prisoners!—how I deprecated the
foolish curiosity which had so gratuitously drawn me into peril! The
Drayhy had no fear of death; but constraint was insupportable to
him,—he walked to and fro with rapid strides, like a lion before the
bars of his cage, and at last broke out:—
“I am determined to make an end of the matter; I will speak to Ebn
Sihoud and reproach him with his perfidy; I see that mildness and
patience are unavailing, and I am resolved to die with dignity.”
Again he summoned El Sallem; and the moment he appeared,
“Return to your master,” said he, “and inform him that by the faith of
the Bedouins I demand the right of speaking to him: there will still be
time to follow his own pleasure after he has heard me.”
The Wahabee granted an audience, and El Sallem introduced us.
Arrived in his presence, the king left us standing, and made no return
to our customary salutations.
“What do you want?” said he roughly.
The Drayhy, drawing himself up with dignity, replied:
“I am come to see you, O son of Sihoud, on the faith of your
promises, and with a suite of only ten men: I command thousands of
warriors. We are defenceless in your hands, you are in the centre of
your power:—you may crush us like ashes; but know, that from the
frontier of India, to the frontier of Nedgde, in Persia, in Bussora, in
Mesopotamia, Hemad, the two Syrias, Galilee, and Horan, every
man who wears the caftan will demand my blood at your hands, and
will take vengeance for my death. If you are, as you pretend, the
King of the Bedouins, how can you stoop to treachery? that is the
vile practice of the Turks. Treachery is not for the strong, but for the
weak or the cowardly. You who boast of your armies, and claim to
hold your authority from God himself, if you would not tarnish your
glory, restore me to my country, and openly contend with me by force
of arms; for by abusing my confidence, you will dishonour yourself,
render yourself an object of universal contempt, and occasion the
ruin of your kingdom. I have said: now take your pleasure,—but you
will one day repent it. I am only one among thousands; my death will
not diminish my tribe, will not extinguish the race of Cholan. My son
Sahen will supply my place: he remains to lead my Bedouins, and to
avenge my blood. Be warned then, and open your eyes to the truth.”
During this harangue, the king stroked his beard, and gradually
calmed himself. After a moment’s silence:
“Go in peace,” said he; “nothing but good will happen to you.”
We then retired, but were still guarded.
This successful beginning encouraged the courtiers, who had heard
with terror the daring words of the Drayhy, and were astonished at
the tyrant’s endurance of them. They began again to gather round
us, and Abou el Sallem invited us to dinner. But I did not feel very
confident on my own score; I thought indeed Ebn Sihoud might not
venture upon extremities with the Drayhy, but feared lest he might
ascribe his wrongs to my counsels, and sacrifice me, an obscure
giaour, to his resentment. These apprehensions I imparted to the
Drayhy, who reassured me, swearing that no attempt should reach
me but over his corpse, and that I should first pass out through the
gates of Darkisch.
The next day Ebn Sihoud sent for us, received us very graciously,
and had coffee served to us. Presently he began to question the
Drayhy about the persons who accompanied him. My turn is now
coming, thought I, and my heart palpitated a little. I recovered
myself, however; and when the Drayhy had named me, the king,
turning towards me, said:
“You then are Abdallah the Christian?”
And on my answering in the affirmative,
“I see,” continued he, “that your actions are much greater than your
stature.”
“A musket-ball,” I replied, “is small, yet it kills great men.”
He smiled.
“I find it very difficult,” he resumed, “to credit all that I hear of you: I
would have you answer me frankly; what is the object of the alliance
which you have been labouring so many years to accomplish?”
“Its object is very simple,” answered I. “We are desirous to unite all
the Bedouins of Syria under the command of the Drayhy, to resist
the Turks; you may perceive that we are by these means forming an
impenetrable barrier between you and your enemies.”
“Very well,” said he; “but that being your object, why did you
endeavour to destroy my armies before Hama?”
“Because,” I replied, “you were an obstacle to our projects. It was not
for you, but for the Drayhy, that we were labouring. His power once
established in Syria, Mesopotamia, and to the confines of Persia, we
were willing to enter into alliance with you, and become by that
means invulnerable in the possession of our entire liberty. Children
of the same nation, we have but one cause to defend: for this
purpose we came here to cement an indissoluble union with you.
You received us in an offensive manner, and the Drayhy on his part
has reproached you in offensive terms; but our intentions were
sincere, and we have proved them so by confiding ourselves
unarmed to your good faith.”
The king’s countenance cleared up more and more as I spoke; and
when I had ceased, he said,
“I am satisfied.”
Then, turning to his slaves, he ordered three cups of coffee. I
internally thanked God for inspiring me with words that proved so
successful. The rest of the visit passed off well, and we retired well
satisfied. In the evening we were invited by one of the ministers to a
grand supper, and confidentially entertained with the cruelties of his
master, and the universal execration in which he was held. His
immense treasures were also a topic of discussion: those he had
acquired by the pillage of Mecca are incalculable. From the earliest
period of the Hegira, Mussulman princes, the caliphs, the sultans,
and the kings of Persia, send annually to the tomb of the Prophet
considerable presents in jewels, lamps, and candelabras of gold,
precious stones, &c. besides the offerings from the commonalty of
the faithful. The throne alone, the gift of a Persian king, composed of
massive gold, inlaid with pearls and diamonds, was of inestimable
value. Every prince on his accession sends a crown of gold,
enriched with precious stones, to be suspended from the roofs of the
chapel, and they were innumerable when Ebn Sihoud plundered it:
one diamond alone, as large as a walnut, was considered invaluable.
When we consider all that the lapse of centuries had accumulated on
that one point, it is not surprising that the king should have carried
away forty camels laden with jewellery, besides articles of massive
gold and silver. Taking into calculation these inexhaustible treasures,
and the tithes which he raises annually from his allies, I think he may
be regarded as the richest monarch upon earth; especially as his
expenses are very trifling,—as he rigorously prohibits luxury, and as
in time of war each tribe furnishes subsistence for its armies, and
bears all its own charges and losses, for which no compensation is
ever recovered.
So delighted was I with the recovery of my liberty, that I spent all the
next day in walking about and visiting every part of Darkisch and its
environs. The town, built of white stone, contains seven thousand
inhabitants, almost all kinsmen, ministers, or generals of Ebn
Sihoud. No artizans are found there. The only trades exercised in the
town are those of armourers and farriers, and few persons are
engaged even in them. Nothing is to be purchased, not even food,
for which every one depends on his own means,—that is to say,
upon an estate or garden, producing corn, vegetables and fruits, and
affording nourishment to a few fowls. Their numerous herds browse
in the plain; and every Wednesday the inhabitants of Yemen and
Mecca assemble to exchange their merchandise for cattle; a species
of fair, which forms the sole commerce of the country. The women
appear unveiled, but throw their black mantles over their faces,—a
very disgraceful custom: they are generally ugly and excessively
dark-complexioned. The gardens, situated in a charming valley near
the town, on the opposite side to that by which we had entered,
produce the finest fruits in the world,—bananas, oranges,
pomegranates, figs, apples, melons, &c. intermixed with barley and
maize,—and are carefully watered.
The next morning, the king again summoned us to him, received us
very graciously, and questioned me closely respecting the various
European sovereigns, especially Napoleon, for whom he testified
great admiration. Nothing delighted him so much as the recital of the
emperor’s conquests; and happily my frequent intercourse with M.
Lascaris had furnished me with many details to entertain him with. At
the account of every battle, he would exclaim—
“Surely this man is an emissary of God: I am persuaded he must be
in intimate communion with his Creator, since he is thus singularly
favoured.”
His affability towards me having gradually but rapidly increased, he
suddenly changed the subject of conversation, and said at last,
“Abdallah, I desire to hear the truth from you: what is the basis of
Christianity?”
Aware of the Wahabee’s prejudices, I trembled at this question; but
mentally praying for divine inspiration,
“The basis of all religion, O son of Sihoud!” I said, “is belief in God.
The Christians deem, as you do, that there is one only God, the
Creator of the universe; who punishes the wicked, pardons the
penitent, and recompenses the good: that He alone is great,
merciful, and almighty.”
“Very well,” said he; “but how do you pray?”
I repeated the Pater-noster: he made his secretary write at my
dictation, read and re-read it, and placed it inside his vest; then,
pursuing his interrogatory, asked me to which side we turned to pray.
“We pray on all sides,” answered I, “for God is everywhere.”
“That opinion I entirely approve,” said he: “but you must have
precepts as well as prayers.”
I repeated the ten commandments given by God to his prophet
Moses, which he appeared to know, and continued his inquiries.
“And Jesus Christ,—in what light do you consider him?”
“As the Incarnate Word of God.”
“But he was crucified?”
“As the Divine Word, he could not die; but as man, he suffered for
the sins of the wicked.”
“That is marvellous. And the sacred book which God inspired
through Jesus Christ, is it revered among you?—do you exactly
conform to its doctrine?”
“We preserve it with the greatest reverence, and in all things obey its
injunctions.”
“The Turks,” said he, “have made a god of their prophet, and pray
over his tomb like idolaters. Cursed be those who ascribe to the
Creator an equal! may the sabre exterminate them!”
His invectives against the Turks increasing in vehemence, he
proceeded to censure the use of the pipe, of wine, and of unclean
meats; while I was too happy in having adroitly extricated myself
from the discussion of dangerous questions, to presume to
contradict him on insignificant points, and allowed him to believe me
a despiser of that villanous herb, as he called tobacco; which drew a
smile from the Drayhy, who was well aware that the present
prohibition of it was the greatest possible privation to me, and that I
availed myself of every opportunity which promised impunity to
withdraw my beloved pipe from its concealment: that day, in
particular, my longing for it was extreme, having talked much and
drunk very strong Mocha coffee.
The king appeared delighted with our conversation, and said to me,
—“I see that we may always learn something. I have hitherto
believed the Christians to be the most superstitious of men; but I am
now convinced that they approach much nearer to the true religion
than the Turks.”
Ebn Sihoud is on the whole a well-informed and very eloquent man,
but fanatical in his religious opinions: he has a legitimate wife and a
concubine; two sons, both married, and a daughter still young. He
eats nothing but what is prepared by his wives, for fear of being
poisoned. The guard of his palace is committed to a troop of a
thousand well-armed negroes. He can raise within his territories
fifteen hundred thousand Bedouins capable of bearing arms. When
he intends to nominate the governor of a province, he invites the
person on whom his choice has fallen to dinner, and after the repast
they unite in ablutions and prayer; after which the king, arming him
with a sabre, says to him,—
“I have elected you, by command of God, to govern these slaves: be
humane and just; gather punctually the tithe, and cut off the heads of
Turks and infidels who say that God has an equal—let none such
establish themselves within your jurisdiction. May the Lord give
victory to those who believe in his unity!”
He then delivers to him a small writing, enjoining the inhabitants to
obey the governor in all things, under the severest penalties.
The next day we visited the king’s stables; and I think it would be
impossible for an amateur of horses to have a more gratifying sight.
The first objects of attention were twenty-four white mares, ranged in
single file, all of incomparable beauty, and so exactly alike that it was
not possible to distinguish the one from the other: their hair, brilliant
as silver, dazzled my eyes. A hundred and twenty others, of various
coats, but equally elegant in form, occupied another building; and
even I, notwithstanding my antipathy to horses since the accident
which had so nearly cost my life, could not help admiring the
beautiful tenants of these stables.
We supped that evening with Hedal, the general-in-chief, who was
reconciled with the Drayhy; and the famous Abou Nocta, who was of
the party, was extremely polite to him. For several days we met in
secret conclave, treating with Ebn Sihoud; but the details of the
negotiation would be superfluous. It is sufficient to say, that an
alliance was concluded between him and the Drayhy to their mutual
satisfaction, and the king declared that their two bodies would be
henceforth directed by one soul. The treaty being ratified, he invited
us for the first time to eat with him, and tasted each dish before it
was offered to us. As he had never seen any one eat otherwise than
with their fingers, I carved a spoon and fork out of a piece of wood,
spread my handkerchief for a napkin, and ate my dinner after the
European fashion, which highly diverted him.
“Thanks be to God!” said he, “every nation believes its customs the
best possible, and each is therefore content with its condition.”
Our departure being fixed for the following day, the king sent us as a
present seven of his most beautiful mares, their bridles held by as
many black slaves mounted on camels; and when each of us had
made his choice, we were presented with sabres, the blades of
which were very handsome, but the scabbards quite unornamented.
To our servants also he gave more ordinary sabres, saddle-cloths,
and a hundred tallarins each.
We took leave of Ebn Sihoud with the customary ceremonies, and
were accompanied beyond the walls by all the officers of his court.
Arrived at the gates, the Drayhy stopped, and turning to me, invited
me to pass first, wishing, he told me, with a smile, to keep his
promise. And I confess, that all the civilities we had latterly received,
had not so far effaced from my mind the impression of the suspense
and anguish we had previously experienced, but that I rejoiced to
find myself beyond the barriers.
We took the road to Heggias, resting every night with one of the
tribes which overspread the desert. The fifth day, after passing the
night under the tents of El Henadi, we rose with the sun, and went
out to saddle our dromedaries; but found them, to our great
amazement, with their heads plunged deeply into the sand, from
whence it was impossible to disengage them. Calling to our aid the
Bedouins of the tribe, they informed us that the circumstance
presaged the simoom, which would not long delay its devastating
course, and that we could not proceed without facing certain death.
Providence has endowed the camel with an instinctive presentiment
for its preservation. It is sensible two or three hours beforehand of
the approach of this terrific scourge of the desert, and turning its face
away from the wind, buries itself in the sand; and neither force nor
want can move it from its position, either to eat or drink, while the
tempest lasts, though it should be for several days.
Learning the danger which threatened us, we shared the general
terror, and hastened to adopt all the precautions enjoined us. Horses
must not only be placed under shelter, but have their heads covered
and their ears stopped; they would otherwise be suffocated by the
whirlwinds of fine and subtle sand which the wind sweeps furiously
before it. Men assemble under their tents, stopping up every crevice
with extreme caution; and having provided themselves with water
placed within reach, throw themselves on the ground, covering their
heads with a mantle, and stir no more till the desolating hurricane
has passed.
That morning all was tumult in the camp; every one endeavouring to
provide for the safety of his beasts, and then precipitately retiring
under the protection of his tent. We had scarcely time to secure our
beautiful Nedgde mares before the storm began. Furious gusts of
wind were succeeded by clouds of red and burning sands, whirling
round with fierce impetuosity, and overthrowing or burying under
their drifted mountains whatever they encountered. If any part of the
body is by accident exposed to its touch, the flesh swells as if a hot
iron had been passed over it. The water intended to refresh us with
its coolness was boiling, and the temperature of the tent exceeded
that of a Turkish bath. The tempest lasted ten hours in its greatest
fury, and then gradually sunk for the following six: another hour, and
we must all have been suffocated. When at length we ventured to
issue from our tents, a dreadful spectacle awaited us: five children,
two women, and a man were extended dead on the still burning
sand; and several Bedouins had their faces blackened and entirely
calcined, as if by the action of an ardent furnace. When any one is
struck on the head by the simoom, the blood flows in torrents from
his mouth and nostrils, his face swells and turns black, and he soon
dies of suffocation. We thanked the Lord that we had not ourselves
been surprised by this terrible scourge in the midst of the desert, but
had been preserved from so frightful a death.
When the weather permitted us to leave the camp of Henadi, twelve
hours’ march brought us back to our tribe. I embraced Sheik Ibrahim
with true filial love, and several days elapsed in the mutual recital of
our adventures. When I had perfectly recovered my fatigues, M.
Lascaris said to me:
“My dear son, we have no longer any business here. Thanks be to
God, all is accomplished! and my enterprise has succeeded beyond
my most sanguine hopes: we must now return to give an account of
our mission.”
We quitted our friends in the hope of soon seeing them at the head
of the expedition to which we had opened and smoothed the way.
Passing through Damascus, Aleppo, and Caramania, we reached
Constantinople in the month of April, after ninety days’ travelling,
frequently across tracts of snow. In the course of that fatiguing
journey I lost my handsome Nedgdian mare, the gift of Ebn Sihoud,
which I had calculated on selling for at least thirty thousand piastres:
but this was only the forerunner of the misfortunes which awaited us.
Constantinople was ravaged by the plague; and General Andreossi
lodged us at Keghat-Kani, where we spent three months in
quarantine, and, during that time, were informed of the fatal
catastrophe of Moscow and the retreat of the French army upon
Paris. M. Lascaris was in despair, and for two months his plan of
proceeding was quite undecided. At length, determining to return into
Syria, and there wait the issue of events, we embarked on board a
vessel freighted with corn; but a violent storm drove us to Chios,
where we again encountered the plague. M. de Bourville, the French
consul, procured us a lodging, in which we remained for two months
closely shut up; and there, our property having become a prey to the
tempest, while contagion cut us off from all external communication,
we were nearly without clothing, and exposed to the greatest
privations.
Communications were at length restored; and M. Lascaris having
received a letter from our consul-general at Smyrna, inviting him to a
conference there with the Generals Lallemand and Savary,
determined to comply, and allowed me meanwhile to visit my poor
mother, whom I had not seen for six years.
My travels no longer offering any thing of interest to the public, I shall
pass over the interval which elapsed between my separation from M.
Lascaris and my return to Syria, and hasten to the melancholy
conclusion.
While staying at Latakia with my mother, and daily expecting the
arrival of a ship that might transport me to Egypt, where I had been
ordered by M. Lascaris to rejoin him, I saw a French brig of war enter
the port, and hastened to inquire for letters. Alas! those letters
brought me the afflicting intelligence of the decease of my benefactor
at Cairo. My grief baffled description: I entertained a filial affection for
M. Lascaris; besides which, all my future prospects had expired with
him. M. Drovetti, French consul in Alexandria, wrote to desire I would
come to him as soon as possible; but it was forty days before I could
find an opportunity of embarking, and when I reached Alexandria, M.
Drovetti had set out for Upper Egypt; thither I followed, and overtook
him at Asscout. He informed me that M. Lascaris having entered
Egypt with an English passport, Mr. Salt, the English consul, had
taken possession of all his effects. He persuaded me, therefore, to
apply to that gentleman for payment of my stipend of five hundred
tallarins per annum, which was nearly six years in arrear; and
especially recommended me to insist strongly on the restitution of M.
Lascaris’s manuscript journal, a document of vast importance.
I immediately returned to Cairo; but Mr. Salt received me very coldly,
and told me that M. Lascaris having died under English protection,
he had transmitted his property and papers to England. All my
attempts were therefore futile; and after a long detention at Cairo, in
the vain hope of obtaining either payment of my arrears or the
papers of my patron, Mr. Salt at last menaced me with procuring my
arrest by the Egyptian authorities; and to the protection of M. Drovetti
alone I owe my escape from this new peril. Weary of so profitless a
struggle, I returned to Latakia and my family, more unhappy and less
rich than I had at first quitted it on my expedition to Aleppo.

END OF FATALLA SAYEGHIR’S STORY.

NOTE.
It was my intention to have added here a few translations, for the
purpose of giving the reader some idea of modern Arabian poetry;
but I understand that an able hand, and one more practised than
mine, is already employed on the task. A volume, entitled A
Miscellany of French and Oriental Literature, by J. Augoub, will
appear in a few days.[U] I was acquainted with the author, a young
poet of the highest promise, prematurely snatched from his family
and his fame. He was born in Egypt, and had been educated in
France. The original fragments which he has left behind, and
doubtless also these translations, breathe the deep and ardent
colouring of his native skies, combined with the purity of French
taste. These works, published by his widow, are the only legacy he
has bequeathed to his family and his country.
I have inserted in these volumes a few fragments extracted from the
publication here announced, assured that they will but stimulate the
reader’s desire for a further acquaintance with them.
A. de Lamartine.
15th April, 1835.
MAOULS,
Or Popular Romances of the Modern Arabs; extracted
from a Collection entitled, “A Miscellany of French
and Oriental Literature,” by J. Augoub.
Now that thy stature, like the young shoot of a palm, is slender and
graceful, grant me thy caresses. O my best beloved, let us make use
of time as it flies! Close not against love the avenue to thy favour.
Believe me, beauty is evanescent; its empire has never yet been
prolonged for a mortal.
They have compared thee to the queen of the nightly firmament; but
how greatly do they err in their language! Has the moon those
beautiful black eyes, with their sparkling pupils? The rushes bend
and sway before the gentlest breath of the zephyr; thou, who
resemblest them by thy slight figure—thou seest all men bend before
thee!
If the torment of my heart causes happiness to thine, torment me; for
my happiness is bound up in thine,—if, indeed, thine is not far dearer
to me than my own. If thou wishest to take my life—if the sacrifice of
it is necessary to thee—take it, O thou who alone art my life, and
incense not thyself against me!
What harm would it be, young beauty, if thou shouldest treat me with
more justice? Thou wouldest cure my grievous malady by a remedy
which would relieve me from the necessity of having recourse to the
Canon of Avicene.[V] Whenever I contemplate thy beautiful
eyebrows, I recognize in them the graceful contour of the houn;[W]
and thy voice is sweeter to my ear than the sound of the harp and
the cithern.[X]
When my best beloved passed by, the branch of the neighbouring
willow was jealous of her delicate figure; the rose bent her head for
shame when she saw the bright colour of her cheek; and I

You might also like