Skip to content

Commit 2118678

Browse files
Update README.md
Signed-off-by: Fabiana 🧬 Campanari <113218619+FabianaCampanari@users.noreply.github.com>
1 parent 7450dd0 commit 2118678

File tree

1 file changed

+8
-3
lines changed

1 file changed

+8
-3
lines changed

README.md

Lines changed: 8 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -156,7 +156,7 @@ $$
156156

157157
<br>
158158

159-
##### [***Note***](): ***This equation represents a simple solution to an ordinary differential equation.***
159+
##### [***Note***](): ***This equation represents a simple solution to an ordinary differential equation.***
160160

161161
<br>
162162

@@ -174,11 +174,15 @@ $$
174174

175175
A chocolate manufacturer has a stock of chocolates, consisting of 130 kg with cherry filling and 170 kg with mint filling. He decides to sell the stock in the form of two different assorted packages. One package contains a mix with half the weight in cherry chocolates and half in mint chocolates and sells for R$ 20.00 per kg. The other package contains a mix of one-third cherry chocolates and two-thirds mint chocolates and sells for R$ 12.50 per kg. How many kilograms of each mix should the seller prepare to maximize his sales profit?
176176

177+
<br>
178+
177179
### [Solution]():
178180

179181
### ***Objective Function***
180182

181-
### [Maximize]():
183+
### [Maximize]():
184+
185+
<br>
182186

183187
$$
184188
Z = 20x_1 + 12.5x_2
@@ -192,7 +196,7 @@ Z = 20x_1 + 12.5x_2
192196

193197
<br>
194198

195-
### [Subject to Constraints]():
199+
### [Subject to Constraints]():
196200

197201
$$
198202
\begin{cases}
@@ -216,6 +220,7 @@ $$
216220

217221
### [Solution Steps]():
218222

223+
<br>
219224

220225
1. Express the cherry chocolate constraint:
221226

0 commit comments

Comments
 (0)