PROBLEMA 1 (PROBLEMA DE TRANSPORT).

min(sum(sum(cij*xij)))
SE adauga un depozit imaginar X (de costuri 0 si 0 si capacitate 120)
x11+x12+x13+x14=100
x21+x22+x23+x24=200
x11+x21=70
x12+x22=60
x13+x23=50
x14+x24=120
A=(
11110000
00001111
10001000
01000100
00100010

00010001)
c=[3 1 5 0 2 4 6 0]
x=(x11,x12,x13,x14,x21,x22,x23,x24)->pe coloana (PE ASTA NU TREBUIE SA IL
SCRII)
b=(100;200;70;60;50;120]
l=zeros(1,8)
[x,fval,exitflag]=linprog(c,[],[],A,b,l,[])

PROBLEMA 2

b=ones(1,8)
c=[20 40 10 50 100 80 30 40 10 5 60 20 70 30 10 25]
l=zeros(1,16)
u=ones(1,16)
A=(
1111000000000000
0000111100000000
0000000011110000
0000000000001111
1000 100010001000
0100010001000100
0010001000100010
0001000100010001)
[x,fval,exitflag]=linprog(c,[],[],A,b,l,u)
PROBLEMA 3 (PROGRAMARE PATRATICA)

max(22-x)*(20+4x)=
max(-4x^2 +68X +440)=
min(1/2*8*x^2-68x)
H=8
C=-68
l=0
u=22
[x,fval]=quadprog(H,C,[],[],[],[],l,u)
PROBLEMA 4 ->QUADPROG

max(sum(Si-ki*xi)*xi)=min(sum(ki*xi^2-Si*xi)) =>
1/2*H*x^2-C*x

H=(
2*k1 0 0 0
0 2*k2 0 0
0 0 2*k3 0
0 0 0 2*k4)
C=(-S1 -S2 -S3 -S4)
A=[a1 a2 a3 a4]
b=250
l=zeros(1,4)
u=[250;250;250;250]
[x,fval]=quadprog(H,C,A,b,[],[],l,u)
PROBLEMA 5-FMICON

Trebuie create fisiere pentru functii (f e functia al carei minim trebuie sa il calculam
iar in g sunt conditiile care trebuie impunse astfel:
in c trebuie sa fie mai mici sau egale cu constanta

in ceq trebuie sa fie egale cu constata (ex: x1*x2=900)

[x,fval]=fmincon(@fun,[2.5 3.5],[],[],[],[],[2.5 3.5],[],@g)

PROBLEMA 6 -fmicon

FUNCTIA F:
function f=fun(x)
f=sqrt(x(1)^2+x(2)^2+x(3)^2);

FUNCTIA G:
function [c,ceq]=g(x)
c=[];
ceq=(x(1)*x(2)^3*x(3)^2)-16;

CEEA CE APELEZI:
[x,fval]=fmincon(@fun,[0 0 0],[],[],[],[],[0 0 0],[],@g)

MULTUMIRI URMATORILOR: Simion,Buzatu,Lica,Tomei,Paun!