0% found this document useful (0 votes)
2 views4 pages

Examples CH 2

The document provides multiple examples of linear programming problems across various industries, including clothing production, flour milling, product manufacturing, and chocolate production. Each example outlines the constraints and objectives, such as maximizing profit or minimizing costs, while detailing the resources and requirements for each product. The document serves as a guide for formulating linear programming models to optimize production and resource allocation.

Uploaded by

kenzuabdela8
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views4 pages

Examples CH 2

The document provides multiple examples of linear programming problems across various industries, including clothing production, flour milling, product manufacturing, and chocolate production. Each example outlines the constraints and objectives, such as maximizing profit or minimizing costs, while detailing the resources and requirements for each product. The document serves as a guide for formulating linear programming models to optimize production and resource allocation.

Uploaded by

kenzuabdela8
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Examples

Example 2.1: A company has three operational departments (weaving,


processing, and packing) with the capacity to produce three different types
of clothes namely suiting, shirting, and woolens yielding a profit of Birr 2, 4,
and 3 respectively. One meter of suiting requires 3 minutes in weaving, 2
minutes in processing, and 1 minute in packing. Similarly, one meter of
shirting requires 4 minutes in weaving, 1 minute in processing, and 3
minutes in packing. One meter of woolen requires 3 minutes in each
department. In a week, the total run time of each department is 60, 40, and
80 hours for weaving, processing, and packing respectively. Required:
Formulate the linear programming problem (LPP) to find the product mix to
maximize the profit.

Example 2.2: A company owns two flour mills (A and B) which have different
production capacities for high, medium, and low-grade flour. this company
has entered a contract to supply flour to a firm every week with 12, 8, and 24
quintals of high, medium, and low grade respectively. it costs the cost
Br.1000 and Br.800 per day to run mill a and mill b respectively. on a day,
mill a produce 6, 2, and 4 quintals of high, medium, and low-grade flour
respectively. mill b produces 2, 2, and 12 quintals of high, medium, and
low-grade flour respectively. Required: Formulate an LPP model to minimize the
total cost of the company.

Example 2.3: A small-scale manufacturer produces two types of products A and B which
give a profit margin of Birr 4 and Birr 3, respectively. There are two plants I and II, each
having a capability of 72 and 48 hours per day. Cycle times of A and B are 2 hours and 1
hour in plant number I, respectively. Similar figures for plant II are 1 and 2 hours.
Formulate an LPP model for maximizing the profit.

Example 2.4: A firm can produce 3 types of clothes A, B, and C. Three kinds of wool are
required with the color’s red, green, and blue to produce the clothes. One unit of A-type
cloth consumes 4 meters of red and 6 meters of blue wool. One unit of B-type cloth needs 6
meters of red, 4 meters of green, and 4 meters of blue wool. Type C uses 10 meters of green
and 8 meters of blue. Available stocks are 80, 100, and 150 meters of red, green, and blue
wools. Profit margins per unit of A, B, and C are 15, 25, and 20 Birr, respectively. Formulate
an LPP model to maximize the profit.

Page | 1
Examples

Example 2.5: A firm makes product X and Y and has a total production of capacity of 9
tonnes per day. The firm has a permanent contract to supply at least 2 tons of X and at least
3 tons of Y per day to another company. Each tonne of X requires 20 machine hours
production time and each tonne of Y requires 50 machine hours production time, the daily
maximum possible number of machine hours is 360. All the firm’s output can be sold, and
the profit made is Br. 80 per tonne of X and Br. 120 per tonne of Y. It is required to
determine the production schedule for maximum profit and to calculate the profit.
Formulate linear programming model.

Example 2.6: A firm that assembles computers and computer equipment is about to start
production of two new microcomputers. Each type of micro-computer will require
assembly time, inspection time, and storage space. The amount of each of these resources
that can be devoted to the production of microcomputers is limited. The manager of the
firm would like to determine the quantity of each microcomputer to produce in order to
maximize the profit generated by sales of these microcomputers.
Additional information: In order to develop a suitable model of the problem, the manager
has met with design and manufacturing personnel. As a result of these meetings, the
manager has obtained the following information:
Type 1 Type 2
Profit per unit Birr 60 Birr 50
Assembly time per unit 4hrs 10hrs
time per unit 2hrs 1hr
Storage space per unit 3cubic ft 3cubic ft
The manager also has acquired information on the availability of company resources.
These weekly amounts are:
Resource Resource available
Assembly time 100hrs
Inspection time 22hrs
Storage space 39 cubic feet

The manager also meets with the firm’s marketing manager and learned that demand for
the microcomputers was such that whatever combination of these two types of

Page | 2
Examples

microcomputers is produced, all of the output can be sold. Required: Formulate the Linear
programming model.

Example 2.7: Consider a chocolate manufacturing company that produces only two types
of chocolate – A and B. Both the chocolates require Milk and Choco only. To manufacture
each unit of A and B, the following quantities are required. Each unit of A requires 1 unit of
Milk and 3 units of Choco and each unit of B requires 1 unit of Milk and 2 units of Choco.
The company kitchen has a total of 5 units of Milk and 12 units of Choco. On each sale, the
company makes a profit of Birr 6 and 5 per unit A and B sold, respectively. Now, the
company wishes to maximize its profit. Required: Formulate the Linear programming
model.

Example 2.8: A company manufactures two kinds of machines, each requiring a different
manufacturing technique. The deluxe machine requires 18 hours of labor, and 8 hours of
testing and yields a profit of $400. The standard machine requires 3 hours of labor, and 4
hours of testing and yields a profit of $200. There are 800 hours of labor and 600 hours of
testing available each month. A marketing forecast has shown that the monthly demand for
the standard machine is to be more than 150. The management wants to know the number
of each model to be produced monthly that will maximize total profit. Required: Formulate
a linear programming model.

Example 2.9: A furniture manufacturer makes two products chairs and tables. Processing
of these products is done on two machines A and B. A chair requires 2 hours on machine A
and 6 hours on machine B. A table requires 5 hours on machine A and no time on machine
B. There are 16 hours per day on machine A and 30 hours on machine B. Profit gained by
the manufacturer from a chair and table is 2 and 10, respectively. Required: Formulate a
linear programming model.

Example 2.10: A company has two factories (F1 and F2) which have different production
capacities for High, Medium and Low-grade flour. This company has entered contract
supply flour to a firm every week with 12, 8, and 24 quintals of High, Medium and Low
grade respectively. It costs the company Birr 1000 and Birr 800 per day to run F1 and F2
respectively. On a day, F1 produces 6, 2, and 4 quintals of High, Medium and Low-grade
flour respectively. F2 produces 2, 2 and 12 quintals of High, Medium and Low-grade flour
respectively. How many days per week should each factory is operated in order to meet the

Page | 3
Examples

contract order in minimum cost? Required: Formulate a linear programing model for this
problem

Page | 4

You might also like