This document contains instructions for three linear programming problems to solve. The first problem involves maximizing a function subject to three constraints. The second problem involves minimizing a function subject to three constraints. The third problem involves formulating a linear programming model to determine the optimal product mix for a company producing three types of bags given material constraints and demand constraints.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
107 views
Assignment LP-graphical
This document contains instructions for three linear programming problems to solve. The first problem involves maximizing a function subject to three constraints. The second problem involves minimizing a function subject to three constraints. The third problem involves formulating a linear programming model to determine the optimal product mix for a company producing three types of bags given material constraints and demand constraints.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2
QMT425/429
Assignment 2 Date of submission: 1st September 2010
1. Solve the following Linear Programming problem using corner-point
method. Maximize Z = 4x1 + 5x2 Subject to 3x1 + 5x2 ≥ 9 2x1 + x2 ≤ 16 2x1 ≤ 10 x1, x2 ≥ 0 [6 marks] 2. Solve by the corner point method the following Linear Programming problem. Minimize Z = 20x1 + 14x2 Subject to 3x1 + 2x2 ≥ 180 x1 + 5x2 ≤ 75 x1 ≤ 3x2 x1, x2 ≥ 0 [3 marks] 3. A company produces three types of bags; type A, type B and type C. All types of bags are made of one raw material, of which maximum daily availability is 240 lb. The usage rates of the raw material are 3 lb per unit of type A, 6 lb per unit of type B, and 4 lb per unit of type C. Each unit sold for type A, B and C hats will yield a profit of $35, $30 and $45 respectively. The sales volume for type A is at least 60% of the total sales of both type A and B. However, the company cannot sell more than 70 units of type A and C per day. a. Formulate an LP model for the above problem. b. Determine the optimal product mix for the company using the Simplex Method. [11 marks]