166 views

Uploaded by Shyloo Gsa

or

- Morgan County Inspection Notes
- MB0032
- Operations Research01/02
- Engineering Optimization, 2nd Ed, Wiley (2006), 0471558141
- Lauderdale Co Inspection Reports
- Req 000000510914
- Ed Tutorials in Operations Research
- Individual Business Proposal.docx
- Kitchen Safety
- MB0032 set 1
- F&B Cost Controller Notes
- MB0032 Set 1
- notes8
- Big m Method
- Engineering 110 Spring 2013 Syllabus.pdf
- TSimplex
- Two Phase Procedure -- Operation Research
- Ilar's IQC
- Gmp - Session 10_ommd
- UEME3243-optimization_part4

You are on page 1of 9

1.1.ASIA Company owns a small paint factory that produces both exterior and interior house paints

for whole sale distribution. Two basic raw materials A and B are used to manufacture the paints.

The maximum availability of A is 6 tons a day; that of B is 8 tons a day. The daily requirement of

the raw material per ton of exterior and interior paints is summarized in the following table.

Tons of raw material per ton of paint

Exterior

Interior

maximum availability (tons)

Raw material A

1

2

6

Raw material B

2

1

8

A market survey has established that the daily demand for interior paints cannot exceed that of

exterior paint by more than 1 ton. The survey also shows that the maximum demand for interior

paint is limited to 2 tons daily. The whole sale price per ton is Rs 3 thousand for exterior paint

and Rs 2 thousand for interior paint. How much interior and exterior paints should the company

produce daily to maximize gross income.

1.2.The medical experts and dieticians tell us that it is necessary for an adult to consume at least 75

grams of protein, 85 grams of fat and 300 grams of carbohydrates daily. The following table

gives the food items, their analysis and the cost.

Food value (grams) per 100 grams

Food type

proteins

fat

carbohydrates

cost per kg(Rs)

1

8.0

1.5

35.0

1.00

2

18.0

15.0

-3.00

3

16.0

4.0

7.0

4.00

4

4.0

20.0

2.5

2.00

5

5.0

8.0

40.0

1.50 _

Minimum daily

requirement

75

85

300

Formulate this diet problem as a linear programming problem.

1.3.A company makes two kinds of leather belts. Belt P is high quality belt and belt Q is of lower

quality. The respective profits are Rs 2.00 and Rs 1.00 per belt. Each belt of type P requires twice

as much time as a belt of type Q, and if all the belts were of type Q the company could make

1000 per day. The supply of leathers sufficient for only 800 belts per day (both P and Q

combined). Belt P requires a fancy buckle and only 400 per day are available. There are only 700

buckles a day available for belt Q. Determine the optimal product mix.

1.4.A Company proposes to utilize each idle manpower to produce two different items say A and B.

The two items required the service of skilled person for cutting, planning and assembling. Each

unit of A requires 15 min for cutting, 30min for planning and 20 min for assembling while each

unit of B requires 20min, 50min and 10min respectively. Skilled person can through on cutting

machine have 3 hours idle time /day. The idle man hours available for planning is 8 hrs/day and

that for assembling 3hrs/day. Any number of items produced can be marketed and expected

profit/unit are Rs. 105 and Rs 120 for A and B respectively. Determine the number of units of A

and B produced so as maximize the total profit.

Page 1 of 9

1.5.A company sells two different products A and B. The company makes a profit of Rs. 4 and Rs. 3

per unit for product A and B respectively. The two products are produced in a common

production process and are sold in two different markets. The production process has a capacity

of 3000 man-hours. It takes three hours to produce one unit of A and one hour to produce one

unit of B .the market has been surveyed and the company officials feel that the maximum

number of units of A that can be sold is 800 and maximum of B is 1200 units .subject to these

limitations find the optimal solution using the graphical method.

1.6.A person requires 10, 12 and 12 units of chemicals A, B and C respectively for his garden. A

