0% found this document useful (0 votes)
19 views5 pages

Linear Programming for Production Optimization

Finishing 1 3 eH w o. Profit (RM) 50 80 rs e 1) This document provides 9 problems involving linear programming formulations. Problem 1 describes a manufacturer producing two washing machine models to maximize profit. ou urc 2) Problem 2 involves a farmer utilizing 20 acres of land to maximize profit by planting broccolis or sweet potatoes. o 3) Problem 3 is about minimizing transportation costs by sending tires from a factory to two warehouses. aC s v i y re
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views5 pages

Linear Programming for Production Optimization

Finishing 1 3 eH w o. Profit (RM) 50 80 rs e 1) This document provides 9 problems involving linear programming formulations. Problem 1 describes a manufacturer producing two washing machine models to maximize profit. ou urc 2) Problem 2 involves a farmer utilizing 20 acres of land to maximize profit by planting broccolis or sweet potatoes. o 3) Problem 3 is about minimizing transportation costs by sending tires from a factory to two warehouses. aC s v i y re
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Foundation In Arts Tutorial 2 BB004 Quantitative Methods

Tutorial 2 – Linear Programming

1) A manufacturer of washing machines produces two (2) models of washing machines,


which are model A and model B. Information about the production processes, production
capacity and the profits from the sales are given in the following table.

Washing Process 1 Process 2 Process 3 Profit


Machine (in hour) (in hour) (in hour) (per unit)
Model A 5 2 2 RM 500
Model B 4 3 1 RM 300
Capacity 80,000 48,000 28,000

Formulate the linear programming problem above into a mathematical model. By using
graphical method, find the number of model A and model B that have to be produced in

m
er as
order for the manufacturer to obtain the maximum profit.

co
eH w
o.
2) A farmer wants to make use of a piece of land with an area 20 acres to plant broccolis
rs e
and sweet potatoes. Relevant information is given below:
ou urc
Maximum
Plantation Broccolis Sweet Potatoes
o

amount available
aC s

Cost per acre RM 100 RM 90 RM 1800


v i y re

Labour per acre 4 Days 2 Days 60 Days


Profit per acre RM 60 RM 40
ed d

The farmer wants to maximize his profit. Formulate the linear programming problem
ar stu

above into a mathematical model. Hence, advise the farmer on how to best utilize his 20
acres of land to achieve his target.
sh is
Th

3) A tyre factory needs to send at least 2000 tyres to two (2) warehouses. Each warehouse
can store a maximum of 1500 tyres. At present, the first warehouse has 300 tyres in its
store while the second warehouse has 100 tyres. The transportation costs per tyre from
the factory to the first and second warehouse are RM 4 and RM 8 respectively. How
many tyres should be sent to each warehouse so that the total transportation cost is
minimized?

4) A special diet must have the following minimum requirements:

1 09-19-2021 00:20:57 GMT -05:00


This study source was downloaded by 100000812178836 from [Link] on

[Link]
Foundation In Arts Tutorial 2 BB004 Quantitative Methods

 16 units of carbohydrates.
 38 units of vitamin.
 14 units of protein.
For every special diet, two types of ingredient X and Y are to be used. Each unit of
ingredient X contains 2 units of carbohydrates, 6 units of vitamin, and 6 units of protein,
and its cost is RM 1. Each unit of ingredient Y contains 6 units of carbohydrates, 8 units
of vitamin, and 2 units of protein, and its cost is RM 0.50. Determine how the special
diet should be prepared in order to satisfy all the requirements and minimize the cost?

5) Leary Ice Cream produces three flavors of ice cream: Chocolate, Vanilla, and
Strawberry. There ice creams are produced via two production processes: Process 1 and
Process 2. Running process 1 can produce 30 Chocolate ice creams, 10 Vanilla ice
creams, and 10 Strawberry ice creams, with cost RM 4 per hour. Running process 2 can
produce 10 Chocolate ice creams, 10 Vanilla ice creams only, with cost RM 1 per hour.

m
er as
To meet customer demands, at least 100 Chocolate ice creams, 50 Vanilla ice creams,

co
and 30 Strawberry ice creams must be produced daily. Formulate the problem in

eH w
mathematical model, determine how Leary Ice Cream can minimize the production

