0% found this document useful (0 votes)
41 views

Faculty of Engineering and The Built Environment

This document provides instructions for a 50-mark operations management assessment consisting of 4 questions. The assessment covers linear programming (LP) topics including dual problems, sensitivity analysis, and integer programming (IP) using the branch and bound method. Students have 4 hours to complete the assessment and submit their answers on the provided answer sheet. Late submissions will be penalized.
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
41 views

Faculty of Engineering and The Built Environment

This document provides instructions for a 50-mark operations management assessment consisting of 4 questions. The assessment covers linear programming (LP) topics including dual problems, sensitivity analysis, and integer programming (IP) using the branch and bound method. Students have 4 hours to complete the assessment and submit their answers on the provided answer sheet. Late submissions will be penalized.
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

FACULTY OF ENGINEERING AND THE BUILT ENVIRONMENT

DEPARTMENT: QUALITY AND OPERATIONS MANAGEMENT

SUBJECT:    OPERATIONS MANAGEMENT TECHNIQUE 3A (BPI/OPT33A3)


TOTAL MARKS:     50 MARKS
WEIGHT: 25%
DATE: 1 MAY 2021
TIME: 15H00-19H00
CONTINUOUS ASSESSMENT: TEST 2
______________________________________________________________________________
ASSESSOR(S): Mrs Eveth Nwobodo-Anyadiegwu
Ms Lumbwe A.K
MODERATOR: Mr. Xhanti Dyonase
______________________________________________________________________________
Description
This final assessment is based on the following chapters:
 LP: Dual
 LP: Sensitivity analysis
 IP: Branch and bound
______________________________________________________________________________
Instructions
1. Prepare a scientific calculator and graph paper before you start this assessment.
2. Read carefully the instructions and requirements.
3. Use the answer sheet attached to write your answers.
4. You have two attempts to submit your answer sheet. The last submission will be
considered.
5. Submit your completed answer sheet on blackboard. Emails are not allowed.
6. Only word document will be accepted and marked.
7. Round off your answers to two (2) decimal places.
8. Number of pages: 4 pages excluding cover page.
9. Late submission will be penalized.
All the best.
The general University of Johannesburg policies, procedures and rules pertaining to written
assessments apply to this online assessment.
______________________________________________________________________________

QUESTION 1 [05]
Gauteng sausage Company has to produce a hot dog mixture in a minimum of 1,000-Kg batches.
The mixture contains two ingredients—chicken and beef. The cost per grams of each of these
ingredients is as follows:

Ingredients Cost/g
Chicken R30
Beef R50

Each batch has the following recipe requirements:


A. At least 500 grams of chicken
B. At least 200 grams of beef
The ratio of chicken to beef must be at least 2 to 1. The company wants to know the optimal
mixture of ingredients that will minimize cost.
The LP formulation is presented as follows:
X1= g of chicken X2= g of beef
Minimize C 30X1 + 50X2
Subject to: X1 + X2 ≥ 1000 Kg batches
X1≥ 500 Grams of chicken
X2≥ 200 Grams of beef
X1 – 2X2≥ 0 Ratio of chicken to beef
X1, X2≥ 0
1.1. What is the dual for this LP problem (10)
Note: Refer to the answer sheet to write your answers

QUESTION 2 [17]
The Fournos Bakery makes coffee cakes and Velvet cakes in large pans. The main ingredients
are flour and sugar. There are 11 kg of flour and 65 kg of sugar available, and the demand for
coffee cakes is 1. 2 kg of flour and 2 kg of sugar are required to make a pan of coffee cakes, and
1 kg of sugar are required to make the velvet cakes. A pan of coffee cakes has a profit of R5, and
a velvet cake has a profit of R3.
X1= Coffee cakes X2= Velvet cakes
Maximize 5X1 + 3X2

2
Subject to 2X1 + 3X2 ≤ 11 (Flour)
1X1 ≤ 65 (Sugar)
1X2≤ 1 (Demand)
X1, X2≥ 0
5 3 0 0 0
Sol mix Cp X1 X2 S1 S2 S3 Quantity
X2 3 0 1 0.33 -0.67 0 0.33
X1 5 1 0 0 1 0 5
S3 0 0 0 -0.33 0.67 1 0.67
ZJ 5 3 0.99 2.99 0 25.99
CJ-ZJ 0 0 -0.99 -2.99 0
Note: Use the answer sheet to write your answers

Identify the value of Δ and indicate the inequality sign.


2.1. Find the range of C2. (7)
5 3+Δ 0 0 0
Sol mix Cp X1 X2 S1 S2 S3 Qty
X2 3+Δ 0 1 0.33 -0.67 0 0.33
X1 5 1 0 0 1 0 5
S3 0 0 0 -0.33 0.67 1 0.67
ZJ 5 3+Δ 0 26+5Δ
CJ-ZJ 0 0 1 2 0

Δ 3 Δ 4
C2 5 C2 6
C2 range 7
2.2. Find the range of Q2. (10)
Compute the equations you identify in order (from X2 to S3) and indicate the inequality sign.

1 ≥0 2 ≥0 3 ≥0
Δ4 Δ5 Δ6
Q2 7 Q2 8 Q2 9
Q2 Range 10
Note: Refer to the answer sheet to write your answers

3
QUESTION 3 [09]
Mr cleaner, a floor Cleaner Company located in Pretoria, is trying to determine the number of
salespeople it should allocate to its three regions: the Eastgate, the Northgate, and Southgate. The
company has 100 salespeople that it wants to assign to the three regions. The annual average unit
sales volume achieved by a salesperson in each region is as follows:
Region Units per Salesperson
Eastgate (X1) 25,000
Northgate (X2) 18,000
Southgate (X3) 31,000

Because travel distances, costs of living, and other factors vary among the three regions, the
annual cost of having a salesperson is R5, 000 in Eastgate, R11, 000 in Nothgate, and R7, 000 in
the Southgate. The company has R700, 000 budgeted for expenses. To ensure nationwide
exposure for its product, the company has decided that each region must have at least 10
salespeople. The company wants to know how many salespeople to allocate to each region to
maximize total average units sold.
3.1. Formulate an integer programming model for this problem. (09)
Note: Refer to the answer sheet to write your answers

QUESTION 4 [20]
Given the following all-integer problem:
X1= number of Cell pones
X2= number of laptops
Maximize 150 X1 + 70 X2
Subject to 16 X1 + 5 X2 ¿ 70 hours (Labour)
2 X1 + 3 X2 ¿ 18 hours (Machine)
X1 and X2 ¿ 0 and integer
2.1. A diagram is illustrated below. Solve the problem (for the optimal integer values of X 1 and
X2) using branch and bound.

4
UB 1 (?, ?) R?
1 LB (3, 3)

X2 ≤ 2 X2≥ 3

UB 5 (?, ?) R?
UB 4 (?, ?) R? 3 LB (3, 4)
2
LB (3, 3)

X1≤ 6 X1≥7

UB 9 (?, ?) R?
UB 8(?, ?) R? 4 5 (19)
LB (4, 1) 670
LB (3, 4)

10 The solution to this problem is node #? (1)


Note: Refer to the answer sheet to write your answers

END OF ASSESSMENT
TOTAL MARK [50]

You might also like