liquid product contains 5, 2 and 1 units respectively per jar. A dry product contains 1, 2 and 4

units of A, B and C per carton. If the liquid product sells for Rs 3 per jar and the dry product sells

for Rs 2 per carton, how many of each should be purchased in order to minimize the cost and

meet the requirements.

1.7.The manager of an oil-refinery has to design on the optimal mix of two blending processes of

which the inputs and outputs per production run are given below:

input

output

Process

crude A crude B

gasoline X

gasoline Y

1

5

3

5

8

2

4

5

4

4

The maximum amount available of A and B are respectively 200 and 150 units. Market

requirement shows that at least 100 units of X and 80 units of Y must be produced. The profits

from the process are Rs 3 and Rs 4 per run. Formulate this as a LPP and solve it graphically.

1.8.An electronic company manufactures two TV models each on a separate production line. The

daily capacity of the first line is 120 TVs and that of second is 150 TVs. Each unit of the first

model uses 10 pieces of a certain electronic component; where as each unit of the second model

requires 8 pieces of the same component. The maximum daily availability of the special

component is 1600 pieces. The profits per unit of models 1 and 2 are Rs 6000 and Rs 4000

respectively. Determine the optimum daily production of each model using graphical method.

1.9.A television company operates two assembly lines namely line 1 and line 2. Each line is used to

assemble the components of three types of televisions: colour, standard and economy. The

expected daily production as each line is as follows:

TV model

assembly line 1

assembly line 2

Color

3

1

Standard

1

1

Economy

2

6

The daily running costs for two lines average Rs.6000 for assembly line 1 and Rs.4000 for

assembly line 2. It is given that the company must produce at least 24 color, 16 standard and 48

economy TV sets (for which an order is pending). Determine the number of days the two lines

should be run to meet the requirements.

1.10.

Max Z = 3x1+2x2

subject to x1+2x2 6

2x1+x2 8

-x1+x2 1

x2 2

x1, x2 0

Page 2 of 9

1.11.

Min Z =2x+3y

subject to

x+y < 4

6x+2y>8

x+5y>4

x<3

y<3

x, y >0

1.12.

(a) max Z=20x1+20x2

subject to 36x1+6x2 108

3x1+12x2 36

20x1+10x2 10

x1+x2 20

x1, x2 0

subject to x1+x2 <1

-3x1+x2 >3

x1 ,x2 >0

subject to2x1+x240

x1 >20

x1+x2=20

x1,x20

1.13.

Max z = 2x1+ x2 + 3x3

2x1+4x2<4

x1+2x2+x3> 5

2x1+3x3>2

x1, x2> and x3 is unrestricted in sign

1.14.

Max z =3x1+2x2+4x3

Subject to 2x1+3x2+x3<30

x1+x2+3x3<30

x1+3x2+x3<24

x1, x2, x3>0

1.15.

Max z =x1+2x2+x3

Subject to 2x1+x2-x3 < 2

-2x1+x2+x3 > -7

4x1+x2+x3 < 6

x1, x2, x3 > 0

1.16.

Minimize z =4x1+ x2

Subject to 3x1+x2 = 3

4x1+3x2 6

x1+ 2x2 4

x1, x2 0

Darla / SMBS / VIT

Page 3 of 9

1.17.

Min z =x1+x2

Subject to 2x1+x2>4

x1+7x2>7

x1, x2>0

1.18.

Solve the following problem with the use of the artificial variables.

Minimize z = 3x1 + 2x2

subject to 3x1 + x2 3

4x1 + 3x2 6

x1 + x2 3

x1, x2 0

1.19.

Minimize z = x1+4x2

Subject to 2x1+x2<16

x1+2x2>12

x1, x2>0

1.20.

Max 6x1+3x2

Subject to 2x1+3x2<30

3x1+2x2=4

x1+x2>1

x1, x2>0

1.21.

Min z =4x1+3x2

