Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
0Activity
0 of .
Results for:
No results containing your search query
P. 1
Toy Problem

Toy Problem

Ratings: (0)|Views: 3|Likes:
Published by Kamzalian Tomging

More info:

Published by: Kamzalian Tomging on Jun 08, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

06/08/2012

pdf

text

original

 
1. A toy company manufactures two types of dolls, a basic version doll-A and adeluxe version doll-B. Each doll of type B takes twice as long to produce as oneof type A, and the company would have time to make maximum of 1000 perday. The supply of plastic is sufficient to produce 1000 dolls per day (both A & Bcombined). The deluxe version requires a fancy dress of which there are only500 per day available. If the company makes a profit of Rs 3.00 and Rs 5.perdoll, respectively on doll A and B, then how many of each doll should beproduced per day in order to maximise the total profit. Formulate thisproblem.
Let x 
1
and x 
2
be the number of basic and deluxe version of toys manufactures per day by the company.
The given problem can be formulated asMax, Z=3 x
1
+5 x
2
,Subjected to constraints,
 x 
1
+2 x 
2
≤1000, x 
1
+ x 
2
≤1000, x 
2
≤500 and x 
1
, x 
2
≥0.
The problem for the three types of constraints can be graphically represented asbelow:
Fig: production of Toy of types A and B.
The vertices are at A(1000,0),B(500,500) and C(0,500) of which the value of Z canbe tabulated as:
Page
1

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->