Skip to content

Commit 16e91a1

Browse files
Merge pull request #522 from Quantum-Software-Development/FabianaCampanari-patch-1
Update README.md
2 parents 94106eb + 4ccf8b8 commit 16e91a1

File tree

1 file changed

+16
-22
lines changed

1 file changed

+16
-22
lines changed

README.md

Lines changed: 16 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -1247,7 +1247,7 @@ This is a method to generate an initial feasible solution without considering tr
12471247

12481248
<br>
12491249

1250-
### 🔹 Steps:
1250+
### Steps:
12511251

12521252
1. **Start in the top-left (northwest) corner** of the transportation table.
12531253
- 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
12641264
<br>
12651265

12661266

1267-
## 💸 Least Cost Method (Método do Custo Mínimo)
1267+
## 💸 [Least Cost Method (Método do Custo Mínimo]():
12681268

12691269
This method takes into account the transportation costs to guide the initial allocation.
12701270

12711271
<br>
12721272

1273-
### 🔹 Steps:
1273+
### [Steps]():
12741274

12751275
1. **Identify the cell with the lowest unit cost** in the cost matrix among the remaining unallocated cells.
12761276
2. **Allocate as much as possible** to this cell, without exceeding supply or demand constraints.
12771277
3. **Adjust the supply and demand** for the row and column of the allocated cell.
12781278
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.
12791279
5. **Repeat** the steps until all supplies and demands are met.
12801280

1281+
1282+
<br>
1283+
1284+
12811285
⚠️ Unlike the Northwest Corner, this method **considers the costs** and usually leads to a **better initial solution**, closer to the optimal.
12821286

12831287
<br>
12841288

1285-
### 🔍 Link to Risk Analysis
1289+
### 🔍 [Link to Risk Analysis]():
12861290

12871291
- Unbalanced models simulate **shortage/surplus risks**.
12881292
- Dummy rows/columns help visualize **operational failures**.
12891293
- Solutions help identify:
12901294
- Where **stockouts** will occur
12911295
- How to **redistribute resources**
12921296
- Costs of **unserved demands**
1297+
1298+
<br>
12931299

12941300
This makes the model highly applicable to **supply chain risk management, disaster response logistics, and critical infrastructure planning**.
12951301

12961302
<br>
12971303

1298-
### 📐 Initial Basic Feasible Solution
1304+
### 📐 [Initial Basic Feasible Solution]():
12991305

13001306
A basic feasible solution must:
13011307
1. Satisfy **all row (supply)** and **column (demand)** constraints.
@@ -1306,18 +1312,22 @@ These principles ensure a **non-degenerate** starting point for iterative improv
13061312

13071313
<br>
13081314

1309-
## 🧩 Summary
1315+
### 🧩 [Summary]():
13101316

13111317
The transportation problem provides a clear, visual way to:
13121318
- Model **linear resource flows**,
13131319
- Simulate **imbalances and failure points**,
13141320
- Optimize with **tailored algorithms**, and
13151321
- Integrate with **Simplex** and **risk frameworks** for smarter planning.
1322+
<br>
1323+
13161324

13171325
It's a cornerstone of **Operational Research**, **Logistics**, and **Decision Science**.
13181326

13191327

13201328

1329+
<br><br>
1330+
13211331

13221332

13231333

@@ -1370,22 +1380,6 @@ $x_1 \geq 0, \quad x_2 \geq 0\$
13701380
-->
13711381

13721382

1373-
<br>
1374-
1375-
1376-
1377-
1378-
1379-
1380-
1381-
1382-
1383-
1384-
1385-
1386-
1387-
<br><br><br><br><br><br>
1388-
13891383

13901384

13911385
## [Contribute]()

0 commit comments

Comments
 (0)