Microsoft Excel 14.0 Answer Report Worksheet: [12 November.

xlsx]Animal Feed Company Report Created: 12-11-2013 19:39:29 Result: Solver found a solution. All Constraints and optimality conditions are satisfied. Solver Engine Solver Options

Objective Cell (Min) Cell Name $B$15 Minimum Cost (Rs) Total

Original Value 840

Final Value 840

Variable Cells Cell Name $C$11 X1 Usage $C$12 X2 Usage

Original Value 80 120

Final Value Integer 80 Contin 120 Contin

Constraints Cell Name $C$13 Total Usage $C$12 X2 Usage $C$11 X1 Usage

Cell Value Formula Status 200 $C$13=$B$8 Binding 120 $C$12>=$B$12 Not Binding 80 $C$11<=$B$11 Binding

Slack 0 60 0

Experiment 1

29 July, 2013

An animal Feed company must produce exactly 200Kg of a mixture consisting of ingridients X1 and X2. The ingridients X1 costs Rs 3/Kg and X2 costs Rs 5/Kg. Not more than 80Kg of X1 can be used and atleast 60Kg of X2 must be used. Find the minimum cost of mixture.

Target (Kg) Resources X1 X2

200 Limit 80 60 Total Usage 80 120 200 Rate 3 5 Cost 240 600

Minimum Cost (Rs)

840

Microsoft Excel 12.0 Answer Report Worksheet: [Book1]Animal Feed Company Report Created: 7/29/2013 12:11:39 PM

Objective Cell (Min) Cell Name Original Value $B$15 Minimum Cost (Rs) Total 840 Final Value 840

Variable Cells Cell $C$11 $C$12 Name X1 Usage X2 Usage Original Value 80 120 Final Value Integer 80 Contin 120 Contin

Constraints Cell $C$13 $C$12 $C$11 Name Total Usage X2 Usage X1 Usage Cell Value Formula Status 200 $C$13=$B$8 Binding 120 $C$12>=$B$12Not Binding 80 $C$11<=$B$11Binding Slack 0 60 0

Nikhil Sorout: A50105410093

Experiment 1

29 July, 2013

Nikhil Sorout: A50105410093

Microsoft Excel 12.0 Answer Report Worksheet: [Book1]Sheet1 Report Created: 7/29/2013 11:44:23 AM

Target Cell (Max) Cell Name $H$33 Profit

Original Value 0

Final Value 1360

Adjustable Cells Cell Name $B$28 Number of Bowls $C$28 Number of Mugs

Original Value 0 0

Final Value 24 8

Constraints Cell Name $G$22 Labour Usage $G$23 Clay Usage

Cell Value

Formula Status 40 $G$22<=$F$22 Binding 120 $G$23<=$F$23 Binding

Slack 0 0

Experiment 2

29 July, 2013

A company makes bowls and mugs from clay. The profit earned in making cups and bowls is Rs40 & Rs50 repectively. Making a cup requires 1 labour and 4 pounds of clay while making a mug requires 2 albours and 3 pounds of clay. 40 Labour and 120 pounds of clay are available per day. Formulate an LPP to maximize the profit.

Data Table Product Profit Resource List Resources Labour Clay

Bowl 40

Mug 50

Bowl 1 4

Mug 2 3

Available 40 120

Used 40 120

Optimized Production Plan Number of Bowls Number of Mugs 24 8 Profit: 1360

Microsoft Excel 12.0 Answer Report Worksheet: [Book1]Sheet1 Report Created: 7/29/2013 11:44:23 AM

Target Cell (Max) Cell $H$33 Profit Name Original Value 0 Final Value 1360

Adjustable Cells Cell $B$28 $C$28 Name Number of Bowls Number of Mugs Original Value 0 0 Final Value 24 8

Constraints Cell $G$22 $G$23 Name Labour Usage Clay Usage Cell Value Formula Status 40 $G$22<=$F$22 Binding 120 $G$23<=$F$23 Binding Slack 0 0