Subject to 2x1+x2>10

-3x1+2x2<6

x1+x2>6

x1, x2>0

1.22.

Max z = x1+2x2

Subject to x1+2x2<8

x1+2x2<12

x1-x2<3

x1, x2>0

1.23.

Max z = 3x1+2x2

Subject to 4x1+3x2< 12

4x1+x2< 8

4x1-x2< 8

x1, x2>0

Page 4 of 9

1.24.

(a) max Z=3x1+9x2

subject to

x1+4x2 8

x1+2x2 4

x1, x2 0

subject to x1+2x2 <5

x1+x2 <4

x1 ,x2 >0

subject to x - x2 10

2x1 40

x1,x20

subject to 2x1+ x2 <2

3x1+4x2 >12

x1 ,x2 >0

1.25. A company has four warehouses W1, W2, W3 and W4. It is required to deliver a product

from these warehouses to three customers C1, C2 and C3. The warehouses have the following

amounts in stock:

Warehouse

W1

W2

W3

W4

No. of units

15

16

12

13

and the customers requirements are:

Customer

No. of units

C1

18

C2

20

C3

18

The table below shows the costs of transporting one unit from warehouse to the customer and

stock of warehouse and requirement of customer.

C1

C2

C3

W1

W2

11

W3

3

10

9

W4

Determine the optimal solution to the problem.

1.26.

Warehouse

Factory

W1

W2

F1

19

30

F2

70

30

F3

40

8

5

8

Warehouse Requirements

W3

50

40

70

7

W4

10

60

20

14

7

9

18

Page 5 of 9

Factory

capacity

1.27.

To

A

I

50

From II 90

III 250

4

Requirement

1.28.

C

220 1

170 3 Availability

50 4

2

Consumers

Suppliers

I

II

III

Required

1.29.

B

30

45

200

2

A B

Availability

6

4

1

6

4

8

6

15

14

12

5

31

8

9

2

10

Destinations

1 2 3 Capacities

1 2 2 3 10

Sources

2 4 1 2 15

3 1 3 40

Demands

20 15 30

The cost of shipment from third source to the third destination is not known. How many units

should be transported from the sources to the destination so that the total cost of transporting

all the units to their destinations is a minimum?

1.30.

Source

1.31.

1

21

17

32

6

1

2

3

Requirement

Destination

2

3

16

25

18

14

27

18

13

12

4

13

23

41

15

Availability

11

13

19

43

Origin

O1

O2

O3

Requirement

D1

1

3

4

20

Destination

D2

D3

2

1

3

2

2

5

40

30

D4

4

1

9

10

Availability

30

50

20

100

Page 6 of 9

1.32.

D1

4

16

8

72

O1

O2

O3

Requirement

D2

8

24

16

102

D3

8

16

24

41

availability

76

82

77

1.33. Solve the following transportation problem where all cell entries are unit profits of

transportation from any origin to any destination :

F1

F2

F3

Requirement

A

8

6

3

150

B

9

11

8

160

C

6

5

7

110

D

3

10

9

130

Availability

170

200

180

1.34. A company has four warehouses W1, W2, W3 and W4. It is required to deliver a product

from these warehouses to three customers C1, C2 and C3. The warehouses have the following

amounts in stock:

Warehouse

W1

W2

W3

No. of units

15

25

5

and the customers requirements are:

Customer

C1

C2

C3

C4

No. of units

5

15

15

10

The table below shows the costs of transporting one unit from warehouse to the customer and

stock of warehouse and requirement of customer.

C1

C2

C3

C4

W

10

2

20

11

1

W

12

7

9

20

2

W

0

14

16

18

3

Use the VAM to find the starting solution and find the optimal solution to the problem

1.35. There are three sources or origins which store a given product. These sources supply these

products to four dealers. The capacities of the sources and the demands of the dealers are given

below :

Sources

S1

150

S2

40

S3

80

Demands

D1

90

D2

70

