Question is a typical transportation problem.

Customer Profit per Unit ( in $) Demand

North Plant South Plant West Plant Dummy Plant

A                1.75                   1.85              1.00 0 10

B                1.50                   2.00              1.15 0 5

C                0.90                   1.65              1.25 0 15

D                1.00                   1.65              1.55 0 20

E                1.10                   1.50              1.15 0 10

F                1.55                   1.00              1.10 0 20

G                1.00 1.2              0.50 0 15

Supply 30 30 30 5 95 / 95
As mentioned in the question the total demand is 95 units but available supply is only 90 units ,
therefore a dummy plant is considered with balanced figure of 5 units

Solution to above transportation problem is as follows: MAXIMUM PROFIT =$137.75 with customer
G left with 5 units

Target Cell
(Max)

Original
Cell Name Value Final Value

Objective
function North
$J$38 Plant 0 137.75

Adjustable
Cells

Original
Cell Name Value Final Value

$J$28 A North Plant 0 10

$K$28 A South Plant 0 1.42064E-08

$L$28 A West Plant 0 0

$M$28 A Dummy Plant 0 0

$J$29 B North Plant 0 0

$K$29 B South Plant 0 5

$L$29 B West Plant 0 0

$M$29 B Dummy Plant 0 0

$J$30 C North Plant 0 0

$K$30 C South Plant 0 15

$L$30 C West Plant 0 0

$M$30 C Dummy Plant 0 0

$J$31 D North Plant 0 0

$K$31 D South Plant 0 0

$L$31 D West Plant 0 20

$M$31 D Dummy Plant 0 0

$J$32 E North Plant 0 0

$K$32 E South Plant 0 9.88098E-15

$L$32 E West Plant 0 10

$M$32 E Dummy Plant 0 0

$J$33 F North Plant 0 20

$K$33 F South Plant 0 0

$L$33 F West Plant 0 0

$M$33 F Dummy Plant 0 0

$J$34 G North Plant 0 0

$K$34 G South Plant 0 10

 $L$34 G West Plant 0 0

$M$34 G Dummy Plant 0 5

Constraints

Slac
Cell Name Cell Value Formula Status k

Not
$N$28 A 10.00000001 $N$28=$O$28 Binding 0

Not
$N$29 B 5 $N$29=$O$29 Binding 0

Not
$N$30 C 15 $N$30=$O$30 Binding 0

Not
$N$31 D 20 $N$31=$O$31 Binding 0

Not
$N$32 E 10 $N$32=$O$32 Binding 0

Not
$N$33 F 20 $N$33=$O$33 Binding 0

Not
$N$34 G 15 $N$34=$O$34 Binding 0

Not
$J$35 North Plant 30 $J$35=$J$36 Binding 0

Not
$K$35 South Plant 30.00000001 $K$35=$K$36 Binding 0

Not
$L$35 West Plant 30 $L$35=$L$36 Binding 0

Not
$M$35 Dummy Plant 5 $M$35=$M$36 Binding 0

$J$28 A North Plant 10 $J$28=integer Binding 0

$K$28 A South Plant 1.42064E-08 $K$28=integer Binding 0

$L$28 A West Plant 0 $L$28=integer Binding 0

$M$28 A Dummy Plant 0 $M$28=integer Binding 0

$J$29 B North Plant 0 $J$29=integer Binding 0

$K$29 B South Plant 5 $K$29=integer Binding 0

$L$29 B West Plant 0 $L$29=integer Binding 0

$M$29 B Dummy Plant 0 $M$29=integer Binding 0

$J$30 C North Plant 0 $J$30=integer Binding 0

$K$30 C South Plant 15 $K$30=integer Binding 0

$L$30 C West Plant 0 $L$30=integer Binding 0

$M$30 C Dummy Plant 0 $M$30=integer Binding 0

$J$31 D North Plant 0 $J$31=integer Binding 0

$K$31 D South Plant 0 $K$31=integer Binding 0

$L$31 D West Plant 20 $L$31=integer Binding 0

$M$31 D Dummy Plant 0 $M$31=integer Binding 0

$J$32 E North Plant 0 $J$32=integer Binding 0

$K$32 E South Plant 9.88098E-15 $K$32=integer Binding 0

$L$32 E West Plant 10 $L$32=integer Binding 0

$M$32 E Dummy Plant 0 $M$32=integer Binding 0

$J$33 F North Plant 20 $J$33=integer Binding 0

$K$33 F South Plant 0 $K$33=integer Binding 0

$L$33 F West Plant 0 $L$33=integer Binding 0

$M$33 F Dummy Plant 0 $M$33=integer Binding 0

$J$34 G North Plant 0 $J$34=integer Binding 0

$K$34 G South Plant 10 $K$34=integer Binding 0

$L$34 G West Plant 0 $L$34=integer Binding 0

 $M$34 G Dummy Plant 5 $M$34=integer Binding 0
In other words optimal solution is as follows:

Customer Plant Number of units

A NORTH 10

B SOUTH 5

C SOUTH 15

D WEST 20

E WEST 10

F NORTH 20

G SOUTH 10
Comment