You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+16-22Lines changed: 16 additions & 22 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1247,7 +1247,7 @@ This is a method to generate an initial feasible solution without considering tr
1247
1247
1248
1248
<br>
1249
1249
1250
-
### 🔹 Steps:
1250
+
### ➢ Steps:
1251
1251
1252
1252
1.**Start in the top-left (northwest) corner** of the transportation table.
1253
1253
- This is always cell $begin:math:text$ x_{11} $end:math:text$.
@@ -1264,38 +1264,44 @@ This is a method to generate an initial feasible solution without considering tr
1264
1264
<br>
1265
1265
1266
1266
1267
-
## 💸 Least Cost Method (Método do Custo Mínimo)
1267
+
## 💸 [Least Cost Method (Método do Custo Mínimo]():
1268
1268
1269
1269
This method takes into account the transportation costs to guide the initial allocation.
1270
1270
1271
1271
<br>
1272
1272
1273
-
### 🔹 Steps:
1273
+
### ➢ [Steps]():
1274
1274
1275
1275
1.**Identify the cell with the lowest unit cost** in the cost matrix among the remaining unallocated cells.
1276
1276
2.**Allocate as much as possible** to this cell, without exceeding supply or demand constraints.
1277
1277
3.**Adjust the supply and demand** for the row and column of the allocated cell.
1278
1278
4.**Remove** (cross out) the row or column where supply or demand becomes zero. If both are zero simultaneously, cross out only one to maintain feasibility.
1279
1279
5.**Repeat** the steps until all supplies and demands are met.
1280
1280
1281
+
1282
+
<br>
1283
+
1284
+
1281
1285
⚠️ Unlike the Northwest Corner, this method **considers the costs** and usually leads to a **better initial solution**, closer to the optimal.
0 commit comments