o.
processes cost to meet the daily demand using graphical method.
rs e
ou urc
6) A manufacturer produces two (2) types of machines, P and Q. To produce one unit of
machine P, it requires 10 units of steel pipe set, 10 units of engine set, and 90 units of
o

metal piece set. To produce one unit of machine Q, it requires 10 units of steel pipe set,
aC s

20 units of engine set, and 50 units of metal piece set. The amount of steel pipe set
v i y re

available is 6000 units, for engine set is 10000 units, and 45000 units for metal piece set.
The net profit obtained from selling one unit of machine P is RM 400 and that of
machine Q is RM 500. Find the optimal quantities of machine P and Q to produce in
ed d

order to obtain maximum profits from the existing materials.


ar stu

7) Mazni Company manufactures mountain bikes and sport bikes. It makes a profit of RM
sh is

40 on each mountain bike and RM 60 on each sport bike. Each mountain bike requires 2
Th

hours of production and 1 hour of assembly while each sport bike requires 2 hours of
production and 3 hours of assembly. The company allocates up to 300 hours of
production time and 200 hours of assembly time each week. Using graphical method,
what are the production levels in order to maximize the profit?

8) A trader wants to make two (2) types of cakes for sale. Cake A requires 400g of flour,
200g sugar and 8 eggs. Cake B requires 500g of flour, 500g of sugar and 5 eggs. The
trader has a supply of 12kg flour, 10kg of sugar, and 200 eggs every day. The profit he

2 09-19-2021 00:20:57 GMT -05:00


This study source was downloaded by 100000812178836 from [Link] on

[Link]
Foundation In Arts Tutorial 2 BB004 Quantitative Methods

receives from the sale of Cake A is RM 3 and sale of Cake B is RM 5. Formulate the
problem above in mathematical model. Hence, find the number of Cake A and Cake B
that have to be made in order to achieve maximum profit using graphical method.

9) A factory manufactures two (2) types of chairs, wooden-typed and stainless steel-typed.
Each unit of these chairs undergoes three (3) processes, namely production, assembling,
and finishing. The production process is performed in Production Department, the
assembling process in Assembling Department, and finishing process in Finishing
Department. The time taken for each unit of the product in each department and the
profit per unit of chair are shown in the table below.

Time (min) required per unit of the product


Department
Wooden Stainless steel

m
Production 2 3

er as
Assembling 2 1

co
eH w
Finishing 1 1

o.
Profit per unit (RM)rs e 4 5
ou urc
The departments will operate for 16 hours, 12 hours, and 8 hours in a day, respectively.
Formulate the above problem in mathematical model. Hence, find the maximum profit
o

that the manufacturer can gain by using graphical method.


aC s
v i y re

10) UCSI International School is organizing a carnival day to raise fund to buy additional
reference books for the school library. Ms. Alicia offered to make cushion covers and
ed d

table napkins for sale at the carnival day. A cushion requires 50 minutes of cutting time
ar stu

and 75 minutes of sewing time. A table napkin requires 60 minutes of cutting time and
45 minutes of sewing time. Ms. Alicia cannot spend more than 16 hours to cut the
material and the sewing machine can only work for a maximum of 15 hours.
sh is

Furthermore, the total time taken for cutting cannot be more than the total sewing time
taken. The profit from selling the cushion covers and table napkins are RM 8 and RM 6
Th

per piece respectively. Formulate this problem into a mathematical model. Hence, find
the optimal solution by using graphical method.

11) For Questions 1 – 2, and 6 – 10, solve using Simplex method.

3 09-19-2021 00:20:57 GMT -05:00


This study source was downloaded by 100000812178836 from [Link] on

[Link]
Foundation In Arts Tutorial 2 BB004 Quantitative Methods

12) Solve the following Max linear programming problem:

Maximize z=2 x1 −x2 + x 3


Subject to 3 x1 + x 2 + x3 ≤ 60
x 1−x 2+2 x 3 ≤ 10
x 1+ x 2−x 3 ≤20
x 1 ≥ 0, x 2 ≥0, x 3 ≥ 0

13) A factory manufactures three (3) products A, B, and C. The production of these products
requires two (2) types of materials, P and Q. The factory manager has prepared the
following table:

