Showing posts with label linear programming word problems. Show all posts
Showing posts with label linear programming word problems. Show all posts

Monday, September 20, 2010

linear programming word problems

Let us solve linear programming word problems

Let us take 2 variables x and y to represent the number of chairs & tables respectively.
Hence the price of x tables = 1200x & the price of y chairs = 500y.
Here the total investment cannot be more than 50,000, therefore,
The total price = 1200x + 500y ≤ 50,000. This is the 1st constraint inequality.
Here, hence the storage capacity is for 100 pieces, we have x + y ≤ 100. This is the 2nd constraint equation. Hence the number of chairs & the number of tables non-negative, we have x ≥ 0, y ≥ 0.
Now, profit on y chairs = 75y. & the profit on x tables is 180 xs
Here, the objective is to maximize the profit, so the objective function is 180x + 75y.
Hence the linear programming model is given by:
Maximize Z = 180x + 75y
Subject to the constraints
1200x + 500y ≤ 50,000
x + y ≤ 100
x ≥ 0, y ≥ 0.
In our next blog we shall learn about partial fraction calculator I hope the above explanation was useful.Keep reading and leave your comments.