Nikhil Sorout: A50105410093

Microsoft Excel 14.0 Answer Report Worksheet: [12 November.xlsx]August 5 (I) Report Created: 12-11-2013 20:22:34 Result: Solver found a solution. All Constraints and optimality conditions are satisfied. Solver Engine Solver Options

Objective Cell (Min) Cell Name $B$25 Total Cost (Rs.) Contractor 1

Original Value Final Value 0 4900

Variable Cells Cell $B$19:$E$22

Name

Original Value

Final Value Integer

Constraints Cell $F$19:$F$22 = 1 $B$23:$E$23 = 1

Name

Cell Value

Formula

Status

Slack

Experiment 3

5 August, 2013

A machine tool company decides to make 4 sub-assemblies through 4 sub-contractors. Each contractor is to receive only 1 sub-assembly. The cost of each sub-assembly is determined by the bids submitted by each contractor and is shown in the table in 100s' of Rs. Assign the assemblies to minimise the cost.

Bid Matrix . Assembly 1 Assembly 2 Assembly 3 Assembly 4

Contractor 1 Contractor 2 Contractor 3 Contractor 4 15 13 14 17 11 12 15 13 13 12 10 11 15 17 14 16

Assignment Matrix . Assembly 1 Assembly 2 Assembly 3 Assembly 4 Column Sum Total Cost (Rs.)

Contractor 1 Contractor 2 Contractor 3 Contractor 4 Row Sum 0 1 0 0 1 1 0 0 0 1 0 0 0 1 1 0 0 1 0 1 1 1 1 1 4900

Constraints

$B$23:$

Nikhil Sorout: A50105410093

Experiment 3 Microsoft Excel 14.0 Answer Report Worksheet: [12 November.xlsx]August 5 (I) Report Created: 12-11-2013 20:22:34 Result: Solver found a solution. All Constraints and optimality conditions are satisfied. Solver Engine Engine: Simplex LP Solution Time: 0.016 Seconds. Iterations: 7 Subproblems: 0 Solver Options Max Time 100 sec, Iterations 100, Precision 0.000001 Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 5%, Solve Without Integer Constraints, Assume NonNegative Objective Cell (Min) Cell $B$25

5 August, 2013

Name Original ValueFinal Value Total Cost (Rs.) Contractor 1 0 4900

Variable Cells Cell Name $B$19:$E$22 $B$19 Assembly 1 Contractor 1 $C$19 Assembly 1 Contractor 2 $D$19 Assembly 1 Contractor 3 $E$19 Assembly 1 Contractor 4 $B$20 Assembly 2 Contractor 1 $C$20 Assembly 2 Contractor 2 $D$20 Assembly 2 Contractor 3 $E$20 Assembly 2 Contractor 4 $B$21 Assembly 3 Contractor 1 $C$21 Assembly 3 Contractor 2 $D$21 Assembly 3 Contractor 3 $E$21 Assembly 3 Contractor 4 $B$22 Assembly 4 Contractor 1 $C$22 Assembly 4 Contractor 2 $D$22 Assembly 4 Contractor 3 $E$22 Assembly 4 Contractor 4 Original ValueFinal Value Integer 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 1 0 Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin

Constraints Cell Name $F$19:$F$22 = 1 $F$19 Assembly 1 Row Sum $F$20 Assembly 2 Row Sum $F$21 Assembly 3 Row Sum $F$22 Assembly 4 Row Sum $B$23:$E$23 = 1 Cell Value 1 1 1 1 Formula $F$19=1 $F$20=1 $F$21=1 $F$22=1 Status Binding Binding Binding Binding Slack 0 0 0 0

Nikhil Sorout: A50105410093

