Scribd
Upload
7 views4 pages

BS BF BSP IP 341 Test 1 - 2022 Redemption Test

This document is a test paper for the course BS/BF/IP 341: Operations Research at the Copperbelt University, dated May 27, 2022. It includes instructions for the test, which has a duration of 3 hours and consists of multiple questions requiring linear programming formulations and solutions using graphical and simplex methods. The test covers various scenarios related to operations research, including trucking capacity, crop cultivation, and resource allocation.

Uploaded by

M'simuko Simon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views4 pages

BS BF BSP IP 341 Test 1 - 2022 Redemption Test

This document is a test paper for the course BS/BF/IP 341: Operations Research at the Copperbelt University, dated May 27, 2022. It includes instructions for the test, which has a duration of 3 hours and consists of multiple questions requiring linear programming formulations and solutions using graphical and simplex methods. The test covers various scenarios related to operations research, including trucking capacity, crop cultivation, and resource allocation.

Uploaded by

M'simuko Simon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

THE COPPERBELT UNIVERSITY

School of Business

27th May, 2022

TEST 1

Redemption Test

BS/BF/IP 341: Operations Research

Duration: 3hrs. (180minutes)

Instructions:

Answer all questions

All questions carry equal marks. Where questions have more than one part,
the relative importance is indicated

Total Marks: 100

Calculators are permitted but other electronic items such as


IPads/Tablets/Mobile Phones/Headsets are NOT permitted

DO NOT ATTEMPT to aid another candidate or ATTEMPT TO OBTAIN aid


from another candidate OR attempt to communicate in any way with another
candidate during the Test. If found wanting you shall be disqualified

DO NOT TURN OVER UNTIL YOU ARE TOLD TO DO SO

Page 1 of 4
QUESTION ONE

a) A businessman is considering opening a small specialised trucking firm. To make the firm profitable, it is
estimated that it must have a daily trucking capacity of at least 84,000 cubic feet. Two types of trucks are
appropriate for this type of operation; Short haul, and long haul trip. There are 41 potential drivers available
and there are facilities for at most 40 trucks. Their characteristics and costs are summarised on the table
below.

Truck Cost per Capacity Drivers


type Truck($) (Cubic feet) needed

Short Haul 18, 000 2, 400 1

Long Haul 45, 000 6, 000 3

Required:

i) Formulate a linear program (LP) for the above problem and determine the number of trucks needed
(using the graphical method) to minimise costs. What will be the cost?
[10 Marks]

b) Given the problem below;

Maximize Z = 32X1 +¿ 30X2 +¿ 40X3

S.t 5X1 +¿ 4X2 +¿ 3X3 ≤ 2500

2X1 +¿ 3X2 +¿ X3 ≤ 1275

3X1 +¿ 2X2 +¿ 4X3 ≤ 2100

X1, X2, X3 ≥ 0

i) Solve using the simplex method [8 Marks]


ii) Suppose the ranges of optimality (coefficient of variables X1, X2, X3) upper limit were C1, = 35, C2, = 120
and C3 = 60 respectively. Calculate the new profit, and the values of the shadow prices? [7 Marks]
Total [25 Marks]

QUESTION TWO
a) Given the problem below;
Page 2 of 4
Maximize Z = 40X1 +¿ 35X2
S.t 2X1 +¿ 3X2 ≤ 60
X1 ≥ 10
X2 ≥ 5
4X1 +¿ 3X2 ≤ 96
X1, X2, ≥ 0

i. Solve the problem graphically. What are the solutions? [8


Marks]
ii. Suppose the ‘≤’ in the fourth constraint was changed to ≥ show how the problem would be
affected. What will be the solutions?
[4 Marks]

b) Given the following problem


Maximize Z = 2X1 +¿ X2
S.t X1 −¿ X2 ≤ 10
2X1 −¿ X2 ≤ 40
X1, X2, ≥ 0
Required: Solve using the simplex method. What are the solutions? [7
Marks]

c) Given the following problem

Maximize Z = 2X1 +¿ 5X2 +¿ 5X3 +¿ 3X4


S.t 10X1 +¿ 12X2 +¿ 10X3 +¿ 9X4 ≤ 150
X1 +¿ X2 +¿ X3 ≥ 12
−¿X1 +¿ X2 +¿ X3 −¿ 4X4 ≤ 0
X1, X2, X3, X4 ≥ 0

Required: Convert this problem into a dual [6


Marks]
Total [25 Marks]

QUESTION THREE

Page 3 of 4
A young Copperbelt farmer has just acquired a farm in Chingola where he plans to cultivate three crops;
Watermelons, Cabbage and Tomatoes. He immediately obtains information about the seeds, chemicals,
fertilizers and man-hours he will require per acreage for cultivating these horticulture crops. Data obtained
from the Agro-dealers show that supply of seeds, chemicals, fertilizers is at least guaranteed and that
maximum man-hours will be available. The daily supplies of seed is 100kgs, chemicals 150kgs, fertilizers
120kgs, and at most 3000 man-hours are available.

The estimated costs per horticulture crop to be obtained and the requisites per acreage are given on the
table below:

Horticultural cost per Man-


Seeds Chemicals Fertilisers
crop acre ($) hours

Watermelon 8 1 0 1 20

Cabbage 5 1 1 0 10

Tomatoes 4 0 1 1 15

i) Formulate the above as a linear programming problem [6


Marks]
ii) Solve using the simplex (Big M) algorithm method, what quantities of crops should be planted on
this farm to minimise costs? What will be the cost? [13
Marks]
iii) What quantities of chemicals (ranges) must be kept to ensure the all crops are covered throughout
the season? [3
Marks]
iv) At what range of optimality must this farmer maintain to keep his plan optimal for tomatoes? [3
Marks]
Total [25 Marks]
End of the Test Paper!

Page 4 of 4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy