Linear programming mathematical concept (optimization modelling and decision analysis)

Page 1 of 2

SIT399 Summative Assessment Task 2 Presentations Trimester 1, 2020

Special Instructions

This assessment task is for students to demonstrate their understanding of a mathematical concept

by explaining it to others in the form of a video.

You can submit this assessment task any time between Week 6 to Week 11.

Any technology for video-recording is acceptable, (e.g., similar to those in the learning resources or

any other video recording apps).

Marking criteria

1. Understanding of the content (10 marks)

2. Quality of presentations (5 marks)

SIT399 Summative Assessment Task 2 Presentations 2020 Trimester 1 Page 2 of 2

Time limit for each video: 5 mins

Q.1) Create a dual pair of feasible LPs of your own, each with at least three variables and three

constraints, both must be finite and feasible. Solve the Primal LP using the Simplex Algorithm. Use

it to illustrate how using the optimal solution to the Primal LP, one can work out the optimal solution

to the Dual LP by using the Complementary Slackness Theorem.

Q.2) Provide a step-by-step illustration of the procedure to eliminate rows and/or columns by dom-

inance rules, and solve the game below using either a graphical method or as an linear programming

problem.  

3 2 3 3 4 0 −1 4 −1 1 3 3 2 3 3 0 −2 3 −1 2

 