Scribd
Upload
20 views3 pages

Final Proposal

The document contains a 4 question business optimization exam with multiple choice questions covering topics like linear programming, the simplex method, and goal programming. Question 1 involves an LP problem and identifying feasible solutions and the optimal solution. Question 2 involves interpreting a simplex tableau. Question 3 covers dual solutions and interpreting an optimal LP tableau. Question 4 asks to formulate a goal programming model to optimize professor course assignments based on effectiveness scores.

Uploaded by

nesrine2487
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
20 views3 pages

Final Proposal

The document contains a 4 question business optimization exam with multiple choice questions covering topics like linear programming, the simplex method, and goal programming. Question 1 involves an LP problem and identifying feasible solutions and the optimal solution. Question 2 involves interpreting a simplex tableau. Question 3 covers dual solutions and interpreting an optimal LP tableau. Question 4 asks to formulate a goal programming model to optimize professor course assignments based on effectiveness scores.

Uploaded by

nesrine2487
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/ 3

Date: 23/05/2023

Time: 11.30 am – 01.30pm


Business Optimization
Number of pages: 3
Total marks: 100
Final Exam

Important remarks:
• In order to indicate your choice, you should tick the box of the correct answer (
X ).
• More than one answer could be correct. In this case, you should tick all the correct
answers to obtain the full mark. An incomplete answer will be considered as wrong.
• If you make a mistake and you would like to untick the answer, you should delete the
X blablabla  blablabla)
answer as follows(

Question 1:

Consider the following LP:

𝑀𝑖𝑛 𝑍 = 𝑋1 + 4𝑋2
S.t. 3𝑋1 + 3𝑋2 ≥ 60 (1)
4𝑋1 + 2𝑋2 ≥ 80 (2)
𝑋1 ≥ 10 (3)
𝑋1 , 𝑋2 ≥ 0
1) This linear program

□ has a unique optimal solution □ is infeasible


□ is unbounded □ has multiple optimal solutions
2) Point (20,20) is a feasible solution □True □False

3) One of following solutions is a feasible corner point


□ (10,10) □(15,15) □(10,20)
4) One of following points is the optimal solution:
□(10,20) □(20,20) □(20,0) □(10,10)
5) Constraint (3) is non-binding □True □False

1
Question 2:

The following tableau is one of the simplex tableaus obtained when maximizing the objective
function 𝑍 = 3𝑋1 + 2𝑋2 + 2𝑋3 subject to 2 technological “≤” constraints:

Cj ……… ……… ……… ……… ……… -


CB Basis X1 X2 X3 S1 S2 R.H.S
……… ……… 1 ……… 0.5 ……… 0 12.5
……… ……… ……… ……… 0.75 -0.25 0.5 ………
Zj ……… ……… ……… 1 ……… 65
C_bar ……… ……… ……… ……… ………

1) The Cj row contains:


□ [3; 2; 2; 0; 2] □ [3; 2; 2; 0; 0] □ [3; 2; 0; 0; 0]

2) C_bar (S2) is equal to:


□0 □1 □-1

3) This tableau is optimal:


□ True □ False
4) The first missing value in S1 column is:
□ 0.25 □ -1 □ 0.5
5) The optimal solution is:
□ (12.5,0) □ (12.5, 13.75) □ (12.5, 12.5)

6) The Basis column contains:


□ 𝑋1
𝑋2
□ 𝑋2
𝑋3
□ 𝑋2
𝑋1

Question 3:
The optimal simplex tableau of a given LP maximizing profit under resource constraints is as follows

X1 X2 X3 S1 S2 S3 RHS
2 X1 1 0.5 0 0.5 0 -0.5 13
0S2 0 -1.5 0 0.5 1 -2.5 5
1 X3 0 0.5 1 -0.5 0 1.5 11
Zj 2 1.5 1 0.5 0 1.5 37
Cj- Zj 0 -0.5 0 -0.5 0 -0.5 -

1) The dual optimal solution is :

Y1=13 ; Y2=5 ; Y3=11 ; W=37□ b) Y1=0.5 ; Y2=0 ; Y3=0.5 ; W=37□


c) Y1=-0.5 ; Y2=0 ; Y3= -0.5 ; W=37□ d) Y1=0.5 ; Y2= 0 ; Y3= -0.5 ; W=37□

2
2) If one unit of one resource can be purchased at the same cost as the others, then, it is most beneficial
to purchase:
a) resource 1 □ b) resource 2 □ c) resource 3 □ d) resource 1 or 3 □

3) Product 2 will be profitable if its profit rate increases by at least:


a) 1 unit □ b) 1.5 units□ c) 0.5 units □ d) 0 unit □

4) The optimal basis is preserved when the profit rate of product 1 is decreased by no more than:
a) 1 unit □ b) 13 units□ c) 2 units □ d) 0 units □

5) If constraint 2 is relaxed (omitted), then the optimal production plan will


a) increase □ b) decrease□ c) remain stable □

Question 4:

Consider four professors of business analytics at TBS. Each of them can teach no more than
two of the following courses: Operations Management (OM), Simulation, Operations
Research (OR), and Statistics. Each course must be offered by one professor. The following
table gives the effectiveness of each professor in teaching each course.

Professor OM Simulation OR Statistics

1 6 6 8 7

2 8 5 6 9

3 6 4 9 9

4 8 7 8 7

The dean has set a goal of obtaining an average teaching effectiveness level of at least7. Bad
deviations from this goal in any course are considered equally important. Formulate a goal
programming model that can be used to determine the best teaching assignments.

You might also like