Army Public College of Management & Sciences

University of Engineering &Technology – Taxila

Khadim Hussain Road, Rawalpindi
Mid Term Examination
Semester Fall- 2020

Subject: Operations Research Date: 21-04-2021

Course Code: CS-303 Start Time: 9:00-11:00
Name of Faculty: Engr. Shahid Ismail Max Marks: 50
Time Allowed: 120 mins Total Pages: 2
Class: CS-31 Department Department of
Computer
Sciences

Student Name: Reg No:

INSTRUCTIONS
a) All questions are compulsory to attempt.
b) Read a question carefully prior to start writing its solution.
c) The paper is closed book.
d) Use blue or black ink. Lead pencil is not allowed.
e) Calculators are allowed/not allowed.

Q1: [CLO-1, C-2] [Marks 2+3]

1. Differentiate between linear and nonlinear programming with examples.
2. Describe the different methods available to solve the LP programs. Also elaborate their
advantages and disadvantages.

Q2: [CLO-1, C-2] [Marks 15]

A company wishes to bottle 2 different drinks. It takes 2 hours to can one gross of drink A, and it
takes 1 hour to label the cans. It takes 3 hours to bottle one gross(144 items) of drink B, and it
takes 4 hours to label the cans. The company makes a $10 profit on one gross of drink A and a
$20 profit on one gross of drink B. Given that the bottling department has 20 hours available, and
the labelling department has 15 hours available, find out how many gross of drink A and drink B
must be packaged in order to maximize the profit.

Q3: [CLO-2, C-3] [Marks 20]

Apply the simplex method to solve the following maximization problem
Z = $7X1+$X2
Subjected to
2X1+X2<=100
$X1+3X2<=240

1
Using the detailed simplex method outlining all its steps.

Q4: [CLO-2, C-3] [Marks 10]

Use the row operation based simplex method to solve the problem in Q No 3.

THE END