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

Optimal Inspector Allocation for Umbrella Quality

This document presents four linear programming problems. The first problem seeks to determine the optimal assignment of two types of inspectors to inspect umbrellas. The second problem maximizes the profits of a company that manufactures three products. The third problem maximizes the earnings of a farmer by selecting among three types of animals. And the fourth problem maximizes the profits of a bank by allocating personal and car loans.

Translated by

ScribdTranslations
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)
2 views5 pages

Optimal Inspector Allocation for Umbrella Quality

This document presents four linear programming problems. The first problem seeks to determine the optimal assignment of two types of inspectors to inspect umbrellas. The second problem maximizes the profits of a company that manufactures three products. The third problem maximizes the earnings of a farmer by selecting among three types of animals. And the fourth problem maximizes the profits of a bank by allocating personal and car loans.

Translated by

ScribdTranslations
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

PROBLEM # 1

A factory that produces umbrellas has two types of inspectors (A and B)


production quality, who should be assigned for quality control. The
the factory policy requires that at least 18,000 umbrellas be
inspected daily (8 hrs.). Class A inspectors can review 250
umbrella/hour with 98% accuracy, while class B inspectors
They can inspect 150 umbrellas per hour with a 95% accuracy.

In the current market, inspector A charges $450/hour and inspector B charges


$150/hour
from class A and 10 from class B. The factory director, Mr. Méndez, wants to
determine the optimal inspection allocation.

Type of Inspection Accuracy Hourly rate Cost/Error


 A 8 250 98% $ 450 $100
B 10 150 95% $ 150 $100

XjOptimal quantity of type A and B inspectors, with the aim of producing a certain
number of good umbrellas per day at the lowest possible cost.
X1Number of type A inspectors to assign.
X2Number of type B inspectors to assign.

Type A inspectors
$450
Cost per day = (8)($450) = $3600
Paraguas revisados por día=(8)(250)= 2000
Umbrellas inspected well per day = (2000)(0.98) = 1960
Bad umbrellas = (2000)(0.02) = 40
Cost of the error per day = (40)($100) = $4000
Total cost per day for employing an Inspector type A = $3600 + $4000 = $7600

Type B inspectors
$150
Cost per day = (8)($150) = $1200
Umbrellas checked per day=(8)(150)= 1200
Umbrellas inspected well per day = (1200)(0.95) = 1140
Bad umbrellas = (1200)(0.05) = 60
Cost of error per day = (60)($100) = $6000
Total cost per day when employing a type B inspector = $1200 + $6000 = $7200

F.O. Zmin= 7600 X1+ 7200 X2


s.a
R1(Good umbrellas) 1960 X1+ 1140 X2>= 18,000
R2(Insp. A) X1 <= 8
R3(insp. B) X2<= 10
Xj >= 0; j= 1,2;
PROBLEM # 2

Company Z manufactures 3 products for the growing market of the


computing: Diskette, tape cassette, and cleaning cartridges. The contribution
the unitary profit for each product is as follows:
$2 per diskette, $1 per cassette, and $3.50 per cartridge. Each one of
these products go through 3 manufacturing and testing centers as part
of the production process. The times required in each of the
centers to manufacture one unit of each of the 3 products are in the
next table.

Product Center1 Center2 Center3

Floppy disk 3 2 1
Cassette 4 1 3
Cartridge 2 2 2
Hours/week 60 40 80

XjOptimal quantity to produce of the 3 products in order to maximize the


utility.
X1Diskette
X2Cassette
X3Cleaning cartridge

F.O. = Zmax2X1+ X2+ 3.5 X3


s.a:
Center 1 3X1+ 4X2+ 2X3<= 60
(Center 2) 2X1+ X2+ 2X3<= 40
(Center 3) X1+ 3X2+ 2X3<= 80
Xj>=0;
j=1,2,3;

PROBLEM # 3

A farmer wants to determine what is the best selection of animals for


their farm with the aim of maximizing their profits from the sale of their animals
at the end of summer. You can choose between buying sheep, cattle, or goats. Each
lamb requires one acre (4459 m)2for pasture and $15 for feed and
treatment. A lamb costs $25 and is sold for $60. For the cattle, those values
son 4 acres, $30 ,$40 y $100. Y para las cabras los valores son ½ $5, $10 y $20.
The farm has 300 acres and has $2500 to invest in purchases and
maintenance of the herd. Finally, the farmer does not want more than 40%
that your animals are goats and that the sheep are less than 30%. Set out the
linear programming problem to maximize profits.

Animals Land (Acres) Cost of Price of Utility Cost of


Limiting
Purchase Sale
Maintenance

Lambs 1 $25 $60 $20 $15


>=30%

Reses 4 $40 $100 $30 $30

Goats ½ $10 $20 $5


$5 <= 40%

Xj Optimal amount of sheep, goats, or cattle to buy for preparation and


sell them later at the end of summer in order to maximize the
utilities.
X1Sheep
X2Cattle
X3Goats

F.O. = Zmax20X1+ 30X2+ 5X3

X1+4X2+ ½ X3<= 300


X1 >=0.30(X1+X2+X3)
X3<=0.40(X1+X2+X3)
40X1+70X2+15X3<= 2500
X1,X2,X3>=0;

PROBLEM # 4

A small bank assigns a maximum of $20000 for loans


personal and auto loans during the next month. The bank charges a rate of
annual interest of 14% on personal loans and 12% on loans for
automobile. Both types of loans are settled over a period of 3 years. The amount
the car loans must be at least 2 times greater than
the personal loans. Past experience has shown that the
uncovered debts at the end of each period constitute 1% of all the
personal loans How should the amounts be allocated in such a way that
How to maximize profits for the Bank? Formulate the problem as a model
of P.L.

XjOptimal amount of funds to allocate, with the aim of maximizing the


profits for the bank.
X1Personal loans
X2Car loans

Available Amount Annual Rate Period to Settle Amount


of loans

Personal 14% X1
$20,000 3 Years
P/Automobiles 12% X2Greater than or equal to 2X1

F.O. = Zmax(0.14)X1(3) - 0.01X+


1 (0.12)X2(3)
s.a:
X2>=2X1
X1+ X220,000
X1,X2>=0;

You might also like