Nothing Special   »   [go: up one dir, main page]

Operations Research 1 Sta 314 HND 1

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

LAGOS CITY POLYTECHNIC, IKEJA

SCHOOL OF ENGINEERING AND APPLIED SCIENCE

DEPARTMENT OF COMPUTER SCIENCE

2018/2019 SEMESTER EXAMINATION

COURSE TITLE: OPERATIONS RESEARCH I NO OF QUESTION: 6


COURSE CODE: STA 314 TIME: ALLOWED:
2HRS
FOR WHOM: HND I CS FT
1. (a) Explain at least five(5)
INSTRUCTIONS: Definitions of Operational
Answer any Research4
(b) Describe the six(6) characteristics of Operational Research
(c) What are the Methodology of Operational
QuestionsResearch
2. (a) What do you understand by Models andModel Building?
(b) What are the purposes for which model can be constructed
(c) Explain the advantages and disadvantages of Modelling
3. (a) Why is Linear programming is widely use in OR
(b) State the three (3) basic steps in constructing a Linear Programming
(c) A tailor has the following material available, 16m2 cotton, 11m2silk, 15m2 wool.
A suit requires the following 2m2, cotton, 1m2 silk, 1m2 wool. A gown requires
the following 1m2 cotton, 2m2 silk, 3m2 wool. If a suit sells for N3000.00
and a gown for N5000.00. How many of each garment should the tilor makes to
abtain the maximum amount of money?
4. (a) A person requires 10, 12, and 12 units of chemicals A, B, and C respectivelyfor
his garden. A liquid products contain 5, 2 and 1 unit of a A, B and C
respectively per jar and a dry product contains 1, 2, and 4 unit of A, B, and
C respecively per carton. If the liquid product sells for N300 per jar andthe dry
produce sell for N200 per carton. How many of each should he purchase to
minimize the cost andmeet the requirement?
Find the duel of the maximum problem?
Maximum: f = 30x + 50y
Subject to: 2x = y < 16
X + 3y < 11
X + 3y < 15
X >, 0 y > 0
5. (a) Solve this problem using Simplex Method
Maximize: Z = 2 x 1 + 3 x 2 + x3
Subject to: X1 + x2 + x3 < 9
2x1 + 3x2 < 25
X2 + 2x3 < 10
6. Find the dual of the following LPP
Max Z = x31 x2 + x3
Subject to: 4x1 x2 < 8
8x1 + x2 + 3x3 > 12
5x1 6x3 < 13
x1, x2, x3 > 0

You might also like