Microsoft Excel 15.0 Answer Report Worksheet: [12 November.xlsx]Machine Assignment Problem Report Created: 11/14/2013 5:31:02 PM Result: Solver found a solution. All Constraints and optimality conditions are satisfied. Solver Engine Engine: Simplex LP Solution Time: 0.047 Seconds. Iterations: 17 Subproblems: 0 Solver Options Max Time 100 sec, Iterations 100, Precision 0.000001 Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 5%, Solve Without Integer Constraints, Assum

Objective Cell (Max) Cell Name $C$27 Total Profit Job 2

Original Value Final Value 50 50

Variable Cells Cell Name $B$19 Machine 1 Job 1 $C$19 Machine 1 Job 2 $D$19 Machine 1 Job 3 $E$19 Machine 1 Job 4 $F$19 Machine 1 Job 5 $B$20 Machine 2 Job 1 $C$20 Machine 2 Job 2 $D$20 Machine 2 Job 3 $E$20 Machine 2 Job 4 $F$20 Machine 2 Job 5 $B$21 Machine 3 Job 1 $C$21 Machine 3 Job 2 $D$21 Machine 3 Job 3 $E$21 Machine 3 Job 4 $F$21 Machine 3 Job 5 $B$22 Machine 4 Job 1 $C$22 Machine 4 Job 2 $D$22 Machine 4 Job 3 $E$22 Machine 4 Job 4 $F$22 Machine 4 Job 5 $B$23 Machine 5 Job 1 $C$23 Machine 5 Job 2 $D$23 Machine 5 Job 3 $E$23 Machine 5 Job 4 $F$23 Machine 5 Job 5

Original Value Final Value 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0

Integer Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin

Constraints Cell Name $G$19 Machine 1 Row Sum $G$20 Machine 2 Row Sum $G$21 Machine 3 Row Sum $G$22 Machine 4 Row Sum $G$23 Machine 5 Row Sum $B$24 Column Sum Job 1 $C$24 Column Sum Job 2 $D$24 Column Sum Job 3 $E$24 Column Sum Job 4 $F$24 Column Sum Job 5

Cell Value 1 1 1 1 1 1 1 1 1 1

Formula $G$19=1 $G$20=1 $G$21=1 $G$22=1 $G$23=1 $B$24=1 $C$24=1 $D$24=1 $E$24=1 $F$24=1

Status Binding Binding Binding Binding Binding Binding Binding Binding Binding Binding

Slack 0 0 0 0 0 0 0 0 0 0

hout Integer Constraints, Assume NonNegative

Experiment 4 A company has 5 jobs to be done. The following matrix shows the return in rupees of assigning Ith machine to Jth job. Assign the 5 Jobs to 5 machines so as to maximize the total expected profit.

Profit Matrix . Machine 1 Machine 2 Machine 3 Machine 4 Machine 5

Job 1 5 2 3 6 7

Job 2 11 4 12 14 9

Job 3 10 6 5 4 8

Job 4 12 3 14 11 12

Job 5 4 5 6 7 5

Assignment Matrix . Machine 1 Machine 2 Machine 3 Machine 4 Machine 5 Column Sum Job 1 0 0 0 0 1 1 Job 2 0 0 0 1 0 1 Job 3 1 0 0 0 0 1 Job 4 0 0 1 0 0 1 Job 5 0 1 0 0 0 1 Row Sum 1 1 1 1 1

Total Profit

50

Microsoft Excel 15.0 Answer Report Worksheet: [12 November.xlsx]Machine Assignment Problem Report Created: 11/14/2013 5:31:02 PM Result: Solver found a solution. All Constraints and optimality conditions are satisfied. Solver Engine Engine: Simplex LP Solution Time: 0.047 Seconds. Iterations: 17 Subproblems: 0 Solver Options Max Time 100 sec, Iterations 100, Precision 0.000001 Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 5%, Solve Without Integer Constraints, Assume NonNegative Objective Cell (Max) Cell $C$27 Name Original Value Final Value Total Profit Job 2 50 50

