Scribd
Upload
12 views1 page

Quiz 1

The document outlines the details for Quiz 1 of MTL103, scheduled for 08/03/2021, including instructions for submission and requirements for answers. It contains four linear programming problems that require students to analyze simplex tables, determine optimal solutions, and explore the feasibility of given constraints. Each question emphasizes the need for clear justification and step-wise working to receive marks.

Uploaded by

joysujeeth2006
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
12 views1 page

Quiz 1

The document outlines the details for Quiz 1 of MTL103, scheduled for 08/03/2021, including instructions for submission and requirements for answers. It contains four linear programming problems that require students to analyze simplex tables, determine optimal solutions, and explore the feasibility of given constraints. Each question emphasizes the need for clear justification and step-wise working to receive marks.

Uploaded by

joysujeeth2006
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/ 1

MTL103: Quiz 1 on 08/03/2021 at 7:00 pm

Max Marks 10 Max Time: 35 minutes


Time to upload answers: 10 minutes
Start the answer of each question on the new page. Write your name and entry number on the top
of each page. Upload your PDF le on Gradescope with clear and correct mapping.
No re-quiz for any reason. No marks will be awarded if answer is not supported with step-wise working.
1. Consider the following LPP
max z = 4x1 + x2 + 3x3 + 5x4
s.t.
4x1 − 6x2 − 5x3 − 4x4 ≥ −20
3x1 − 2x2 + 4x3 + x4 ≤ 10
8x1 − 3x2 + 3x3 + 2x4 ≤ 20
x1 , x 2 , x 3 , x 4 ≥ 0
Fill all the missing entries in the following simplex table
 
cB vB xB y1 y2 y3 y4 y5 y6 y7

 5 x4 −− 0 −− 13/10 1 −− 0 −− 


 0 x6 −− 0 −− −− 0 −− 1 −2/5 

 4 x1 −− 1 −3/5 −− 0 −− 0 −− 
zj − cj → 0 −− −− 0 4/5 0 −−
where x5 , x6 , x7 ≥ 0 are the slack variables in the rst, second and third constraints (read in order), respec-
tively. Is this table yield an optimal solution or indicate unbounded LPP? Show your work clearly. [3]

2. For any non-zero cost vector c = (c1 , c2 )T , can x∗ = (1, 3)T be an optimal solution of the problem given below.
Explain your answer with clear justication.
max c1 x1 + c2 x2
2x1 + 3x2 ≤ 11
3x1 − 2x2 ≤ 9
x1 , x2 ≥ 0.
Solve the LPP graphically when c = (1, 5)T , and nd the optimal value of the LPP. [3]

3. Consider the following LPP


max z = x1 − 4x2
s.t.
x1 − x2 ≥ −4
4x1 + 5x2 ≤ 45
5x1 − 2x2 ≤ 20
x1 ≥ 0.
Describe the range set of x2 for which the LPP
(a) becomes unbounded; (b) infeasible. Justify your answer. [2]

4. Consider the polyhedral set described by the following inequalities:


−3x1 + x2 ≤ −2
−x1 + x2 ≤ 2
−x1 + 2x2 ≤ 8
x1 ≥ 0, x2 ≥ 2

Find the extreme directions of the set. Explain and show the steps clearly. [2]

You might also like