0% found this document useful (0 votes)
24 views

Exemplul 1-Minimizarea Functiei F, Cu Restrictiile Date: Abordare Matematica

This document discusses several examples of mathematical optimization problems involving minimizing or maximizing functions subject to constraints. The first example involves minimizing a function f given constraints on x and y. The second example maximizes the same function f. The third example involves linear programming to minimize a function of seven variables subject to various constraints. Further examples discuss reliability optimization of systems with the objective of maximizing reliability under cost, volume, and weight constraints. Solutions to these problems are presented.

Uploaded by

vasile madalina
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
24 views

Exemplul 1-Minimizarea Functiei F, Cu Restrictiile Date: Abordare Matematica

This document discusses several examples of mathematical optimization problems involving minimizing or maximizing functions subject to constraints. The first example involves minimizing a function f given constraints on x and y. The second example maximizes the same function f. The third example involves linear programming to minimize a function of seven variables subject to various constraints. Further examples discuss reliability optimization of systems with the objective of maximizing reliability under cost, volume, and weight constraints. Solutions to these problems are presented.

Uploaded by

vasile madalina
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Abordare matematica

Exemplul 1- minimizarea functiei f, cu restrictiile date


f x y , ( ) x y x + y
2
+ :=
x 0 :=
y 0 :=
solutiile initiale posibile
Given
functia matematica given-fie date restrictiile
1 x sin 11 x ( ) ( )
2
y
2

1 x cos 7 x ( ) ( )
2
y
2

Nec Minimize f x , y , ( ) :=
functia obiectiv
Nec
0.912
0.421
|

\
|
|

=
Solutiile
Minimul functiei
m f Nec
0
Nec
1
, ( ) :=
m 1.472 =
min 1 2 , 3 , ( ) 1 =
Exemplul 2- maximizarea functiei f
f x y , ( ) x y x + y
2
+ :=
x 0 :=
y 0 :=
Given
1 x sin 11 x ( ) ( )
2
y
2

1 x cos 7 x ( ) ( )
2
y
2

Nec Maximizef x , y , ( ) :=
Nec
0.864
0.997
|

\
|
|

=
M f Nec
0
Nec
1
, ( ) :=
M 2.721 =
Exemplul 3- programare liniara
minimizarea functiei
f x
1
x
2
, x
3
, x
4
, x
5
, x
6
, x
7
, ( ) 16 x
1
4 x
2
+ 20 x
3
+ 4 x
4
+ 18 x
5
+ 3 x
6
+ 15 x
7
+ :=
x
1
0 :=
x
2
0 :=
x
3
0 :=
x
4
0 :=
x
5
0 :=
x
6
0 :=
x
7
0 :=
Given
x
1
0
x
2
0
x
3
0
x
4
0
x
5
0
x
6
0
x
7
0
4x
1
2x
2
+ 3x
3
+ 4x
5
+ 3x
7
+ 100
3x
1
4x
3
+ x
4
+ 2x
5
+ 2x
7
+ 80
2x
1
3x
3
+ x
5
+ 3x
6
+ 4x
7
+ 120
X Minimize f x
1
, x
2
, x
3
, x
4
, x
5
, x
6
, x
7
, ( ) :=
X
22.857
0
2.857
0
0
21.905
0
|

\
|
|
|
|
|
|
|
|
|

=
m f X
0
X
1
, X
2
, X
3
, X
4
, X
5
, X
6
, ( ) :=
m 488.571 =
maximizarea functiei
f x
1
x
2
, x
3
, x
4
, x
5
, x
6
, x
7
, ( ) 16 x
1
4 x
2
+ 20 x
3
+ 4 x
4
+ 18 x
5
+ 3 x
6
+ 15 x
7
+ :=
x
1
0 :=
x
2
0 :=
x
3
0 :=
x
4
0 :=
x
5
0 :=
x
6
0 :=
x
7
0 :=
Given


x
1
20
x
2
30
x
3
30
x
4
40
x
5
50
x
6
60
x
7
70
4x
1
2x
2
+ 3x
3
+ 4x
5
+ 3x
7
+ 100
3x
1
4x
3
+ x
4
+ 2x
5
+ 2x
7
+ 80
2x
1
3x
3
+ x
5
+ 3x
6
+ 4x
7
+ 120
X Maximizef x
1
, x
2
, x
3
, x
4
, x
5
, x
6
, x
7
, ( ) :=
X
20
30
30
40
50
60
70
|

\
|
|
|
|
|
|
|
|
|

=
M f X
0
X
1
, X
2
, X
3
, X
4
, X
5
, X
6
, ( ) :=
M 3.33 10
3
=
Sistem neliniar- solutii
x 1 :=
y 2 :=
z 2 :=
Given
x log
y
x
|

\
|
|

1 +
y 0.4 z
2
+ 2 x
2

z 2 x
y
20
+
Minerr x y , z , ( )
1.21
1.961
2.119
|

\
|
|
|

=
x 1 :=
y 2 :=
z 2 :=
Given
x log
y
x
|

\
|
|

1 +
y 0.4 z
2
+ 2 x
2

z 2 x
y
20
+
Find x y , z , ( )
1.21
1.961
2.119
|

\
|
|
|

=
Optimizarea fiabilitii

