- #1
evinda
Gold Member
MHB
- 3,836
- 0
Hello! (Wave)
An industry produces 2 kinds of a product $k_1$ and $k_2$ at its 3 factories $F_1, F_2, F_3$.
At the following matrix we can see the hours that are needed from each factory for the production of one kilogram of $k_1$ and $k_2$.
$\begin{matrix}
& F_1 & F_2 & F_3\\
k_1 & 2 & 3 & 1\\
k_2 & 3 & 2 & 2
\end{matrix}$
The profit per kilogram is $300$ euros for $k_1$ and $250$ for $k_2$.
The factory $F_1$ is able to work till $16$ hours, $F_2$ till $18$ hours, $F_3$ till $10$ hours.
I want to find how many kilograms of each product have to be produced the day so that the profit of the industry is maximized.So do we have to find an objective function with some restrictions or do we use dynamic programming? (Thinking)
An industry produces 2 kinds of a product $k_1$ and $k_2$ at its 3 factories $F_1, F_2, F_3$.
At the following matrix we can see the hours that are needed from each factory for the production of one kilogram of $k_1$ and $k_2$.
$\begin{matrix}
& F_1 & F_2 & F_3\\
k_1 & 2 & 3 & 1\\
k_2 & 3 & 2 & 2
\end{matrix}$
The profit per kilogram is $300$ euros for $k_1$ and $250$ for $k_2$.
The factory $F_1$ is able to work till $16$ hours, $F_2$ till $18$ hours, $F_3$ till $10$ hours.
I want to find how many kilograms of each product have to be produced the day so that the profit of the industry is maximized.So do we have to find an objective function with some restrictions or do we use dynamic programming? (Thinking)