Use simplex method for linear programming
Use simplex method for linear programming. Show solution for each iteration table.
Problem: A small firm that assembles computers is about to start production of two new types of personal computers. Each type will require assembly time, inspection time, and storage space. The amount of each of these resources that can be devoted to the production of the computers is limited. The manager of the firm would like to determine the quantity of each computer to produce in order to maximize the profit generated by sales of these computers. In order to develop a suitable model of the problem, the manager has met with design and manufacturing personnel. As a result of those meetings, the manager has obtained the following information:
Type 1 Type 2
Profit per unit $60 $50
Assembly time per unit 4 hours 10 hours
Inspection time per unit 2 hours 1 hour
Storage space per unit 3 cubic feet 3 cubic feet
The manager also has acquired information on the availability of company resources. These daily amounts are:
Resources available each day:
Assembly time 100 working hours
Inspection time 22 working hours
Storage space 39 cubic feet
The manager met with the firm’s marketing manager and learned that demand for the computers was such that whatever combination of these two types of computers is produced, all of the output can be sold.
Step by step
Solved in 3 steps
