Tải bản đầy đủ (.pdf) (15 trang)

portfolio course optimal engineering

Bạn đang xem bản rút gọn của tài liệu. Xem và tải ngay bản đầy đủ của tài liệu tại đây (614.81 KB, 15 trang )

<span class="text_page_counter">Trang 1</span><div class="page_container" data-page="1">

HCMC UNIVERSITY OF TECHNOLOGY AND EDUCATION FACULITY FOR HIGH QUALITY TRAINING MECHANICAL ENGINEERING TECHNOLOGY

<small>LECTURE NAME : A/Prof.Dr. TRAN NGOC DAM STUDENT NAME : DUONG THANH NHAN </small>

</div><span class="text_page_counter">Trang 2</span><div class="page_container" data-page="2">

LINEAR PROBLEM :

1 ) MANUFACTURING PROBLEM : 1.1 Problem :

Maximize profits of a Coffee shop with limited materials in store . Milk tea Coffee White coffee Black tea Stored

x1 : number of cups of milk tea made per day x2 : number of cups of coffee made per day x3 : number of cups of white coffee made per day x4 : number of cups of black tea made per day

</div><span class="text_page_counter">Trang 3</span><div class="page_container" data-page="3">

1.3 Solving

I using the web ( linprog.com ) to solving this problem With the number of constraints is 5

And the number of variable is 5

1.4 Result :

And the answer show that :

To get the highest profit, we need to sell 90 cups of milk tea ( x1 = 90 ) 0 cups of coffee ( x2 = 0 ) 0 cups of white coffee ( x3 = 0 ) 40 cups of black tea ( x4 = 40 ) And Z max = 1910 (million dongs )

</div><span class="text_page_counter">Trang 4</span><div class="page_container" data-page="4">

Number of kilograms banana can bring , �<sub>1 </sub> Number of kilograms orange can bring , �<sub>2</sub> Number of kilograms apple can bring , �<sub>3 </sub> Number of kilograms coconut can bring , �<small>4 </small>Number of kilograms lemon can bring ,

</div><span class="text_page_counter">Trang 6</span><div class="page_container" data-page="6">

2.3 Solving

I using the web (phpsimplex) to solving this problem With the number of constraints is 5

And the number of variable is 25

</div><span class="text_page_counter">Trang 7</span><div class="page_container" data-page="7">

Maximum the value of products brought from the countryside to the city.With limited number of bags and weight

Bags/Products Vegetable Fruit Jelly Meat Cake Candy

</div><span class="text_page_counter">Trang 8</span><div class="page_container" data-page="8">

I using the web (phpsimplex) to solving this problem With the number of constraints is 4

And the number of variable is 24

000000111111000000000000] � = [20 000000000000111111000000 25

</div><span class="text_page_counter">Trang 9</span><div class="page_container" data-page="9">

3.4 Result : �<sub>���</sub>= 4200

Number of kilograms meat bring in the left bag : �<sub>14 </sub>= 15 Number of kilograms meat bring in the right bag : �<sub>14 </sub>= 20 Number of kilograms meat bring in the back bag : �<small>14 </small>= 25 Number of kilograms meat bring in the front bag : �<small>14 </small>= 10

</div><span class="text_page_counter">Trang 10</span><div class="page_container" data-page="10">

4. SHIPPING PROBLEM 4.1 Problem :

Minimize the cost of transporting fruits to market

Ho Thi Ky (30) Ba Chieu (25) Hoang Hoa Tham (10)

</div><span class="text_page_counter">Trang 11</span><div class="page_container" data-page="11">

4.3 Solving

I using the web (phpsimplex) to solving this problem With the number of constraints is 6

And the number of variable is 9

4.4 Result : �<sub>���</sub>= 385

From Binh Duong to Ho Thi Ky <small>�11 = 5</small>

From Binh Duon g to Ba CHieu <small>�12 = 25 </small>

From Binh Duon g to Hoan g Hoa Tham <small>�</small><sub>13 </sub><small>= 10 </small>

From Don g Na i to Ho Thi Ky <small>�21 = 10</small>

From Binh Chanh to Ho T hi Ky <small>�31 = 15</small>

</div><span class="text_page_counter">Trang 14</span><div class="page_container" data-page="14">

5.3 Solving problem

I using the web (phpsimplex) to solving this problem With the number of constraints is 7

And the number of variable is 49

</div>

×