portfolio course optimal engineering

15 0 0
portfolio course optimal engineering

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

Thông tin tài liệu

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 Storedx1 : number of cu

Trang 1

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

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

Trang 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

Trang 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 )

Trang 4

Number of kilograms banana can bring , �1 Number of kilograms orange can bring , �2 Number of kilograms apple can bring , �3 Number of kilograms coconut can bring , �4 Number of kilograms lemon can bring ,

Trang 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

Trang 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

Trang 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

Trang 9

3.4 Result : ����= 4200

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

Trang 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)

Trang 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 : ����= 385

From Binh Duong to Ho Thi Ky �11 = 5

From Binh Duon g to Ba CHieu �12 = 25

From Binh Duon g to Hoan g Hoa Tham �13 = 10

From Don g Na i to Ho Thi Ky �21 = 10

From Binh Chanh to Ho T hi Ky �31 = 15

Trang 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

Ngày đăng: 20/04/2024, 10:04

Tài liệu cùng người dùng

Tài liệu liên quan