Mass (g) required per unit of the product


Raw Material

m
A B C

er as
co
P 2 2 3

eH w
Q 3 4 10

o.
Profit per unit (RM) 1 3 6
rs e
ou urc
The daily supplies of P and Q are limited to 5kg and 12kg respectively. By using
Simplex method, suggest how the manager should manage his production to obtain
o

maximum profit
aC s
v i y re

14) A toy company produces three car models: A, B and C. To produce these cars, three
types of machines are used, that are, a metal car frame making machine, a spray painting
ed d

machine and a packing machine. The time (in hours) each machine is in operation to
ar stu

produce each type of model and the profits for each model is shown in the table below.

Frame Spray
sh is

Model Packing Profit


Making Painting
Th

A 1.0 0.5 0.2 RM 0.50


B 1.4 1.0 0.2 RM 1.00
C 1.0 0.5 0.5 RM 1.50

The maximum time per week for each machine is 3200 hours for frame making, 1600
hours for spray painting and 1000 hours for packing. Determine the number of cars for
each model which must be produced to obtain the maximum profit.
15) Lorenso manufactures two kinds of chairs, one model TX and another GX model. Each
TX model requires 6 minutes of assembly and 2 minutes of finishing while GX model
requires 10 minutes of assembly and 4 minutes of finishing at Assembly Department and

4 09-19-2021 00:20:57 GMT -05:00


This study source was downloaded by 100000812178836 from [Link] on

[Link]
Foundation In Arts Tutorial 2 BB004 Quantitative Methods

Finishing Department respectively. Each model of chair goes through 4 minutes of


quality control. There are 4 machines at the Assembly Department and each will operates
45 minutes per hour. The Finishing Department is staffed by 4 people while 2 members
of staff are located at the Quality Control Department. A survey done at the factory
showed that each member of staff needs a rest of 10 minutes per hour of work. Each TX
model chair brings in a profit of RM 50 and each GX model chair earns a profit of RM
60. Using Simplex method, determine the quantity of chairs that should be produced to
achieve maximum profit.

16) The Dakota Furniture company manufactures desk, tables, and chairs. The manufacturer
of each type of furniture requires lumber and two types of skilled labour: finishing and
carpentry. The amount of each resource needed to make each type of furniture is given in
the table below:

m
er as
Resource Desk Table Chair Capacity

co
Lumber 8 board ft. 6 board ft. 1 board ft. 48

eH w
Finishing hours 4 hours 2 hours 1.5 hours 20

o.
Carpentry hours
rs e 2 hours 1.5 hours 0.5 hours 8
ou urc
Profit RM 60 RM 30 RM 20

The Dakota believes that at most 5 tables can be sold, but others are unlimited.
o

Determine how Dakota can maximize his profit in producing all these furniture.
aC s
v i y re

1) A manufacturer produces three (3) models of bikes. The time (in hours) required for
assembling, painting, and packaging each model is as follows.
ed d
ar stu

Model A Model B Model C


Assembling 2 2.5 3
sh is

Painting 1.5 2 1
Th

Packaging 1 0.75 1.25

The total time available for assembling, painting, and packaging are 4006 hours, 2495
hours, and 1500 hours, respectively. The profit per unit for each model is RM 45 (Model
A), RM 50 (Model B), and RM 55 (Model C). Determine the number of each model that
should be produced to obtain a maximum profit.

5 09-19-2021 00:20:57 GMT -05:00


This study source was downloaded by 100000812178836 from [Link] on

[Link]
Powered by TCPDF ([Link])

Common questions

Powered by AI

Let x₁ be number of Cake A, x₂ be Cake B. Maximize profit: Z = 3x₁ + 5x₂. Constraints: 400x₁ + 500x₂ ≤ 12000 for flour, 200x₁ + 500x₂ ≤ 10000 for sugar, and 8x₁ + 5x₂ ≤ 200 for eggs. Solve using graphical method to determine which resource use allows for optimum cake production, typically at feasible region's vertices .

