Scribd
Upload
156 views

Steve Malunes - Assessment (Module 3) - Introduction To Optimization and Linear Programming

The document provides 10 practice problems related to optimization and linear programming for students to solve, including formulating LP models, sketching feasible regions, and determining optimal solutions through various methods like enumerating corner points or using level curves. The problems cover a range of scenarios involving production planning, marketing, and manufacturing to maximize profits within given constraints.

Uploaded by

SteveN.Malunes
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
156 views

Steve Malunes - Assessment (Module 3) - Introduction To Optimization and Linear Programming

The document provides 10 practice problems related to optimization and linear programming for students to solve, including formulating LP models, sketching feasible regions, and determining optimal solutions through various methods like enumerating corner points or using level curves. The problems cover a range of scenarios involving production planning, marketing, and manufacturing to maximize profits within given constraints.

Uploaded by

SteveN.Malunes
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

POLYTECHNIC UNIVERSITY OF THE PHILIPPINES PAG

E \*
Name:
Program and Section: BSBA-MM 4-1
Date:
Topic: Introduction to Optimization and Linear Programming

Activities/Assessment:

Answer the following problems on a clean sheet of paper.

1. An LP model can have more than one optimal solution. Is it possible for an LP model
to have exactly two optimal solutions? Why or why not?

2. In the solution to the Blue Ridge Hot Tubs problem, the optimal values for X1 and X2
turned out to be integers (whole numbers). Is this a general property of the solutions to
LP problems? In other words, will the solution to an LP problem always consist of
integers? Why or why not?

3. Solve the following LP problem graphically by enumerating the corner points.

MAX: 3X1 + 4X2


Subject to: X1 < 12
X2 < 10
4X1 + 6X2 < 72
X1, X2 >0

4. Solve the following LP problem graphically using level curves.

MAX: 2X1 + 5X2


Subject to: 6X1 + 5X2 < 60
2X1 + 3X2 < 24
3X1 + 6X2 < 48
X1, X2 >0

5. The Electrotech Corporation manufactures two industrial-sized electrical devices:


generators and alternators. Both of these products require wiring and testing during
the assembly process. Each generator requires 2 hours of wiring and 1 hour of test ing
and can be sold for a $250 profit. Each alternator requires 3 hours of wiring and 2
hours of testing and can be sold for a $150 profit. There are 260 hours of wiring time
and 140 hours of testing time available in the next production period, and Electrotech
wants to maximize profit.

a. Formulate an LP model for this problem.


Z = 250
POLYTECHNIC UNIVERSITY OF THE PHILIPPINES PAG
E \*
b. Sketch the feasible region for this problem.
c.Determine the optimal solution to this problem using level curves.

6. The marketing manager for Mountain Mist soda needs to decide how many TV spots
and magazine ads to run during the next quarter. Each TV spot costs $5,000 and is
expected to increase sales by 300,000 cans. Each magazine ad costs $2,000 and is
expected to increase sales by 500,000 cans. A total of $100,000 may be spent on TV
and magazine ads; however, Mountain Mist wants to spend no more than $70,000 on
TV spots and no more than $50,000 on magazine ads. Mountain Mist earns a profit of
$0.05 on each can it sells.

a. Formulate an LP model for this problem.


b. Sketch the feasible region for this problem.
c. Find the optimal solution to the problem using level curves.

7. To determine the feasible region associated with less than or equal to constraints or
greater than or equal to constraints, we graphed these constraints as if they were
equal to constraints. Why is this possible?

8. Zippy motorcycle manufacturing produces two popular pocket bikes (miniature


motorcycles with 49cc engines): the Razor and the Zoomer. In the coming week, the
manufacturer wants to produce up to 700 bikes and wants to ensure the number of
Razors produced does not exceed the number of Zoomers by more than 300. Each
Razor produced and sold results in a profit of $70, while each Zoomer results in a
profit of $40. The bikes are identical mechanically and only differ in the appearance of
the polymer-based trim around the fuel tank and seat. Each Razor’s trim requires 2
pounds of polymer and 3 hours of production time, while each Zoomer requires 1
pound of polymer and 4 hours of production time. Assume that 900 pounds of polymer
and 2,400 labor hours are available for production of these items in the coming week.

a. Formulate an LP model for this problem.


b. Sketch the feasible region for this problem.
c. What is the optimal solution?

9. PC-Express is a computer retail store that sells desktops and laptops. The company
earns $600 on each desktop computer it sells and $900 on each laptop. The
computers PC-Express sells are actually manufactured by another company. This
manufacturer has a special order to fill for another customer and cannot ship more
than 80 desktops and 75 laptops to PC-Express next month. The employees at PC-
Express must spend about 2 hours installing software and checking each desktop
computer they sell. They spend roughly 3 hours to complete this process for laptop
POLYTECHNIC UNIVERSITY OF THE PHILIPPINES PAG
E \*
computers. They expect to have about 300 hours available for this purpose during the
next month. The store’s management is fairly certain that they can sell all the
computers they order but are unsure how many desktops and laptops they should
order to maximize profits.

a. Formulate an LP model for this problem.


b. Sketch the feasible region for this model.
c. Find the optimal solution to the problem by enumerating the corner points.

10. Sanderson Manufacturing produces ornate, decorative wood frame doors and
windows. Each item produced goes through three manufacturing processes: cutting,
sanding, and finishing. Each door produced requires 1 hour in cutting, 30 minutes in
sanding, and 30 minutes in finishing. Each window requires 30 minutes in cutting, 45
minutes in sanding, and 1 hour in finishing. In the coming week Sanderson has 40
hours of cutting capacity available, 40 hours of sanding capacity, and 60 hours of
finishing capacity. Assume all doors produced can be sold for a profit of $500, and all
windows can be sold for a profit of $400.

a. Formulate an LP model for this problem.


b. Sketch the feasible region.
c. What is the optimal solution?

You might also like