In an interview, I was asked to frame the following optimization problem:
- A company produces two products $x,y$ using two machines $a,b$.
- To produce each product, both the machines are used together. It is not like either of the machines can be used to produce a product.
- Producing 1 unit of product $x$, it requires to run machine $a$ for 50 mins and machine $b$ for 30 mins.
- Producing 1 unit of product $y$, it requires to run machine $a$ for 24 mins and machine $b$ for 33 mins.
- Stock in hand for product $x$ is 30, $y$ is 90.
- Demand for product $x$ is 75 units, product $y$ is 95 units.
- Machine $a$ can be run at max for 40 hours, and $b$ can be run at max for 35 hours.
- The company wants to maximize the total production units of $x$ & $y$ ensuring it meets the demand.
The whole scenario is just for 1 week.
I framed it in following way. I chose the decision variables $x$ and $y$ representing units of product $x$ and $y$, respectively.
$$ \begin{array}{ll} \underset{x,y}{\text{maximize}} & x + y \\ \text{subject to} & 50x + 24y \leq 40 \cdot 60 \\ & 30x + 33y \leq 35 \cdot 60 \\ & x \geq 75-30 \\ & y \geq 95-90 \end{array} $$
I missed to add the integer constraints on $x$ & $y$ (they represent unit sales).
There were no more follow up questions, and I was rejected on the ground of technical depth. Can anyone help if I made a blunder in the above attempt to model the problem?