Code for largest coefficient case

This is the code you must complete.

It needs to return the $($row$,$ column$)$ indexes $(r,s)$ on which the Simplex method will pivot.

It needs to be fully and correctly documented.

def find$\_$pivot$\_$largest$\_$coefficient$($tableau$)$:

return final$\_$r$,$ final$\_$s

Tests

The following cells perform various tests on the function.

# The tableau for the optimal portfolio

tableau$\_$op $=$ np$.$array

$0,-0\mathrm{.}02,-0\mathrm{.}03,0,0,0,$

$10,1,1,1,0,0,$

$7,1,0,0,1,0,$

$])$

$5,0,1,0,0,1$

basis$\_$op $=np.$array $([3,4,5])$

# Check that the expected pivot is row $3,$ column $2.$

# Note that for Bland's rule it is row $2,$ column $1.$

assert find$\_$pivot$\_$largest$\_$coefficient$($tableau$\_$op$)==(3,2)$This is the python question I need help with, but it must work for the test in the photo on the right. Code for largest coefficient case This is the code you must complete. It needs to return the indexes $\backslash (($r$,$ s$)\backslash )$ on which the Simplex method will pivot. It needs to be fully and correctly documented. def find$\_$pivot$\_$largest$\_$coefficient$($tableau$)$: return final$\_$r$,$final$\_$s$\backslash$# The tableau for the optimal portfolio tableau$\_$op $\backslash (=\backslash )$ np$.$array $([\backslash [[0,-0\mathrm{.}02,-0\mathrm{.}03,0,0,0]\backslash ]\backslash [[10,1,1,0,0],\backslash ]\backslash [[7,1,0,1,0],\backslash ]$ basis$\_$op $=$ np$.$array $\backslash ([[3,4,5])\backslash )\backslash$# Check that the expected pivot is row $3,$ column $2,\backslash$# Note that for Bland's rule it is row $2,$ column $1.$ assert find$\_$pivot$\_$largest$\_$coefficient$($tableau$\_$op$)\backslash (==(3,2)\backslash )$