Recent questions in Operational Research

No documents found, press Enter to search

Linear programming models

A firm you work for manufactures two types of secondary storage devices; type A and B. For any month it must produce at least 250 units of A and 100 units of type B. The maximum total requirement of type A and B is 1,250 units and minimum total requirement is 500 units. Both types are to be processed on machines M1 and M2. Total number of available machine hours is 3,000 hours for each machine. Processing times in hours for each of the devices on machines M1 and M2 are as follows:​​Products​​MachinesAB​M11.52​M211.5​Profit/unit (Ksh)400600​​​Formulate as a Linear Programming Problem. (6 Marks)
0

Linear programming models

A firm you work for manufactures two types of secondary storage devices; type A and B. For any month it must produce at least 250 units of A and 100 units of type B. The maximum total requirement of type A and B is 1,250 units and minimum total requirement is 500 units. Both types are to be processed on machines M1 and M2. Total number of available machine hours is 3,000 hours for each machine. Processing times in hours for each of the devices on machines M1 and M2 are as follows:​​Products​​MachinesAB​M11.52​M211.5​Profit/unit (Ksh)400600​​​Formulate as a Linear Programming Problem. (6 Marks)
0

Tools and techniques

history , tools and techniques
1

Tools and techniques

history , tools and techniques
1

Linear programming models

A firm you work for manufactures two types of secondary storage devices; type A and B. For any month it must produce at least 250 units of A and 100 units of type B. The maximum total requirement of type A and B is 1,250 units and minimum total requirement is 500 units. Both types are to be processed on machines M1 and M2. Total number of available machine hours is 3,000 hours for each machine. Processing times in hours for each of the devices on machines M1 and M2 are as follows:​​Products​​MachinesAB​M11.52​M211.5​Profit/unit (Ksh)400600​​​Formulate as a Linear Programming Problem. (6 Marks)
0
Operational Research