We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4e6e2c6 commit e4752d7Copy full SHA for e4752d7
README.md
@@ -620,17 +620,17 @@ Mathematically model the Linear Programming (LP) problem.
620
621
<br>
622
623
-#### 1. Define the decision variables:
+#### 1. [Define the decision variables]():
624
625
• Let:
626
627
-$ x_1 = quantity produced of product P1 $
628
-$ x_2 = quantity produced of product P2 $
+$x_1 = quantity produced of product P1$
629
630
-<br>
+$x_2 = quantity produced of product P2$
631
+<br>
632
633
-#### 2. Objective function:
+#### 2. [Objective Function]():
634
635
Maximize total profit, which is the sum of the profit from each product multiplied by the quantity produced:
636
0 commit comments