Bahria University

Lahore Campus
Mid Term Exam (Spring 2020 Semester)
Department of Management Sciences
VIVA/Presentation Date & Time:
04/06/2020-12:00Pm-1:30Pm

Assignment Post Date: 15/05/2020

Instructor Name: M. Ahsan Chughtai Program/Semester: BBA- 5th Semester
Course Code: RMT-360 Course Title: OPERATIONS RESEARCH
Assignment Submission: 30/05/2020 11:59 PM Max Marks: 15 Marks
Instructions: Read out following Instructions carefully.
Plagiarism or collusion will result in straight away deduction of 50% marks.
Please Submit Hand Written Scan Copies of your assignments on LMS on or before 30, May 2020.
Answer All Questions carrying 05 Marks each (3 Marks for written Assignment 2 Marks for VIVA)

Question No. 1. Solve the following Linear Programming Problem (LPP) graphically subject to constraints.
Maximize Using Graphical Solution (3Marks Solution + 2 Marks Viva)

Question No 2.
Three grades of coal A, B and C contain phosphorus and ash as impurities. In a particular industrial process,
fuel up to 100 ton (maximum) is required which should contain ash not more than 3% and phosphorus not
more than 0.03%. It is desired to maximize the profit while satisfying these conditions. There is an unlimited
supply of each grade. The percentage of impurities and the profits of grades are given below.
COAL Phosphorous Ash Profits

% % Rupees per ton

A .02 3 12

B .04 2 15

C .03 5 14

Let x1, x2 and x3 respectively be the amounts in tons of grades A B C Used.

 Objective is to maximize the profit
Z = 12x1 + 15 x2+ 14x3,
Constraints are: (i) -x1 + x2 ≤ 0,
(ii) -x2 + 2x3 ≤ 0,
(iii) x1 + x2 + x3 ≤ 100,
(iv) x1, x2, x3 ≥ 0.
Find the proportions in which the three grades be used optimally using simplex method. (3Marks Solution
+ 2 Marks Viva)
Question No. 3.
Solve by BIG-M method the following L.P. Problem (3Marks Solution + 2 Marks Viva)
Objective is to minimize the cost
Z = - 40x1 -100x2,
Subject to: 10x1 + 5x2 ≤ 250,
2x1 + 5x2 ≤ 100,
2x1 + 3x2 ≤ 90,
x1, x2 ≥ 0.
I. Setup Problem in standard form.
II. Find Initial Basic solution.
III. Test for optimality.
IV. Find final feasible optimal solution to the problem.