Skip to content

Update README.md #880

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jul 13, 2025
Merged

Update README.md #880

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 8 additions & 7 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1867,7 +1867,10 @@ v_1 &= 12, \quad v_2 = 18, \quad v_3 = 24 \\

<br>

**Conclusion:** Negative reduced costs ($ x_{12}, x_{13}, x_{23} $) mean the solution is **still not optimal**. Further iterations are required.
**Conclusio** Negative reduced costs ($ x_{12}, x_{13}, x_{23} $) mean the solution is **still not optimal**. Further iterations are required.

[**Conclusion**](): Negative reduced costs ($x_{12}$, $x_{13}$, $x_{23}$) mean the solution is **still not optimal**. Further iterations are required.


<br>

Expand All @@ -1881,6 +1884,9 @@ Most negative reduced cost: $\bar{c}_{13} = -6$.

<br>


---\\\ UNDER CONTR🚛🚛🚛

#### [4.2](). Construct the Closed Loop

- **Loop Path**: $ x_{13} \rightarrow x_{33} \rightarrow x_{31} \rightarrow x_{11} \rightarrow x_{13} $.
Expand Down Expand Up @@ -1956,12 +1962,7 @@ Recalculating reduced costs confirms all $ \bar{c}_{ij} \geq 0 $. **Optimal solu
This is the optimal solution with all reduced costs non-negative.




### Under Construction 🚛

<br><br><br><br><br><br><br><br><br>

<br>

# XIII - [Designation]():

Expand Down