Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
386 views

Linear Programming Examples

1) A company produces two products (X and Y) using two machines with limited time. The problem is formulated as a linear program to maximize total stock at the end of the week given production time constraints and demand. The solution is X=45 units and Y=6.25 units. 2) A carpenter makes tables and chairs with limited time and storage. The problem is formulated as a linear program to maximize profit given constraints. The solution is 1.333 tables and 10.667 chairs for £146.667 profit. 3) A camera assembler has limited funds and time to assemble two camera types. The problem is formulated as a linear program to maximize profit. 4) A pension

Uploaded by

goforjessica
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
386 views

Linear Programming Examples

1) A company produces two products (X and Y) using two machines with limited time. The problem is formulated as a linear program to maximize total stock at the end of the week given production time constraints and demand. The solution is X=45 units and Y=6.25 units. 2) A carpenter makes tables and chairs with limited time and storage. The problem is formulated as a linear program to maximize profit given constraints. The solution is 1.333 tables and 10.667 chairs for £146.667 profit. 3) A camera assembler has limited funds and time to assemble two camera types. The problem is formulated as a linear program to maximize profit. 4) A pension

Uploaded by

goforjessica
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 7

Linear programming problems

1) A company makes two products (X and Y) using two machines (A and B). Each unit of
X that is produced requires 50 minutes processing time on machine A and 30 minutes
processing time on machine B. Each unit of Y that is produced requires 24 minutes
processing time on machine A and 33 minutes processing time on machine B.
At the start of the current week there are 30 units of X and 90 units of Y in stock.
Available processing time on machine A is forecast to be 40 hours and on machine B is
forecast to be 35 hours. The demand for X in the current week is forecast to be 75 units
and for Y is forecast to be 95 units. Company policy is to maximise the combined sum of
the units of X and the units of Y in stock at the end of the week.

Formulate the problem of deciding how much of each product to make in the
current week as a linear program.
Solve this linear program graphically.

2) A carpenter makes tables and chairs. Each table can be sold for a profit of 30 and
each chair for a profit of 10. The carpenter can afford to spend up to 40 hours per week
working and takes six hours to make a table and three hours to make a chair. Customer
demand requires that he makes at least three times as many chairs as tables. Tables take
up four times as much storage space as chairs and there is room for at most four tables
each week.
Formulate this problem as a linear programming problem and solve it graphically.
3) Joe assembles two types of cameras, the excelerio and the premerio. His cost of
assembling these cameras is $21.00 and $42.00 respectively. The total funds available for
his use are $1,260.00. It takes 5 hours to assemble an excelerio and 2 hours to assemble a
premerio. He can work for no more than 100 hours. If the profit on the two kinds of
cameras is $8.00 and $10.00 respectively, determine how many cameras of each kind Joe
should assemble to earn maximum profit.
4) A pension fund has $30 million to invest. The money is to be divided among Treasury
notes, bonds, and stocks. The rules for administration of the fund require that at least $3
million be invested in each type of investment, at least half the money be invested in
Treasury notes and bonds, and the amount invested in bonds not exceed twice the amount
invested in Treasury notes. The annual yields for the various investments are 7% for
Treasury notes, 8% for bonds, and 9% for stocks.
How should the money be allocated among the various investments to produce the largest
return?
Getting started: In millions of dollars, let x= the amount in Treasury notes, y= the amount
in bonds, and 30-(y+y)= the amount in stocks.

Solution 1
Let

x be the number of units of X produced in the current week


y be the number of units of Y produced in the current week

then the constraints are:


50x + 24y <= 40(60) machine A time
30x + 33y <= 35(60) machine B time
x >= 75 - 30
i.e. x >= 45 so production of X >= demand (75) - initial stock (30), which ensures we
meet demand
y >= 95 - 90
i.e. y >= 5 so production of Y >= demand (95) - initial stock (90), which ensures we
meet demand
The objective is: maximise (x+30-75) + (y+90-95) = (x+y-50)
i.e. to maximise the number of units left in stock at the end of the week
It is plain from the diagram below that the maximum occurs at the intersection of x=45
and 50x + 24y = 2400

Solving simultaneously, rather than by reading values off the graph, we have that x=45
and y=6.25 with the value of the objective function being 1.25

Solution 2
Let
xT = number of tables made per week
xC = number of chairs made per week
Constraints

total work time

6xT + 3xC <= 40

customer demand

xC >= 3xT

storage space

(xC/4) + xT <= 4

all variables >= 0

Objective
maximise 30xT + 10xC
The graphical representation of the problem is given below and from that we have that
the solution lies at the intersection of
(xC/4) + xT = 4 and 6xT + 3xC = 40
Solving these two equations simultaneously we get xC = 10.667, xT = 1.333 and the
corresponding profit = 146.667

Problem 4 (stocks bonds) The constraints are:

and the objective function to be maximized is:

The corresponding set of linear equations are:

The feasible region is:


The maximum return is $2.5 million when x=5 million and y=10 million.

You might also like