6690 - Using Computers in Mathematics Instruction
Danie Brink
Essay 3 Linear Programming Continued
Step 2: Finding the feasable region - the region that complies with all the constraints in 1).
A factory produces two types of rugby balls, type A amd type B. The nature of the factory is such that it places the following constraints on production:
a) The factory can only produce a maximum of 10 type A rugby balls per day - y < 10
b) The factory can only produce a maximum of 8 type B rugby balls per day - x < 8
c) The factory has a contract with a vendor which forces them to produce at least 11 rugby balls per day (of any kind) - x + y > 11
d) Because of storage limitations, the factory should not exceed a total of 16 rugby balls - x + y < 16
Link to the Main Linear Programming Page
Link to the previous Linear Programming Page
Link to my 6680 Main Page
Link to my 6690 Main Page