D3

50

D4

60

Page 7 of 9

The cost of transporting the products from various sources to various dealers is shown below:

D1

D2

D3

D4

S1

27

23

31

69

S2

10

45

40

32

S3

30

54

35

57

Find out the optimal solution for transporting the products at a minimum cost.

1.36. An oil corporation has got three refineries P, Q, and R, and it has to send petrol to four

different deports A, B, C and D. The cost of shipping 1 gallon of petrol from each refineries to

each deport is given below: The requirements of deports and the available petrol at the refineries

are also given.

Deport

A

B

C

D

Available

P

10

12

15

8

130

Refinery

Q

14

11

9

10

150

R

20

5

7

18

170

Required

90

100

140

120

Find the minimum cost of shipping after obtaining an initial solution by Vogels

Approximation Method.

1.37. Four different jobs can be done on four different machines. The set up and take down time

costs are assumed to be prohibitively high for changeovers. The matrix below gives the cost in

rupees of producing job i on machine j.

Machine

M1

M2

M3

M4

J1

18

26

17

11

J2

13

28

14

26

Job

J3

38

19

18

15

J4

19

26

24

10

How should the jobs be assigned to the various machines so that the total cost is minimized?

1.38. A machine tool company decides to make four subassemblies through four contractors. Each

contactor is to receive only one subassembly. The cost of each subassembly is determined by the

bids submitted by each contractor and is shown in table in hundreds of rupees. Assign the

different subassemblies to contactors so as minimize the total cost.

S1

Subassembly

Contractor

C1

C2

15

13

C3

C4

14

17

S2

11

12

15

13

S3

13

12

10

11

S4

15

17

14

16

Page 8 of 9

1.39. A company has one surplus truck in each of the cities A, B, C, D and E and one deficit truck

in each of the cities 1, 2, 3, 4, 5 and 6. The distance between the cities in kilometers is shown in

the matrix below. Find the assignment of trucks from cities in surplus to cities in deficit so that

the total distance covered by vehicles is minimum.

1

2

3

4

5

6

A

12

10

15

22

18

10

18

25

15

16

12

11

10

14

10

13

13

12

12

11

13

10

1.40. A company has a team of four salesmen and there are four districts where the company wants

to start its business. After taking into account the capabilities of salesman and the nature of

districts, the company estimates that the profit per day in rupees for each salesman in each

district is as below.

1

2

3

4

A

16

10

14

11

14

11

15

15

Sales man

C

15

15

13

12

13

12

14

15

12

11

1.41. Four new machines M1, M2, M3, M4 and are to be installed in a machine shop. There are five

vacant places A, B, C, D and E available. Because of limited space, machine M2 cannot be placed

at C and M3 cannot be placed at A. Cij, the

assignment cost of machine i to place j in rupees

is shown below.

A

B

C

D

E

M1

10

M2

M3

M4

Page 9 of 9

- Morgan County Inspection NotesUploaded byAnonymous 7kLC0Xfa
- MB0032Uploaded byfais72
- Operations Research01/02Uploaded byYash koradia
- Engineering Optimization, 2nd Ed, Wiley (2006), 0471558141Uploaded byShivani Gupta
- Lauderdale Co Inspection ReportsUploaded byAnonymous nLvaQj
- Req 000000510914Uploaded bySiddharth Sopori
- Ed Tutorials in Operations ResearchUploaded byPasarel Cel Dragutzel
- Individual Business Proposal.docxUploaded byahay6116252
- Kitchen SafetyUploaded byGene Roy P. Hernandez
- MB0032 set 1Uploaded byGYANENDRA KUMAR MISHRA
- F&B Cost Controller NotesUploaded byAtif Sheikh
- MB0032 Set 1Uploaded byAbhishek Gupta
- notes8Uploaded bySuneel Shastry
- Big m MethodUploaded byEshan Maheshwari
- Engineering 110 Spring 2013 Syllabus.pdfUploaded byShobhit Garg
- TSimplexUploaded byKarla M. Eich
- Two Phase Procedure -- Operation ResearchUploaded byRavi Kumar
- Ilar's IQCUploaded byArdreen Reguyal
- Gmp - Session 10_ommdUploaded byK Sanmukha Patra
- UEME3243-optimization_part4Uploaded byYang Yew Ren
- IRJET-Linear Programming based Optimum Resource Utilization for Manufacturing of Electronic ToysUploaded byIRJET Journal
- Food MallUploaded byBitan Banerjee
- Chapter 2Uploaded byLyana Jaafar
- MB0032Uploaded byafreenmine
- fsdfsUploaded byoafwfwur
- part_cUploaded byTushar Kadiya
- buffer allocation problemUploaded byDocente Fede Tecnologico
- PARM-022-043-057Uploaded bysaket
- Business Area vs. Profit Center VsUploaded byzlatil
- COOKING1.pdfUploaded byudialan_430783918

