Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A firm makes batches of product P and batches of product Q. A batch of P earns thousand rupees and a batch of Q earns thousand rupees, so . Machine A allows hours, machine B allows hours, and the store holds batches. Find the maximum profit and the batches that give it, using the corners of the region or linprog. Then work out at the best point, and decide whether the storage rule matters.
If the rules clash, there is no feasible solution. If the lines are parallel to an edge, both corners of that edge, and every point between them, give the optimal value. linprog minimises, so negate to maximise and turn rules round by multiplying by .
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The machine lines. From we get . Then gives , so and .
Step 2. The values at the corners. The corners are , , and . is , , and . The maximum is at .
Step 3. The storage rule. At , , which is below . The storage line never touches the region, so the rule is redundant.
Answer: the maximum profit is thousand rupees, with batches of P and of Q. The storage rule does not matter.
Log in to join the discussion.
Loading…