MATWRLD PROBLEM SET 5

NAME/S: __________________________________________________________________________

INSTRUCTIONS: Do the following problems completely. IF solutions are needed, include them. NO
solutions, NO credit. Present your answers neatly. You may work alone or work with a partner. If you
work with a partner, BOTH of you should submit your work individually and include both of your names
in the submission.

HERE ARE YOUR OPTIONS:

(1) Download and print this document and then use pen/pencil to answer the problems. Then sign each
page before scanning them. Paste ALL the photos in a SINGLE document file and then save as a PDF
file.
(2) Download this document and then use an electronic device to WRITE solutions and answers. DO
NOT TYPESET. Save your work in PDF file format.

ITEM 1. Consider the given graph below. Use Djikstra’s algorithm to determine the shortest path from
the vertex G to ALL THE OTHER vertices of the graph. On the graph, show the updates on the vertex
labels. (20 points)

Vertex G Distance Path

to
G to I

G to A

G to H

G to E

G to D

G to B

G to C

G to F
ITEM 2. Consider the problem of a toy company that produces toy planes and toy boats. The toy
company can sell its planes for $10 and its boats for $8 dollars. A plane requires 3 hours to make and 1
hour to finish while a boat requires 1 hour to make and 2 hours to finish. The toy company knows it will
not sell more than 35 planes per week. Further, given the number of workers, the company cannot spend
more than 160 hours per week finishing toys and 120 hours per week making toys. The company wishes
to maximize the sales/revenue it makes by choosing how much of each toy to produce. (20 pts)
Formulate the linear programming model that From the given feasible region below, determine
maximizes sales/revenue by identifying the its corner points. Substitute them in the objective
decision variables, objective function, and function. Show necessary solutions. What is the
constraints. maximum sales?
ITEM 3. A retailer has leased a new space in a shopping mall and wants to place four sections (A,B,C,D)
in four locations (W,X,Y,Z) so as to maximize total profits. The table below gives the daily profits (in
thousands of pesos) when the sections are assigned to the various locations. Find the assignment that
MAXIMIZES total profits. Use the available tables AS NEEDED. (20 pts)

W X Y Z
A 55 55 90 65
B 80 60 68 45
C 90 75 80 60 W X Y Z
D 50 90 100 80 A
B
W X Y Z C
A D
B
C W X Y Z
D A
B
W X Y Z C
A D
B
C W X Y Z
D A
B
W X Y Z C
A D
B
C FINAL ANSWER:
D
Section A is assigned to location _____ with
profit ____
W X Y Z
A Section B is assigned to location _____ with
B profit ____
C
D Section C is assigned to location _____ with
profit ____
W X Y Z
A Section D is assigned to location _____ with
B profit ____
C
D The MAXIMUM total profit is _______.