- 3C2BF489EDCF4ABEB98ACBFC22D0BA3AUploaded byShyloo Gsa
- 00Uploaded byShyloo Gsa
- 03Uploaded byShyloo Gsa
- pv-sizingUploaded byShyloo Gsa
- Concentrating Solar Cookers SK14 and Scheffler With a Case Study on ThirupathyUploaded byShyloo Gsa
- Solar PondUploaded byShyloo Gsa
- 1 Solar CookersUploaded byShyloo Gsa
- Physics of Solar CellUploaded byShyloo Gsa
- harware project.docxUploaded byShyloo Gsa
- Harware ProjectUploaded byShyloo Gsa

- Coursera ZNYGALU793VJUploaded byMarybeth Missenda
- Diesel EmissionReductionUploaded byNguyen Nha
- Oldsmobile 98 - WikipediaUploaded byJaime Adrian
- Hierarchies in WebiUploaded byuday_bvh
- Richard C. Crepeau - NFL FootballUploaded byTibor Krepli
- Ancxc India Pestle AnalysisUploaded bybkaaljdaelv
- Bill Gross Investment Outlook May_02Uploaded byBrian McMorris
- Attorney General's Opinion Feral CatsUploaded byWSET
- WhatsApp MessengerUploaded byFabiano Andrade
- 298936433-Manual-Atl-sauter-Oper-Inst-Ba-695-Disc-Tool-Turret.pdfUploaded byVladimir Colombiano de Souza
- Saab R5-Supreme-Navigation-System-Manual.pdfUploaded byPrashant S Nagwekar
- Sbi FunctionsUploaded byDeepanker Bhardwaj
- China National Chemical Engineering No. 14 Construction Co., Ltd.pdfUploaded byousoulegrand
- F18 Installation Guide V1.1Uploaded byKashif Aziz Awan
- Recruitment & Selection ProcessUploaded byShaifullah Sharif
- 6e 2Uploaded byapi-293758690
- ACI_HowAirportsCompeteUploaded byDoris Acheng
- Ethical_Issues_of_Nestle.docUploaded byKamal Azam
- SYNOPSISUploaded byRajesh Kotturu
- To Illustrate or Clarify Your Application Data ATTACHMENTUploaded byAd Elou
- ukpga_20140014_enUploaded byVlad Bodogan
- Basics of Android App Development & Career Growth by AWAUploaded byAceWebAcademy
- NORSOK -001Uploaded bytkdrt2166
- Legal EthicsUploaded byA Lee Budaden
- Infineon BSC093N04LSG DS v02 01 EnUploaded byarafatasghar
- PROJECT 1.docxUploaded bypradeep
- Ms Tie in of Oily WaterUploaded bysharif339
- Imaginary Conversations With MyselfUploaded byPaige Elizabeth Gresty
- Book PchUploaded byjbusowicz
- 471Chapter_3(1)Uploaded byAhmed Mahmoud Ahmed