NAME: NUR ALEEYA HIDAYU BINTI AZANI

STUDENT ID: 2021493908

QUESTION 1 (DECISION ANALYSIS)

a) Use decision tree to analyze the problem and determine the best decision for the owner.

- DECISION: Do survey, if favorable choose product A while for unfavorable choose product C.

b) Compute the maximum fee the owner should pay the consultant for his service. (EVSI)

- EVSI = Gross profit – EMV (no survey)

= 20940 – 13600

= 7340

STEP FOR DECISION ANALYSIS (TREE DIAGRAM)

1) MODULE

2) DECISION ANALYSIS

3) FILE > NEW

4) DECISION TREE (GRAPHICAL) > OK

5) CLICK NODE > ADD NUMBER BRANCHES

6) CHANGE TO DECISION NODE (CIRCLE > RECTANGLE / OTHERWISE)

7) CHANGE LABEL > NAME > PROBABILITY > PROFIT

8) CLICK SOLUTION > RIGHT CLICK > COPY IMAGE > PASTE IN WORD
QUESTION 2 ( LINEAR PROGRAMMING – GRAPH )

SOLUTION: X1 = 5.625, X2 = 6, Z = 187.5. There is no special cases exist.

STEP FOR LINEAR PROGRAMMING (GRAPH)

1) MODULE

2) LINEAR PROGRAMMING

3) FILE > NEW

4) NO. OF CONSTRAINTS (NO. OF EQN)

5) NO. OF VARIABLES (NO. OF X – X1, X2…)

6) CLICK OK

7) KEY IN VALUE FOR X1, X2,…, RHS > EQN FORM

8) SOLVE > GRAPH

9) RIGHT CLICK > COPY IMAGE > PASTE IN WORD

10) STATE THE SOLUTION [ VALUE FOR X1, X2,…, Z (HIGHLIGHT ONE)]
QUESTION 3 (LINEAR PROGRAMMING – SIMPLEX TABLEAU)

a) Find the final simplex tableau for the above linear programming model. (all table after solution
click & determine optimal solution)

- OPTIMAL SOLUTION: X1 = 7.5, X2 = 0, X3 = 211.25, Z = 1078.75, S1 = 0, S2 = 0, S3 = 412.5

b) What are the best production mix and the optimal profit?

- OPTIMAL PROFIT: Z = 1078.75

c) Are any solution not fully utilized in the solution? If so, how much of each operation is
underutilized?

- Yes, operation 3 is not fully utilized

Operation 1 = 0, Operation 2 = 0, Operation 3 = 412.5

EXAMPLE QUESTION?

- How much that the operation that have been fully utilized – 430 (same with initial total)

d) What are the shadow prices for the resources? – if not fully utilized, no shadow prices

- SHADOW PRICES: Slack column, Z value

 Operation 1 = 2.38, Operation 2 = 0.13, Operation 3 = 0

e) A suggestion is made to increase the available times for Operation 1 from 430 to 600, is this
suggestion advisable? Explain.

- Advisable, the profit will increase to 1290.

STEP FOR LINEAR PROGRAMMING (SIMPLEX TABLEAU)

1) MODULE

2) LINEAR PROGRAMMING

3) FILE > NEW

4) NO. OF CONSTRAINTS (NO. OF EQN)

5) NO. OF VARIABLES (NO. OF X – X1,X2…)

6) CLICK OK

7) KEY IN VALUE FOR X1, X2,…, RHS > EQN FORM

8) FULLSCREEN > SOLVE > IRRETATIONS

9) SNIP & SKETCH > BOTH TABLE > INSERT INTO WORD
QUESTION 4 – (TRANSPORTATION)

i) Find the initial solution for the above problem by using least cost method.

ii) Solve the transportation problem above to achieve the minimum cost. What is the minimum total
cost? - (look at transportation result, all iterations, shipping list)
Maximum total cost = 6400 (total all the shipment cost)

It exist when there’s 0 value

iii) Is the any alternative solution? Why? of index in the final solution
There is an alternative solution because 0 value of index in final solution.

iv) Name which customer with shortage and state the shortage value.

Shortage = Refer iteration 1 (dummy row) – KUALA LUMPUR = 100

STEP FOR TRANSPORTATION

1) MODULE

2) TRANSPORTATION

3) FILE > NEW

4) NO. OF SOURCES (FROM)

5) NO. OF DESTINATION (TO)

6) CLICK MAX/MIN

7) STARTING METHOD > MINIMUM OF METHOD

8) SOLUTIONS (SOLVE) > TRANSPORTATION RESULT,

ITERATIONS & SHIPPING LIST