National University of Computer and Emerging Sciences, Lahore Campus

Course: Operations Research Course Code: MT 4031

Program: BCS Semester: Spring 2024
Duration: 20 minutes Total Marks: 10
Paper Date: 27-03-2024 Weight 10/3
Section: 6H Page(s):
Exam: Quiz 2 Roll No:
Instruction/Notes Attempt All Questions

QUESTION 1: [3]

Write the dual for the following primal problem:

Maximize 𝒛 = 𝟐𝒙𝟏 + 𝒙𝟐

Subject to

𝟑𝒙𝟏 + 𝒙𝟐 = 𝟗,

𝟐𝒙𝟏 − 𝟓𝒙𝟐 ≥ 𝟓,

𝒙𝟏 + 𝟕𝒙𝟐 ≤ 𝟔 , 𝒙𝟏 ≥ 𝟎, 𝒙𝟐 unrestricted

QUESTION 1: [7]

Generate the dual simplex iterations for the following problem, and trace the path of the
algorithm on the graphical solution space.

Minimize 𝒛 = 𝟐𝒙𝟏 + 𝟑𝒙𝟐

Subject to

𝟐𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟑𝟎

𝒙𝟏 + 𝟐𝒙𝟐 ≥ 𝟏𝟎, 𝒙𝟏, 𝒙𝟐 ≥ 𝟎.