Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
25 views

Tutorial Sheet-8 (2) MEC-318 (Numerical Method in Engineering)

The document contains 5 optimization problems involving maximizing or minimizing objective functions subject to various constraints. Problem 1 involves maximizing a function of 3 variables subject to 3 constraints. Problem 2 maximizes a function of 4 variables subject to 4 constraints. Problem 3 minimizes a function of 3 variables subject to 3 constraints. Problem 4 maximizes a function of 3 variables subject to 2 constraints. Problem 5 involves maximizing profit of 2 products processed on 2 machines with time constraints, to be solved using the simplex method.

Uploaded by

sharmashn
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
25 views

Tutorial Sheet-8 (2) MEC-318 (Numerical Method in Engineering)

The document contains 5 optimization problems involving maximizing or minimizing objective functions subject to various constraints. Problem 1 involves maximizing a function of 3 variables subject to 3 constraints. Problem 2 maximizes a function of 4 variables subject to 4 constraints. Problem 3 minimizes a function of 3 variables subject to 3 constraints. Problem 4 maximizes a function of 3 variables subject to 2 constraints. Problem 5 involves maximizing profit of 2 products processed on 2 machines with time constraints, to be solved using the simplex method.

Uploaded by

sharmashn
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Tutorial sheet-8 (2)

MEC-318 (Numerical MethodinEngineering)



1) Maximize =
1
+
2
+ 3
3
subjected to [x
1
=0, x
2
=0, x
3
=1, Z=3]
3
1
+2
2
+
3
3
2
1
+
2
+2
3
2

1
,
2
,
3
0
2) Maximize = 4
1
+3
2
+4
3
+6
4
subjected to [x
1
=280/13, x
2
=0, x
3
=20/13,
x
4
=180/13, Z=2280/13]

1
+2
2
+2
3
+4
4
80
2
1
+2
3
+
4
60
3
1
+3
2
+
3
+
4
80

1
,
2
,
3
,
4
0
3) Minimize =
1
3
2
+2
3
subjected to [x
1
=4, x
2
=5, x
3
=0, Z=-11]
3
1

2
+2
3
7

1
+3
2
+8
3
10
2
1
+4
2
12

1
,
2
,
3
0
4) Maximize = 10
1
+
2
+2
3
subjected to [x
1
=5, x
2
=0, x
3
=0, Z=50]

1
+
2
2
3
10
4
1
+
2
+
3
20

1
,
2
,
3
0
5) A firm produces products A and B and sells them at a profit of Rs. 2 and Rs. 3 each respectively. Each
product is processed on machines G and H. Product A requires 1 minute on G and 2 minutes on H
whereas product B requires 1 minute on each of the machines. Machine G is not available for more than
6 hrs.40 min/ day whereas the time constraint for machine H is 10 hrs. Solve the problem via simplex
method for maximizing the profit. [0, 400, 1200]

You might also like