Creterea fiabiltii sistemelor prin utilizarea redondanei este o msur sigur pentru
sigurana n funcionare. Problema obinerii optimului fiabilitii prin alegerea adecvat a
alocaiilor a necesitat elaborarea unor metode eficiente de programare neliniar.
In vederea optimizrii, se precizeaz funcia obiectiv i restriciile. Pentru sistemele
complexe, din punctul de vedere al fiabilitii, funciile obiectiv pot fi:
1) minimizarea costului pentru o fiabilitate minim i greutate maxim impuse;
2) maximizarea fiabilitii pentru un cost maxim i greutate maxim impuse;
3) minimizarea costului pentru o fiabilitate minim impus, volum i greutate maxime
impuse.
Problema 1.
Fie un sistem cu N elemente n serie, ale cror fiabiliti r
1
, r
2
,...,r
N
, volume v
1
, v
2
,...,v
N
,
costuri c
1
, c
2
,...,c
N
i greuti w
1
, w
2
,...,w
N
sunt cunoscute. Se dorete maximizarea fiabilitii,
prin alocarea unor elemente redondante celor N elemente serie, tiind c resursa privind
costul total este C, volumul total al sitemului trebuie sa fie maxim V i greutatea total
maxim s fie G.










Funcia de fiabilitate a sistemului este

( ) ( ) [ ]

=
=
N
j
j
xj r x R
1
^ 1 1
Restriciile se consider a fi de forma

V x v x g
N
j
j j
=

=1
1
) (


( ) ( ) [ ] C x x c x g
N
j
j j j
+ =

=1
2
4 / exp


( ) W x x w x g
N
j
j j j
=

=1
3
4 / exp ) (
1 1 1 1
2
X
1 X
2
X
j
X
N
1
2 j
N


Aplicaie
j 1 2 3 4 5
r
j
0,8 0,85 0,90 0,65 0,75
v
j
1 2 3 4 2
c
j
7 7 5 9 4
W
j
7 8 8 6 9
V= 100; C = 175; W = 200

Solutie
Matricea datelor
ORIGIN 1 :=
r
v
Md
0.8
1
7
7
0.85
2
7
8
0.9
3
5
8
0.65
4
9
6
0.75
2
4
9
|

\
|
|
|
|
|

:=
c
w
Md
3 4 ,
9 =
Md
1 2 ,
0.85 =
Restrictiile
V 100 :=
C 175 :=
W 200 :=
Functia de fiabilitate
R x1 x2 , x3 , x4 , x5 , ( ) 1 1 Md
1 1 ,
( )
x1

1 1 Md
1 2 ,
( )
x2

1 1 Md
1 3 ,
( )
x3

1 1 Md
1 4 ,
( )
x4

1 1 Md
1 5 ,
( )
x5

:=
Functiile restrictiilor
gv x1 x2 , x3 , x4 , x5 , ( ) Md
2 1 ,
x1 Md
2 2 ,
x1 + Md
2 3 ,
x3 + Md
2 4 ,
x4 + Md
2 5 ,
x5 + :=
gc x1 x2 , x3 , x4 , x5 , ( ) Md
3 1 ,
x1 exp
x1
4
|

\
|
|

+
|

\
|
|

Md
3 2 ,
x2 exp
x2
4
|

\
|
|

+
|

\
|
|

+ Md
3 3 ,
x3 exp
x3
4
|

\
|
|

+
|

\
|
|

+ Md
3 4 ,
x4 exp
x4
4
|

\
|
|

+
|

\
|
|

+ + :=
gw x1 x2 , x3 , x4 , x5 , ( ) Md
4 1 ,
x1 exp
x1
4
|

\
|
|

Md
4 2 ,
x2 exp
x2
4
|

\
|
|

+ Md
4 3 ,
x3 exp
x3
4
|

\
|
|

+ Md
4 4 ,
x4 exp
x4
4
|

\
|
|

+ Md
4 5 ,
x5 + :=
Exemplul 2- maximizarea functiei R
x1 1 :=
x2 1 :=
x3 1 :=
x4 1 :=
x5 1 :=
Given
gv x1 x2 , x3 , x4 , x5 , ( ) V
gc x1 x2 , x3 , x4 , x5 , ( ) C
gw x1 x2 , x3 , x4 , x5 , ( ) W
Nec MaximizeR x1 , x2 , x3 , x4 , x5 , ( ) :=
Nec
2.676
2.353
2.072
3.533
2.79
|

\
|
|
|
|
|
|

=
Solutia - restrictiile suplimentare: necunoscutele sunt numere naturale
Se analizeaza valorile concrete ale solutiilor:
rotunjirea superioara cand fractia este mai mare sau egala cu 0.5, x=floor(x1)+1
rotunjirea inferioara cand fractia este mai mica cu 0.5, x=floor(x1)
Functia floor- partea intreaga
Nec
2 1 ,
2.353 =
Necrs
floor Nec
1 1 ,
( ) 1 +
floor Nec
2 1 ,
( )
floor Nec
3 1 ,
( )
floor Nec
4 1 ,
( ) 1 +
floor Nec
5 1 ,
( ) 1 +
|

\
|
|
|
|
|
|
|

:=
Necrs
3
2
2
4
3
|

\
|
|
|
|
|
|

=
Ms R Necrs
1
Necrs
2
, Necrs
3
, Necrs
4
, Necrs
5
, ( ) :=
floor 4.6 ( ) 4 =
floor 4.2 ( ) 4 =
Ms 0.931 =
Necri
floor Nec
1 1 ,
( )
floor Nec
2 1 ,
( )
floor Nec
3 1 ,
( )
floor Nec
4 1 ,
( )
floor Nec
5 1 ,
( )
|

\
|
|
|
|
|
|
|

:=
Necri
2
2
2
3
2
|

\
|
|
|
|
|
|

=
Mi R Necri
1
Necri
2
, Necri
3
, Necri
4
, Necri
5
, ( ) :=
Mi 0.834 =

You might also like