Linear programming maximization

Linear programming maximization

Postby muttley » Wed May 02, 2012 4:45 am


Who knows to solve this problem of linear programming of maximization, explaining me all the steps to reach the solution.

total cost to produce the products a,b,c: 100

cost to produce the product a (x)= ? quantity to produce of product a = 5
cost to produce the product b (y)= ? quantity to produce of product b = 1.39
cost to produce the product c (z)= ? quantity to produce of product c = 1.77


I have three production lines, each is equipped with a different technology that does not allow me to produce the different products a, b, c in a single production line, so I necessarily use all three production lines, creating a product mix.

These are production functions related to each production line

line 1) ax + cy

line 2) (0.5by + 0.5y) + (0.5cz + o.5z)

line 3) bz

what are the production costs (x,y,z) that must support for each type of product (a,b,c) to be produced on the three production lines 1),2),3) to obtain ever the highest possible gain.
Considering that the costs of each type of product will be equal to its sale price (example: (x) is the cost to produce the product "a" will be equal to its sale price,The same goes for the other two products "b" and "c").
Consider also that the total cost must not exceed 100.
muttley
 
Posts: 1
Joined: Wed May 02, 2012 4:36 am
Reputation: 0

Return to Simultaneous Equations, Systems of Equations/Inequalities



Who is online

Users browsing this forum: No registered users and 2 guests