Nikhil Sorout: A50105410093

Experiment 4 Variable Cells Cell $B$19 $C$19 $D$19 $E$19 $F$19 $B$20 $C$20 $D$20 $E$20 $F$20 $B$21 $C$21 $D$21 $E$21 $F$21 $B$22 $C$22 $D$22 $E$22 $F$22 $B$23 $C$23 $D$23 $E$23 $F$23 Name Original Value Final Value Machine 1 Job 1 0 0 Machine 1 Job 2 0 0 Machine 1 Job 3 1 1 Machine 1 Job 4 0 0 Machine 1 Job 5 0 0 Machine 2 Job 1 0 0 Machine 2 Job 2 0 0 Machine 2 Job 3 0 0 Machine 2 Job 4 0 0 Machine 2 Job 5 1 1 Machine 3 Job 1 0 0 Machine 3 Job 2 0 0 Machine 3 Job 3 0 0 Machine 3 Job 4 1 1 Machine 3 Job 5 0 0 Machine 4 Job 1 0 0 Machine 4 Job 2 1 1 Machine 4 Job 3 0 0 Machine 4 Job 4 0 0 Machine 4 Job 5 0 0 Machine 5 Job 1 1 1 Machine 5 Job 2 0 0 Machine 5 Job 3 0 0 Machine 5 Job 4 0 0 Machine 5 Job 5 0 0 Integer Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin Contin

Constraints Cell $G$19 $G$20 $G$21 $G$22 $G$23 $B$24 $C$24 $D$24 $E$24 $F$24 Name Cell Value Machine 1 Row Sum 1 Machine 2 Row Sum 1 Machine 3 Row Sum 1 Machine 4 Row Sum 1 Machine 5 Row Sum 1 Column Sum Job 1 1 Column Sum Job 2 1 Column Sum Job 3 1 Column Sum Job 4 1 Column Sum Job 5 1 Formula $G$19=1 $G$20=1 $G$21=1 $G$22=1 $G$23=1 $B$24=1 $C$24=1 $D$24=1 $E$24=1 $F$24=1 Status Binding Binding Binding Binding Binding Binding Binding Binding Binding Binding Slack 0 0 0 0 0 0 0 0 0 0

Nikhil Sorout: A50105410093

Experiment 4 machine

Nikhil Sorout: A50105410093

Microsoft Excel 15.0 Answer Report Worksheet: [12 November.xlsx]Cooler Report Created: 11/14/2013 7:39:15 PM Result: Solver found a solution. All Constraints and optimality conditions are satisfied. Solver Engine Engine: Simplex LP Solution Time: 0.015 Seconds. Iterations: 5 Subproblems: 0 Solver Options Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max) Cell Name $B$28 Net Profit Ranchi

Original Value 0

Final Value 31600

Variable Cells Cell Name $B$24 Mumbai Ranchi $C$24 Mumbai Delhi $D$24 Mumbai Lucknow $E$24 Mumbai Kanpur $B$25 Kolkata Ranchi $C$25 Kolkata Delhi $D$25 Kolkata Lucknow $E$25 Kolkata Kanpur

Original Value 0 0 0 0 0 0 0 0

Final Value 75 95 0 30 0 0 100 0

Integer Contin Contin Contin Contin Contin Contin Contin Contin

Constraints Cell Name $B$26 Demand Met Ranchi $C$26 Demand Met Delhi $D$26 Demand Met Lucknow $E$26 Demand Met Kanpur $F$24 Mumbai Optimized Production Rate $F$25 Kolkata Optimized Production Rate

Cell Value 75 95 100 30 200 100

Formula $B$26<=$B$15 $C$26<=$C$15 $D$26<=$D$15 $E$26<=$E$15 $F$24<=$B$19 $F$25<=$B$20

Status Binding Not Binding Binding Binding Binding Binding

Slack 0 5 0 0 0 0

