HCM UNIVERSITY TECHNOLOGY AND EDUCATION
FACULTY FOR HIGH QUALITY TRAINING
Optimal Engineering
PORTFOLIO
Advisor: A.Prof. Trần Ngọc Đảm
Trần Tuấn Sang 20143185
Ho Chi Minh, June, 2023
LINEAR PROBLEM
1. MANUFACTURING PROBLEM :
1.1 Problem :
Maximize profits of a small Eatery .
Noodle Ham Beff Rice Stew Pate Stored
Rice Fish Rice
Rice
Ham 0 2 1 0 1 4 kg
Noodles 2 0 0 0 0 5 kg
Beff 1 1 2 0 1 6 kg
Pate 0 1 0.5 0 2 4 kg
Stew Fish 0 0 0 2 0 4 kg
Profit 15k 20k 25k 25k 15k
1.2 Modeling :
Variable :
X1 : number of ham made per day
X2 : number of noodles made per day
X3 : number of beff made per day
X4 : number of pate made per day
X5 : number of stew fish made per day
Objective :
Zmax = 4X1+5X2+6X3+4X4+4X5
Constraint :
Ham : 0X1 + 2X2 + 1X3 + 0X4 + 1X5 ≤ 4kg
Noodles : 2X1 + 0X2 + 0X3 + 0X4 + 0X5 ≤ 5kg
Beff : 1 X 1 + 1X2 + 2X3 + 0X4 + 1X5 ≤ 6kg
Pate : 0X1 + 1X2 + 0,5X3 + 0X4 + 2X5 ≤ 4kg
Stew Fish : 0X1 + 0X2 + 0X3 + 2X4 + 0X5 ≤ 4kg
Condition :
0 < [X1,X2,X3,X4,X5] <70
1.3 Solving
I using the web ( phpsimplex ) to solving this problem with the number of
constraints is 5 and the number of variable is 5
So the results
2. SHIPPING PROBLEM
2.1) Problem :
Mangosteen Orange Apple Water melon Lemon
Motorbike ( 100 kg) X11 X12 X13 X14 X15
Truck (1000 kg) X21 X22 X23 X24 X25
Train (2000 kg) X31 X32 X33 X34 X35
Boat (3000 kg) X41 X42 X43 X44 X45
Plane (4000 kg) X51 X52 X53 X54 X55
Price (VND) 20k 15k 25k 15k 10k
2.2)Modeling
Variable :
X1
X2
X = X3
X4
X5
Number of kilograms mangosteen canbring, X1
Number of kilograms orange can bring, X2
Number of kilograms apple can bring, X3
Number of kilograms watermelon can bring, X4
Number of kilograms lemon can bring, X5
Objective :
T
Zmax= C X
C1 20
C2 15
C = C3 = 25
C4 15
C5 10
20X1+15X2+25X3+15X4+10X5 = CTX
Condition :
10 ≤ 𝑥1 ≤ 150
20 ≤ 𝑥2 ≤ 300
30 ≤ 𝑥3 ≤ 700
40 ≤ 𝑥4 ≤ 1200
50 ≤ 𝑥5 ≤ 2000
2.3)Solving
I using the web ( phpsimplex ) to solving this problem with the number of
constraints is 25 and the number of variable is 5
Result
Number of kilograms mangosteen can bring on motorbike
Z13 = 100 kg
Number of kilograms orange can bring on truck
Z23 = 1000 kg
Number of kilograms apple can bring on train
Z 3 3 = 2000 kg
Number of kilograms watermelon can bring on boat
Z43 = 3000 kg
Number of kilograms lemon can bring on plane
Z53 = 4000 kg
3) Ticket problem
3.1) Problem
Maximum the Money of selling tickets from Hồ Chí Minh to Hà Nội
Bến đi / Địa HCM Nha Trang Quảng Đà Nẵng Huế Vinh Hà Nội
điểm đến Ngãi
HCM (450) 𝑥11 𝑥12 𝑥13 𝑥14 𝑥15 𝑥16 𝑥17
Vũng Tàu 𝑥21 𝑥22 𝑥23 𝑥24 𝑥25 𝑥26 𝑥27
(250)
Nha Trang 𝑥31 𝑥32 𝑥33 𝑥34 𝑥35 𝑥36 𝑥37
(300)
Quy Nhơn 𝑥41 𝑥42 𝑥43 𝑥44 𝑥45 𝑥46 𝑥47
(300)
Quảng Ngãi 𝑥51 𝑥52 𝑥53 𝑥54 𝑥55 𝑥56 𝑥57
(400)
Huế (350) 𝑥61 𝑥62 𝑥63 𝑥64 𝑥65 𝑥66 𝑥67
Hà Nội (400) 𝑥71 𝑥72 𝑥73 𝑥74 𝑥75 𝑥76 𝑥77
Price 200k 400k 450k 500k 550k 650k 900k
3.2) Modeling
Variable
Xij : Number of passenger traveling from i to j
Objective :
T
Zmax= C X
C1
C2 2
0
C3 0
c=¿ C4 4
C5 0
C6 0
C7 4
5
0
5
0
0
5
5 50
0 90
6 0
200𝑥1+400𝑥2+450𝑥3+500𝑥4+550𝑥5 + 650𝑥6 + 900𝑥7 =C TX
Constraint :
A𝑥 ≤ 𝑏
[ ]
1111111000000000000000000000000000000000000000000
0000000011111100000000000000000000000000000000000
0000000000000000111110000000000000000000000000000
0000000000000000000000001111000000000000000000000
0000000000000000000000000000000011100000000000000
0000000000000000000000000000000000000000110000000
0000000000000000000000000000000000000000000000001
Condition
0 ≤ x ≤ 70
3.3)Solving
I using the web ( phpsimplex ) to solving this problem with the number of constraints is 7
and the number of variable is 49
Result
4. SHIPPING PROBLEM 2
4.1 Problem :
Minimize the cost of transporting fruits to market
Chợ Lớn (25) Bến Thành Chợ Thủ Đức (20)
(30)
Vũng Tàu (50) 10 (x11) 11 (x12) 8 (x13)
Bà Rịa (30) 9 (x21) 10 (x22) 6 (x23)
Đồng Nai (55) 8 (x31) 9 (x32) 7 (x33)
4.2 Modeling
Variable :
𝑥ij is the number of fruits shiped from i factory to j market .
Objective :
Zmin= 10. 𝑥11 + 11. 𝑥12 + 8. 𝑥13 + 9. 𝑥21 + 10. 𝑥22 + 6. 𝑥23 + 8. 𝑥31 + 9. 𝑥32 + 7. 𝑥33
Constraint :
Suppliers :
𝑥11 + 𝑥12 + 𝑥13 ≤ 50
𝑥21 + 𝑥22 + 𝑥23 ≤ 30
𝑥31 + 𝑥32 + 𝑥33 ≤ 55
Market :
𝑥11 + 𝑥21 + 𝑥31 = 25
𝑥12 + 𝑥22 + 𝑥32 = 30
Condition 𝑥13 + 𝑥23 + 𝑥13 = 20
:
𝑥𝑖𝑗 ≥ 0
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
Result
𝑥min= 415
From Bà Rịa to Chợ Thủ Đức 𝑥23=30
From Đồng Nai to Chợ Lớn 𝑥31 = 20
From Đồng Nai to Bến Thành 𝑥32= 25
HCM UNIVERSITY TECHNOLOGY AND EDUCATION
FACULTY FOR HIGH QUALITY TRAINING
Optimal Engineering
FINAL REPORT
Minimize the number of bars and columns used in the structure
Advisor: Prof. Trần Ngọc Đảm
Subject ID: OPTE322925E_23_1_02CLC
Member of group
Trần Tuấn Sang 20143185
Nguyễn Thanh Phương 20143183
Ho Chi Minh, June, 2023
Table Of Contents
I. DEFINE A REAL PROBLEM
II. ANNOUNCEMENT
III. MODELLING PROBLEM
IV. SOLVING THE PROBLEM
V. EVALUATION
MARK
CRITERIA CONTENT PRESENT TOTAL
MARK
COMMENTS OF ADVISOR
.............................................................................................................................
.............................................................................................................................
.............................................................................................................................
.............................................................................................................................
.............................................................................................................................
.............................................................................................................................
.............................................................................................................................
.............................................................................................................................
Advisor
(sign)
Trần Ngọc Đảm
Notifications of project
Optimal Engineering
SEMESTER II - SCHOOL YEAR 2022-2023
2. Advisor: Prof. Dr. Trần Ngọc Đảm
3. Name of project: Minimize the number of bars and columns used in the structure
List of mission - Completed 100% project
No Full Name Student Contribution Mission
ID
Level
1 Trần Tuấn Sang 20143185 100% -Final Report
-Portfolio
-Divided mission
of group
-Matlab Caculation
2 Nguyễn Thanh Phương 20143183 100% -Portfolio
-Built Format
-Create the data
-Checking the data
failed, unstable
I. Defined A Real Problem
Real problem description:
The floor structure is widely used in the construction industry, and the problem is to
minimize the number of bars and columns used in the structure.
Given:
• Live load value (human, devices, concrete, and vibration) is 1,105 (ton/m2)
• Concrete floor thickness is 0,2 (m)
• Overload coefficient of concrete floor 1,2
• The weight of a support plate is 0,038 (ton)
• Overload coefficient of support plate is 1,2
• The area of a support plate is 2,8 (m2)
• 1m long load of floor purlin is 0,05 (ton/m)
• Overload coefficient of floor purlin is 1,3
• 1m long load of column purlin is 0,03 (ton/m)
• Overload coefficient of column purlin is 1,3
• Total length of floor is 40 (m)
• Total width of floor is 25 (m)
• Choose I-shaped steel number I240 for floor support purlin and I-shaped steel
number I360 for column purlin
Solution
•[ σ ] ( floor support purlin with steel ) = 21000 (ton/m2)
•Allowable coefficient of allowable stress of floor support purlin is 1,3
• [ σ ] ( column purlin with steel ) = 21000 (ton/m°)
• Allowable coefficient of allowable stress column purlinis 1,3
• Live load value (human, devices, concrete, and vibration) is 1,105 (ton/m2)
• [ σ ] ( the material making the floor coffa )= 1,3 (ton/m2)
• Allowable coefficient of allowable stress of floor coffa is 1,3
• The torque multiplier from concentrated load to uniformly distributed load is
1,34
floor purlin
1 2
Bending moment of floor support purlin: M 1=
10
×q 1 × X 3
M1≤[ σ ]W1
0,038 95
q 1=0 , 05 ×1 , 3+ × X 1+1 , 2× 2 ,5 ×0 ,2 ×0 , 4+1,105 ×0 , 4=0,747+ X1
2,9768 7442
WI=1,33x10-5(m3)
column purlin
1 2
Bending moment of column purlin: M2=1 ,34 × 10 × q2 × X 2
M2≤[ σ ]W2
So that :
0,7521× X 3
q 2= + 0 ,39
X2
W2=1,7x10-5(m3)
II. ANNOUNCEMENT
1. Introduction
These days, reinforced coffa floor is widely use in most of the construction
works: houses, buildings, companies....So, the demand for reinforced coffa floor
design is very high.
With the develop of technology, beside the required of the load capacity, the
engincer also need to minimize the number of support bar, it means save the
material and reduce the cost.
2. Method
The method we used is the Nonlinear Mathematical Optimization with
function fmincon on Matlab application.
3. Result
The coffa floor has dimension is
X1=3,96m
X2=1,5m
X3=1,5m
The numbcr of bars is 117
4. Conclusion
The result of our method satisfied with the initial requirements set out. In
terms of length dimension as well as optimized load capacity and the total
mass accepted the requirements. That the reason why saves the costs and
materials.
III. MODELING PROBLEM
Variable
X1 is distance between 2 vertical bars (m)
X2 is distance between 2 poles in length (m)
X3 is distance between 2 poles in width (m)
Objective
f ( x )= ( X401 +1)+( X402 + X253 +1)+( X402 × X253 )+( X253 + 1) → minimum
Constraints
Loading constraint:
1
10 (
× 0,747+
95
7442 )
X 1 × X 2 3 ≤1 , 33 ×10−5 ×
21000
1,3
1 ,34 ×
1
10
× (
0,7521× X 3
X2 )
+ 0 ,39 × X 2 2 ≤1 , 7 ×10−5 ×
21000
1,3
Design constraint
X1 > 0
X2 > 0
X3 > 0
Boundary Condition
0 , 5(m)≤ X1≤ 4 (m)
1 ,5 (m)≤ X2≤ 3(m)
1 ,5 (m)≤ X3≤ 3(m)
N
The stress allowance [δ]= F ≤100 MPA
IV. Solving the problem
Solving on matlab
Myfun.m
function f = myfun(x)
f = (40/x(1))+1+(40/x(2))+(25/x(3))+1+((40/x(2))+25/x(3))
+25/x(3)+1;
Nlcon.m
function [c,Ceq] =nlcon(x)
x1=x(1); x2=x(2); x3=x(3);
c(1)=0.1*(0.747+(95/7442)*x1)*x3^2-1.33*10^-5*21000/3;
c(2)=1.34*0.1*(0.39+(0.7521*x3/x2))*x2^2-1.7*10^-5*21000/3;
Ceq=[];
Main.m
A = [];
b = [];
Aeq = [];
beq = [];
lb = [0 1.5 1.5 ];
ub = [4 3 3];
x0 = [1 1.6 1.6];
[x,feval]=fmincon(@myfun,x0,A,b,Aeq,beq,lb,ub,@nlcon);
The result of optimization
X1=3,96m
X2=1,5m
X3=1,5m
Feval = 117
V. Evaluation
The result given
X1=3,96m
X2=1,5m
X3=1,5m
Check the load capacity
1
10 (
× 0,747+
95
7442 )
X 1 × X 2 3 ≤1 , 33 ×10−5 ×
21000
1,3
1 ,11≤ 1 , 33( satisfied)
1 ,34 ×
1
10
× (
0,7521× X 3
X2 )
+ 0 ,39 × X 2 2 ≤1 , 7 ×10−5 ×
21000
1,3
1 , 42 ≤1 , 7(satisfied)
Conclusion
The results satisfied the initial requirements set out. In terms of load capacity as
well as optimized in mass. That saves costs and materials. For the assist as
Matlab Software about the fmincon, we can modify the math function and adjust
to suitable with the optimize valued in save the resources process
