ASSIGNMENT QUESTIONS

NO STUDENT QUESTION
NAME
1 Maçka Police Station employs 30 police officers. Each officer works for 5
days per week. The crime rate fluctuates with the day of week, so the
number of the police officers required each day depends on which day of
the week it is: Monday, 18; Tuesday, 24; Wednesday, 25; Thursday, 16;
Friday, 21; Saturday, 28; Sunday, 18. The Police Station wants to schedule
police officers to minimize the number whose days off are not consecutive.
Formulate an LP that will accomplish this goal.
2 The Airline Company builds commercial airplanes and the last stage in the
production process is to produce the jet engines and then to install them in
the completed airplane frame. The company has been working under some
contracts to deliver airplanes in the near future, and the production of the
jet
engines for these planes must now be scheduled for the next 4 months. To
meet the contracted dates for delivery, the company must supply engines
for installation in the quantities indicated in the second column of the Table.
The facilities that will be available for producing the engines vary according
to
works scheduled during this period. The resulting monthly differences in the
maximum number that can be produced and the cost (in millions of dollars)
of producing each one is given in the third and fourth columns of Table.
Because of the variations in production costs, it may well be worthwhile to
produce some of the engines a month or more before they are scheduled
for installation. The drawback is that such engines must be stored until the
scheduled installation (the airplane frames will not be ready early) at storage
cost of $100,000 per month for each engine.

The production manager wants a schedule developed for the number of

engines to be produced in each of the 4 months so that the total of the
production and storage costs will be minimized.
a) Formulate a balanced transportation model for the problem (Form
the transportation tableau).
b) Find a basic feasible solution to the transportation problem in part a
using minimum cost method.
c) c) Find a basic feasible solution to the following transportation
problem using Least-Cost method.
3

4 A freight plane has three large compartments to carry cargo. Weight and
volume limitations of these compartments are:

There are four cargos waiting to be loaded in this plane. Properties of these
cargos are shown on the table below:

Furthermore, the weight of the cargo in the respective compartments must

be the same proportion of that compartment's weight capacity to maintain
the balance of the plane. Any proportion of these cargoes can be accepted.
Formulate a linear programming model to maximize the profit by choosing
how many tons of which cargo to load on the plane under these
circumstances.
5 Silicon Valley Corporation (Silvco) manufactures transistors. An important
aspect of the manufacture of transistors is the melting of the element
germanium (a major component of a transistor) in a furnace.
Unfortunately, the melting process yields germanium of highly variable
quality.
Two methods can be used to melt germanium; method 1 costs $50 per
transistor, and method 2 costs $70 per transistor. The qualities of
germanium obtained by methods 1 and 2 are shown in Table 1. Grade
1 is poor while grade 4 is excellent. The quality of the germanium dictates
 the quality of the manufactured transistor.
Silvco can refire melted germanium in an attempt to improve its quality. It
costs $25 to refire the melted germanium for one transistor. The results of
the refiring process are shown in Table 2. Silvco has sufficient furnace
capacity to melt or refire germanium for at most 20,000 transistors per
month.
Silvco’s monthly demands are for 1,000 grade 4 transistors, 2,000 grade 3
transistors, 3,000 grade 2 transistors, and 3,000 grade 1 transistors.
Formulate an LP model in general form to minimize the cost of producing
the needed transistors.

6 Consider the following problem.

Because this primal problem has more functional constraints than variables,
suppose that the simplex method has been applied directly to its dual
problem. If we let s1 and s2 denote the slack variables for this dual problem,
the resulting final simplex tableau is
 For each of the following independent changes in the original primal model,
you now are to conduct sensitivity analysis by directly investigating the
effect on the dual problem and then inferring the complementary effect on
the primal problem.
a) Find the allowable range in the objective function coefficient of y1 to
remain the current basis optimal.
b) If the objective function coefficient of y1 is changed to 3, what
would be the new optimal W?
c) Find the allowable range in the right-hand side of the first constraint
to remain the current basis optimal.
d) d) If the right-hand side of the first constraint is changed to 5, what
would be the new optimal W?
7 Three electric power plants with capacities of 25, 40, and 30 million kWh
supply electricity to three cities. The maximum demands at the three cities
are estimated at 30, 35, and 25 million kWh. The price per million kWh at
the three cities is given in Table, below. During the month of August, there is
a 20% increase in demand at each of the three cities, which can be met by
purchasing electricity from another network at a premium rate of $1000 per
million kWh. The network is not linked to city 3, however. The utility
company wishes to determine the most economical plan for the distribution
and purchase of additional energy.

a) Formulate the problem as a transportation model (Show LP

formulation and form the transportation tableau).
b) Determine an optimal distribution plan for the utility company using
transportation simplex method (Use Vogel to find initial solution)
8 You and several friends are about to prepare a lasagna dinner. The tasks to
be performed, their immediate predecessors, and their estimated durations
are as follows:
 (a) Construct the project network for preparing this dinner.
