INTRODUCTION TO LINEAR PROGRAMMING

Seatwork #2

Name: ___________________________ Section: ______________

1. You are given the following linear programming model:

Max 5M + 4J

s.t.
12M + 6J ≤ 20,400 Hammering
9M + 15J ≤ 25,200 Pasting
6M + 6J ≤ 12,000 Carving
M, J ≥ 0

a. Determine the coordinates of each extreme point and the corresponding profit. Indicate the optimal solution
and the highest profit.

b. Which constraints are binding?

c. How many hours of production time will be scheduled per department?

d. How much is the slack or surplus per department? Indicate if it is slack or surplus in your answers.

2. Hogwarts Castle makes two different types of floating broomsticks based on the type of wood used: Narra
Pawera and Mangga Chuya. The castle has 900 hours of production time available in its cutting department, 300
hours available in its finishing department, and 100 hours available in its packaging department. The production
time requirements and the profit contribution per glove are given in the following table.

Production Time (hours)

Model Cutting Finishing Packaging Profit/Broomstick
Narra Pawera ½ 1/8 Php 5
Mangga Chuya 1/3 ¼ Php 8

Assume that the company is interested in maximizing the total profit contribution. The finishing and packaging
departments were identified as the binding constraints.

a. Find the optimal solution.

b. What is the maximum total profit contribution?

1
MIAW