To minimize transportation costs, let x₁ be the number of tyres sent to the first warehouse, and x₂ the number to the second warehouse. The objective function to minimize is C = 4x₁ + 8x₂. Constraints include x₁ + x₂ = 2000 to meet the minimum delivery requirement, x₁ ≤ 1200 and x₂ ≤ 1400 due to storage capacities after considering current stock. By solving these, sending 1200 tyres to the first warehouse and 800 tyres to the second warehouse minimizes cost at RM 9600 .

Let x₁, x₂, x₃ correspond to Models A, B, C. Maximize profit: Z = 0.50x₁ + 1.00x₂ + 1.50x₃. Constraints: 1x₁ + 1.4x₂ + 1x₃ ≤ 3200 for frame making, 0.5x₁ + 1x₂ + 0.5x₃ ≤ 1600 for spray painting, and 0.2x₁ + 0.2x₂ + 0.5x₃ ≤ 1000 for packing. Employ simplex or graphical method to determine optimal production quantities, focusing on balance of constraints to maximize profit efficiency .

Define decision variables for the hours of Process 1 and Process 2. The objective is to minimize cost: C = 4h₁ + 1h₂. Constraints based on demand are: 30h₁ + 10h₂ ≥ 100 for Chocolate, 10h₁ + 10h₂ ≥ 50 for Vanilla, and 10h₁ ≥ 30 for Strawberry. Using graphical method, finding the feasible solution that meets all demands at lowest cost involves analyzing intersections of constraints, resulting in specific hours for processes .

Let x₁ be the acres used for broccolis and x₂ for sweet potatoes. The objective is to maximize profit: P = 60x₁ + 40x₂. Constraints include x₁ + x₂ ≤ 20 for land use, 4x₁ + 2x₂ ≤ 60 for labor days, and 100x₁ + 90x₂ ≤ 1800 for cost. Solving this system using graphical or simplex method results in the optimal land use whereby the farmer should plant 10 acres of broccolis and 10 acres of sweet potatoes for a maximum profit of RM 800 .

Variables x₁, x₂, and x₃ represent desks, tables, and chairs produced. Maximize profit: P = 60x₁ + 30x₂ + 20x₃. Constraints are 8x₁ + 6x₂ + x₃ ≤ 48 for lumber, 4x₁ + 2x₂ + 1.5x₃ ≤ 20 for finishing hours, 2x₁ + 1.5x₂ + 0.5x₃ ≤ 8 for carpentry hours, and x₂ ≤ 5 for table sales limit. Solve using simplex method to find optimum production quantities .

Define variables x₁ for mountain bikes and x₂ for sport bikes. The profit function is P = 40x₁ + 60x₂. Constraints are 2x₁ + 2x₂ ≤ 300 for production time and 1x₁ + 3x₂ ≤ 200 for assembly time. Using the graphical method, plot constraints to determine feasible production quantities at intersection points, yielding maximum profits at specific bike production levels .

Define variables x₁ and x₂ for units of ingredient X and Y used. The objective is to minimize cost: C = 1x₁ + 0.5x₂. Constraints for nutrients are 2x₁ + 6x₂ ≥ 16 for carbohydrates, 6x₁ + 8x₂ ≥ 38 for vitamins, and 6x₁ + 2x₂ ≥ 14 for proteins. Solving this linear program using simplex or graphical methods provides the combination of X and Y at minimal cost while meeting nutritional requirements .

Variables x₁ and x₂ represent units of machine P and Q respectively. Maximize profit: Z = 400x₁ + 500x₂. Subject to constraints 10x₁ + 10x₂ ≤ 6000 for steel pipes, 10x₁ + 20x₂ ≤ 10000 for engine sets, and 90x₁ + 50x₂ ≤ 45000 for metal pieces. Solve using simplex or graphic methods to find profit maximization points relative to material constraints, typically evaluated at vertices of the feasible region .

To formulate a linear programming model for this problem, define decision variables x₁ and x₂ as the number of units of model A and model B produced, respectively. The objective function to maximize profit is Z = 500x₁ + 300x₂. Constraints are based on the production capacity for each process: 5x₁ + 4x₂ ≤ 80,000 for Process 1, 2x₁ + 3x₂ ≤ 48,000 for Process 2, and 2x₁ + x₂ ≤ 28,000 for Process 3. The graphical method involves plotting these constraints to find the feasible region and evaluating the objective function at the vertices of this region to find the optimal production levels .

You might also like