(b) Find all the paths and path lengths through this project network. Which
of these paths is a critical path?
(c) Find the earliest start time and earliest finish time for each activity.
(d) Find the latest start time and latest finish time for each activity.
(e) Find the slack for each activity. Which of the paths is a critical path?
(f) Because of a phone call, you were interrupted for 6 minutes when you
should have been cutting the onions and mushrooms.
By how much will the dinner be delayed? If you use your food processor,
which reduces the cutting time from 7 to 2 minutes, will the dinner still be
delayed?
9 Ken Johnston, the data processing manager for Stanley Morgan Bank, is
planning a project to install a new management information system. He now
is ready to start the project and wishes to finish in 20 weeks. After
identifying the 14 separate activities needed to carry out this project, as well
as their precedence relationships and estimated durations (in weeks), Ken
has constructed the following project network:
 (a) Find all the paths and path lengths through this project network. Which
of these paths is a critical path?
(b) Find the earliest times, latest times, and slack for each activity. Will Ken
be able to meet his deadline if no delays occur?
(c) Use the information from part (b) to determine which of the paths is a
critical path. What does this tell Ken about which activities he should focus
most of his attention on for staying on schedule?
(d) Use the information from part (b) to determine what the duration of the
project would be if the only delay is that activity I takes 2 extra weeks. What
if the only delay is that activity H takes 2 extra weeks? What if the only delay
is that activity J takes 2 extra weeks?
10 Solve the following assignment problem

11 Montega is a developing country which has 15,000,000 acres of publicly

controlled agricultural land in active use. Its government currently is
planning a way to divide this land among three basic crops (labeled 1, 2, and
3) next year. A certain percentage of each of these crops is exported to
obtain badly needed foreign capital (dollars), and the rest of each of these
crops is used to feed the populace. Raising these crops also provides
employment for a significant proportion of the population. Therefore, the
main factors to be considered in allocating the land to these crops are (1)
the amount of foreign capital generated, (2) the number of citizens fed,
and (3) the number of citizens employed in raising these crops.
The following table shows how much each 1,000 acres of each crop
contributes toward these factors, and the last column gives the goal
established by the government for each of these factors.
 In evaluating the relative seriousness of not achieving these goals, the
government has concluded that the following deviations from the goals
should be considered equally undesirable: (1) each $100 under the foreign-
capital goal, (2) each person under the citizens-fed goal, and (3) each
deviation of one (in either direction) from the citizens-employed goal.
(a) Formulate a goal programming model for this problem.
(b) Reformulate this model as a linear programming model.
(c) Use the simplex method to solve this model.
(d) Now suppose that the government concludes that the importance of the
various goals differs greatly so that a preemptive goal programming
approach should be used. In particular, the first priority goal is citizens fed
≥1,750,000, the second-priority goal is foreign capital ≥ $70,000,000, and the
third-priority goal is citizens employed = 200,000. Use the goal programming
technique to formulate one complete linear programming model for this
problem.
(e) Use the streamlined procedure to solve the problem as formulated in
part (d).
(f) Use the sequential procedure to solve the problem as presented in part
(d)
12 Beerco manufactures ale and beer from corn, hops, and malt. Currently 40
lb. of corn, 30 lb. of hop, and 40 lb. of malt are available. A barrel of ale sells
for $40 and requires 1 lb. of corn, 1 lb. of hop, and 2 lb.
of malt. A barrel of beer sells for $50 and requires 2 lb. of corn, 1 lb. of hop,
and 1 lb. of malt. Beerco wants to maximize total sales revenue. Examine the
given optimal tableau for the LP model of problem and answer the following
questions.
a) What are the optimal values of primal decision variables (ALE and BEER)
and the optimal values of
dual decision variables (y1, y2, y3)?
b) Suppose Beerco is considering manufacturing malt liquor. A barrel of malt
liquor may be sold for $50 and requires 0.5 lb. of corn, 3 lb. of hop, and 3 lb.
of malt. Should Beerco manufacture and sell any malt liquor? (utilize
“duality and sensitivity analysis”)
Optimal tableau:
 Optimal value of ALE: …………… Optimal value of BEER: ……………
Optimal value of y1: …………… Optimal value of y2: …………… Optimal value of
y3: ……………
13 Management of the Albert Franko Co. has established goals for the market
share it wants each of the company’s two new products to capture in their
respective markets. Specifically, management wants Product 1 to capture at
least 15 percent of its market and Product 2 to capture at least 10 percent of
its market. Three advertising campaigns are being planned to try to achieve
these market shares.
One is targeted directly on the first product. The second targets the second
product. The third is intended to enhance the general reputation of the
company and its products. Letting x1, x2, and x3 be the amount of money
allocated (in millions of dollars) to these respective campaigns, the resulting
market share (expressed as a percentage) for the two products are
estimated to be
Market share for Product 1 = 0.5x1 + 0.2x3,
Market share for Product 2 = 0.3x2 + 0.2x3.
A total of $55 million is available for the three advertising campaigns, but
management wants at least $10 million devoted to the third campaign. If
both market share goals cannot be achieved, management considers each 1
percent decrease in the market share from the goal to be equally serious for
the two products.
In this light, management wants to know how to most effectively allocate
the available money to the three campaigns.
(a) Formulate a goal programming model for this problem.
(b) Reformulate this model as a linear programming model.
(c) Use the simplex method to solve this model.
14 Consider the following problem:

Let x4 and x5 represents the slack variables for constraints 1 and 2

respectively.
The optimal table is given below:
Then consider the following changes in the model independently. State for
each case, whether the set of current basic variables or their values change
or not, and then if they change, then find the new optimal set of basic
variables and the new optimal solution.