Experiment 6 A company manufacturing air collers has 2 plants located at Mumbai and Kolkata with a capacity of 200 & 100 units per week. The company has to supply the coolers to its' 4 showrooms located at Ranchi, Delhi, Lucknow and Kanpur which have a maximum demand of 75; 100; 100 & 30 units respectively. Due to variations in material and transportation cost the profit per unit differs and is given in the table. Plan the production in order to maximize the profit. The plants can be run undercapacity.

Profit Matrix . Ranchi Delhi Mumbai 90 Kolkata 50

Lucknow Kanpur 90 100 110 70 130 85

Demand Matrix . Ranchi Delhi Lucknow Kanpur Demand 75 100 100 30 Capacity Chart Plant Capacity Mumbai 200 Kolkata 100 Production Allotment . Ranchi Delhi Mumbai 75 Kolkata 0 Demand Met 75 Net Profit 31600

Lucknow 95 0 95 0 100 100

Kanpur 30 0 30

Optimized Production Rate 200 100

Nikhil Sorout: A50105410093

Experiment 6

200 & 100 Microsoft Excel 15.0 Answer Report Worksheet: [12 November.xlsx]Cooler Report Created: 11/14/2013 7:39:15 PM Result: Solver found a solution. All Constraints and optimality conditions are satisfied. Solver Engine Engine: Simplex LP Solution Time: 0.015 Seconds. Iterations: 5 Subproblems: 0 Solver Options Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative Objective Cell (Max) Cell $B$28

Name Net Profit Ranchi

Original Value Final Value 0 31600

Variable Cells Cell $B$24 $C$24 $D$24 $E$24 $B$25 $C$25 $D$25 $E$25 Name Mumbai Ranchi Mumbai Delhi Mumbai Lucknow Mumbai Kanpur Kolkata Ranchi Kolkata Delhi Kolkata Lucknow Kolkata Kanpur Original Value Final Value Integer 0 75 Contin 0 95 Contin 0 0 Contin 0 30 Contin 0 0 Contin 0 0 Contin 0 100 Contin 0 0 Contin

Constraints Cell $B$26 $C$26 $D$26 $E$26 $F$24 $F$25 Name Demand Met Ranchi Demand Met Delhi Demand Met Lucknow Demand Met Kanpur Mumbai Optimized Production Rate Kolkata Optimized Production Rate Cell Value 75 95 100 30 200 100 Formula Status $B$26<=$B$15 Binding $C$26<=$C$15 Not Binding $D$26<=$D$15 Binding $E$26<=$E$15 Binding $F$24<=$B$19 Binding $F$25<=$B$20 Binding Slack 0 5 0 0 0 0

Nikhil Sorout: A50105410093

Microsoft Excel 12.0 Answer Report Worksheet: [12 November.xlsx]Car Rental Report Created: 11/13/2013 3:50:57 PM

Target Cell (Min) Cell Name $B$27 Total Cost 1

Original Value Final Value 185 185

Adjustable Cells Cell Name $B$19 $C$19 $D$19 $E$19 $F$19 $G$19 $B$20 $C$20 $D$20 $E$20 $F$20 $G$20 $B$21 $C$21 $D$21 $E$21 $F$21 $G$21 $B$22 $C$22 $D$22 $E$22 $F$22 $G$22 $B$23 $C$23 $D$23 $E$23 $F$23 $G$23 $B$24 $C$24 $D$24 $E$24

1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4

Original Value Final Value 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0

$F$24 $G$24

5 6

0 1

0 1

Constraints Cell Name $H$19 Row Sum $H$20 Row Sum $H$21 Row Sum $H$22 Row Sum $H$23 Row Sum $H$24 Row Sum $B$25 Column Sum 1 $C$25 Column Sum 2 $D$25 Column Sum 3 $E$25 Column Sum 4 $F$25 Column Sum 5 $G$25 Column Sum 6

