Scribd
Upload
503 views

Assignment-1 Solution

Question 3 provides a linear programming

Uploaded by

Bhavish Adwani
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
503 views

Assignment-1 Solution

Question 3 provides a linear programming

Uploaded by

Bhavish Adwani
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Question 1) Formulate a linear Programming Problem:

Captain Stubing of The Pacific Princess seeks to maximize the return for their scheduled 14 day
tour of Europe and has a number of options available to him. He can ply his guests with alcohol,
upsell them on fancier restaurant fare or include more expensive excursion options. These
alternatives are not without tradeoffs, since different guests prefer different options, depending
largely on their age and wherewithal. Among the limitations Captain Stubing must consider is
the number of excursions; they must offer at least five alternatives per day for each the ten
days they will reach port. In addition, the restaurant choices must exceed 12 major styles of
cuisine and the bar themes down in The Grotto should rotate every other day for the 14 days.
It's possible to rotate them twice a day, but any more than that and poor Isaac spends more
time tearing down and setting up than he does mixing libations. Ideally, there should be at
least one different bar theme for every cuisine type. The total budget for excursions, restaurants
and bar has been set by the parent company at $150,000. It costs $1,500 to stock supplies for
a major cuisine category, it costs $5,000 to include each different excursion, and it costs $900
to set up with a different bar theme. Based on historical data, Captain Stubing believes that
each new bar setup will generate $1,500 profit, each new cuisine type will bring in $5,000, and
each excursion type will generate $17,000 for the ship.

Solution: Max Z = 1500B + 5000C + 17000E


subject to:
900B + 1500C + 5000E ≤ 150,000
E≥5
C ≥ 12
B≥7
B ≤ 28
C-B≤0

Question 2) Solve the Linear Programming problem Graphically


Tracksaws, Inc. makes tractors and lawn mowers. The firm makes a profit of $30 on each tractor
and $30 on each lawn mower, and they sell all they can produce. The time requirements in
the machine shop, fabrication, and tractor assembly are given in the table.

Formulation:
Let x = number of tractors produced per period
y = number of lawn mowers produced per period
MAX 30x + 30y
subject to 2x + y ≤ 60
2x + 3y ≤ 120
x ≤ 45
The graphical solution is shown below.
Question3) Sensitivity Analysis
Consider the following linear program, which maximizes profit for two products--regular (R) and
super (S):

MAX 50R + 75S


s.t.
1.2 R + 1.6 S ≤ 600 assembly (hours)
0.8 R + 0.5 S ≤ 300 paint (hours)
.16 R + 0.4 S ≤ 100 inspection (hours)

Sensitivity Report:

Final Reduced Objective Allowable Allowable


Cell Name Value Cost Coefficient Increase Decrease
$B$7 Regular = 291.67 0.00 50 70 20
$C$7 Super = 133.33 0.00 75 50 43.75

Final Shadow Constraint Allowable Allowable


Cell Name Value Price R.H. Side Increase Decrease
$E$3 Assembly (hr/unit) 563.33 0.00 600 1E+30 36.67
$E$4 Paint (hr/unit) 300.00 33.33 300 39.29 175
$E$5 Inspect (hr/unit) 100.00 145.83 100 12.94 40

a) The optimal number of regular products to produce is ________, and the optimal
number of super products to produce is ________, for total profits of ________.

Answer: 291.67, 133.33, $24,583


b) If the company wanted to increase the available hours for one of their constraints
(assembly, painting, or inspection) by two hours, they should increase ________.

Answer: inspection

c) The profit on the super product could increase by ________ without affecting the
product mix.

Answer: $50

d) If downtime reduced the available capacity for painting by 40 hours (from 300 to 260
hours), profits would be reduced by ________.
Answer: $1,333

e) A change in the market has increased the profit on the super product by $5. Total profit
will increase by ________.
Answer: $667

f) Explain the term shadow price.

g) Give range of feasibility for Paint.

h) What is the range of optimality for regular product?

Question 4) Madlantic Devices designs and manufactures high-end medical devices. The
facilities in Madison and Atlanta serve as design and component manufacturing facilities.
Components are then shipped to warehouses in Philadelphia or Knoxville, where they are held
until final assembly is completed at either Dayton, Bloomington, or Albany.

Manufacturing capacity in Madison and Atlanta is 1000 units. Demand at Dayton,


Bloomington, and Albany is 450, 500, and 610, respectively.

The network representing the shipping routs is shown below.


The costs for shipping between each facility is shown below. A blank cell indicates that
shipping between two facilities is not permitted.

a) What is the objective function for this problem? Use the notation Xij, where i and j
correspond to the node numbers indicated in the diagram.

: MIN 7X13 + 8X14 + 4X23 + 7X24 + 3X34 + 3X43 + 25X35 + 6X36 + 17X37 + 29X45 + 8X46 + 5X47

b) What is the constraint for the transshipment node in Knoxville?

Answer: X14 + X24 + X34 - X43 - X45 - X46 - X47 = 0

c) What is the constraint for Bloomington?

Answer: X36 + X46 = 500

You might also like