Scribd
Upload
8 views4 pages

Sma3252 Cat or

The document outlines the guidelines and requirements for an operation research take-away assignment for the course SMA 3252, including submission details and specific questions to be addressed. It includes mathematical problems related to linear programming, optimal solutions, and transportation problems. Students are instructed to work independently and submit their answers in a specified format by the deadline.

Uploaded by

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

Sma3252 Cat or

The document outlines the guidelines and requirements for an operation research take-away assignment for the course SMA 3252, including submission details and specific questions to be addressed. It includes mathematical problems related to linear programming, optimal solutions, and transportation problems. Students are instructed to work independently and submit their answers in a specified format by the deadline.

Uploaded by

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

SMA 3252 OPERATION RESEARCH Dr.

SIMIYU KEVIN MUKUBWA


TAKE-AWAY CAT 24/5/2024
Submission: 24/5/2024 2359hr later than this NOT ACCEPTABLE.
Instructions:
Write your full names, Registration number
Include course (BSc. Economics/ BSc. Economics &Statistics)
Write CLEARLY and LEGIBLY, all the working MUST be shown.
Pay STRICT attention to PROPER USE OF NOTATION
Do your work independently; any detected collusion will attract an undesired PENALTY to
concerned parties.
Upload a single answer sheet in PDF format
Q1.
𝑀𝑎𝑥 𝑊 = 60𝑦1 + 30𝑦2 + 20𝑦3
Subject to
8𝑦1 + 6𝑦2 + 𝑦3 ≤ 48
4𝑦1 + 2𝑦2 + 1.5𝑦3 ≤ 20
2𝑦1 + 1.5𝑦2 + 0.5𝑦3 ≤ 8
𝑦1 , 𝑦2 , 𝑦3 ≥ 0.
Given that 𝑦1 , 𝑦2 , 𝑦3 are the basic variables in the final optimal table
a) Give
i) 𝐶𝐵𝑉 A vector representing objective function coefficient for the basic variables
in the optimal table.
ii) 𝐶𝑁𝐵𝑉 A vector representing the objective function coefficient for the non-basic
variables in the optimal table.
iii) Vectors𝑎𝑗 ; is the column in the constraints for the variable 𝑥𝑗 in the initial
table.
iv) Matrix B whose jth column is the column in the constraints for the basic
variables 𝑥𝑗 in the initial table
v) Matrix NB whose jth column is the column in the constraints for the non-basic
variable 𝑥𝑗 in the initial table.
b) Using the values in (a) above, regenerate the final optimal table.
c) The profit of the first product dropped to 30 due to saturation of the market. What is the
effect on the optimal solution, calculate the range of optimality.
d) What’s the effect of adding new constraint i) 𝑦1 + 𝑦2 + 𝑦3 ≤ 11 ii) 𝑦2 ≥ 2
e) Suppose a new product is added into the system, its resource consumption and profit
1
given below. What is the effect? 𝑦4 = 12 𝑎4 = 1
1

Q2.
a) Using a general example describe the components of a linear programming problem.
b) Using the graphical method solve the linear programming problem
Minimize Y= 18𝑤1 + 12𝑤2
Subject to
4𝑤1 + 3𝑤2 ≥ 60
𝑤1 + 2𝑤2 ≤ 40
3𝑤1 + 𝑤2 ≥ 30
Identify the type of solution to the problem.

c)
Use Big M method to solve the LPP
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑊 = −4𝑥1 − 6𝑥2
Subject to
3𝑥1 + 2𝑥2 ≤ 30
−𝑥1 − 𝑥2 ≤ −3
2𝑥1 + 3𝑥2 ≤ 24
𝑥1 , 𝑥2 ≥ 0
d)
Use dual simplex method to solve the LPP
Max Z=−4𝑦1 − 2𝑦2 − 2𝑦3
Subject to
−6𝑦1 − 𝑦2 − 4𝑦3 ≥ −5
−5𝑦1 − 2𝑦2 − 3𝑦3 ≤ −2
−7𝑦1 − 3𝑦2 − 𝑦3 ≥ −3
𝑦1 , 𝑦2 , 𝑦3 ≥ 0

Q3.
Consider a problem of assigning workers to machines. The time in hours required to complete
the task are given below.

A B C D

1 12 8 14 10
2 8 - 16 14

3 6 6 - 10
4 4 12 12 8

Worker 2 cannot be assigned to machine B. worker 3 cannot be assigned to machine C.


Find the optimum assignment schedules and total optimum time.
Q4.
A manufacturing company produces diesel engine in three cities and they are purchased by three
trucking companies. The table below shows the number of engines available and the number of
engines required. It also shows the transportation cost per engine in (£100) from sources to
destination. The company wishes to keep the transportation cost to a minimum.
Companies Suppl
Cities A B C y
1 3 2 3 25
2 4 2 3 35
3 3 2 6 20
Demand 30 30 20
a) Write the initial feasible solution using
i) Least cost cell method
ii) Vogel approximation method
b) Using the north-west corner method feasible solution, obtain the optimal solution.
i) Give the transportation pattern and its total cost.

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