Cell Value 1 1 1 1 1 1 1 1 1 1 1 1

Formula $H$19=1 $H$20=1 $H$21=1 $H$22=1 $H$23=1 $H$24=1 $B$25=1 $C$25=1 $D$25=1 $E$25=1 $F$25=1 $G$25=1

Status Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding

Slack 0 0 0 0 0 0 0 0 0 0 0 0

A national car rental service has surplus of cars in cities (1-6) and a deficiency of 1 car in cities (7-12). The distance between the two cities is given below. Assign the travel route so as to minimize the transportation cost.

Transportation cost chart Cities 1 7 41 8 22 9 27 10 45 11 29 12 32

2 72 29 39 50 40 40

3 39 49 60 48 39 40

4 52 65 51 52 26 60

5 25 81 32 37 30 51

6 51 50 32 43 33 30

Assignment Matrix Cities 1 7 8 9 10 11 12 Column Sum

2 0 0 1 0 0 0 1 0 1 0 0 0 0 1

3 0 0 0 1 0 0 1

4 0 0 0 0 1 0 1

5 1 0 0 0 0 0 1

6 0 0 0 0 0 1 1

Row Sum 1 1 1 1 1 1

Total Cost 185 Microsoft Excel 12.0 Answer Report Worksheet: [12 November.xlsx]Car Rental Report Created: 11/13/2013 3:50:57 PM

Target Cell (Min) Cell $B$27 Name Original Value Final Value Total Cost 1 185 185

Adjustable Cells Cell $B$19 $C$19 $D$19 $E$19 $F$19 $G$19 $B$20 Name Original Value Final Value 1 0 0 2 0 0 3 0 0 4 0 0 5 1 1 6 0 0 1 0 0

Nikhil Sorout: A50105410093

$C$20 $D$20 $E$20 $F$20 $G$20 $B$21 $C$21 $D$21 $E$21 $F$21 $G$21 $B$22 $C$22 $D$22 $E$22 $F$22 $G$22 $B$23 $C$23 $D$23 $E$23 $F$23 $G$23 $B$24 $C$24 $D$24 $E$24 $F$24 $G$24

2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6

1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1

1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1

Constraints Cell $H$19 $H$20 $H$21 $H$22 $H$23 $H$24 $B$25 $C$25 $D$25 $E$25 $F$25 $G$25 Name Cell Value Row Sum 1 Row Sum 1 Row Sum 1 Row Sum 1 Row Sum 1 Row Sum 1 Column Sum 1 1 Column Sum 2 1 Column Sum 3 1 Column Sum 4 1 Column Sum 5 1 Column Sum 6 1 Formula $H$19=1 $H$20=1 $H$21=1 $H$22=1 $H$23=1 $H$24=1 $B$25=1 $C$25=1 $D$25=1 $E$25=1 $F$25=1 $G$25=1 Status Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Not Binding Slack 0 0 0 0 0 0 0 0 0 0 0 0

Nikhil Sorout: A50105410093

Nikhil Sorout: A50105410093

Not a part of practical file

A firm produces 3 Products which are being processed on 3 different machines. The time required to manufacture 1 unit of each of the 3 products and the daily capacity of the 3 machines are given in the table. It is required to determine the daily no of units to be manufactured for each product. The profit per unit for products are Rs 4,3,6 respectively. It's assumed that all the amounts produced are consumed in the market. Formulate L.P.P to maximize the daily profit and solve it using in-built solver.

Time/Unit (minutes) Machine M1 M2 M3 Product 1 2 4 2 Product 2 3 0 5 Product 3 Machine Total minutes Capacity utilized 2 440 440 3 470 470 0 430 211.1111111

Profit/Unit (Rs)

Product Number Profit Total Profit

P1

P2 P3 0 42.2222222 156.666667 0 126.666667 940

1066.66667

Nikhil Sorout: A50105410093

Not a part of practical file

Nikhil Sorout: A50105410093