Assignment 1: Operations Research

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

' ISS 126 $

School of Information Science and Technology


ICS/ ISE 215
Operations Research
Assignment 1
Due 30 October 2020
Time 16:00

Instructions

• Attempt ALL questions.

• Work in groups of seven.

• Use appropriate software to solve the problems. To get credit show the commands and the
output.

• Present your answers neatly and legibly.

• Include a cover page with group members’ surnames & registration number, the course number,
and the due date.

• No late assignments will be accepted.

• The Lecturer reserves the right to leave ungraded any submission that is disorganized, untidy
or incoherent.

• Submit PDF files. Use the link provided on the course webpage to submit.

1. A small firm builds two types of garden shed. Type A requires 2 hours of machine time and 5
hours of craftsman time. Type B requires 3 hours of machine time and 5 hours of craftsman
time. Each day there are 30 hours of machine time available and 60 hours of craftsman time.
The profit on each type A shed is $60 and on each type B shed is $84. Formulate the appropriate
linear programming problem. [5]

2. A distribution firm has to transport 1200 packages using large vans which can take 200 packages
each and small vans which can take 80 packages each. The cost of running each large van is
$40 and of each small van is $20. Not more than $300 is to be spent on the job. The number
of large vans must not exceed the number of small vans. Formulate this problem as a linear
programming problem given that the objective is to minimize costs. [5]
& %
page 1 of 2
' ISS 126 $

3. Consider the linear programming problem


Maximize z = 2x1 + 4x2 ,

subject to x1 + 5x2 ≤ 10,


4x1 + x2 ≤ 8,
x1 , x2 ≥ 0.

Solve the problem using the graphical method. [10]

4. Consider the linear programming problem


Maximize z = 3x1 + 4x2 ,

subject to x1 + x2 ≥ 8,
2x1 − 3x2 ≤ 0,
x1 + 2x2 ≤ 30,
3x1 − x2 ≥ 0,
x1 ≤ 10
x2 ≥ 9,
x1 , x2 ≥ 0.

(a) Plot the feasible region clearly indicating the corner points. [5]
(b) Find the optimal solution. [5]


c 2020 T.N. Mutusva

& %
page 2 of 2

You might also like