GS TS L Vn t

CC PHNG PHP TI U HO
NG DNG TRONG QUY HOCH THIT K
V VN HNH H THNG IN
(Bi ging chuyn Tin s chuyn ngnh H thng in)

H NI - 2012

M U
Ti liu ny l ni dung chnh ca bi ging chuyn Tin s, dng
cho cc NCS chuyn ngnh H thng in.
Ni dung gm hai phn:
Phn 1. Tng quan v hin trng v trin vng pht trin cc phng
php v k thut ti u ho nhm ng dng trong h thng in (HT).
Phn 2. Pht trin ng dng phng php xp x ho m hnh ti u phi
tuyn. Thut ton v chng trnh tm li gii ti u ton cc xp x ca bi
ton quy hoch phi tuyn, ng dng trong HT.
Mc ch ca phn 1 l tm hiu cc thnh tu ng dng k thut ti u
ho trong lnh vc quy hoch thit k v vn hnh HT cc nc, cho n
thi gian gn y. nh gi u nhc im ca cc phng php, kh nng
pht trin v ng dng vo cc iu kin c th ca HT Vit Nam. Ni dung
bo co thc cht l tp hp cc kin thng qua cc ti liu thu thp v kinh
nghim nghin cu ng dng ca cc cn b b mn HT v lnh vc ti u
ho HT. Nm 1997 CIGR cng c mt bo co c tnh cht tng kt
nh gi v vn ny [1], do nhm cng tc (Task Force 38. 04. 02) thuc
u ban nghin cu SC38 tin hnh. Nhng nm gn y, thc t cng cha c
nhng thnh tu no i mi c bit v lnh vc ng dng k thut ti u
ho vo HT v th phn c bn ca ti liu ny vn tng ng vi bo co
ca CIGR, cc ni dung khc bit ch yu thuc v nhng nh gi, phn
tch v kh nng ng dng cc phng php trong iu kin c th ca Vit
Nam.
Phn 2 trnh by kt qu ng dng v nghin cu pht trin phng
php xp x ho m hnh phi tuyn nhm tm li gii ti u ton cc (xp x)
ca bi ton quy hoch phi tuyn. y c th coi l mt hng i ring, xut
pht t nhu cu gii nghiu bi ton trong lnh vc ti u ho HT nhm to

ra nhng cng c ng dng ph hp vi cc c im ca HT Vit Nam.

Phn ny bao gm ni dung nghin cu l thuyt, pht trin phng php
chung nhm m rng kh nng ng dng vo cc bi ton ti u ho HT.
Thut ton v cc m-un chng trnh xy dng trong phn ny l c s
pht trin ng dng vo cc bi ton khc nhau trong thit k vn hnh HT.

Phn th nht
TNG QUAN V NG DNG CC PHNG
PHP TI U HO TRONG QUY HOCH,
THIT K V VN HNH H THNG IN
1. GII THIU CHUNG

p dng cc phng php ton v k thut ti u ho vo cc hot

ng thc tin l i tng nghin cu ca nhiu lnh vc khc nhau: kinh t,
k thut, khoa hc qun s, khoa hc qun l, ... Hiu qu hot ng ca cc
i tng thc tin c th nng cao r rt nh p dng cc phng php ny.
Tuy nhin kh nng p dng cc phng php v mc ci thin, nng cao
hiu qu rt khc nhau, tu thuc vo c im ca i tng.
H thng in thuc v dng in hnh ca i tng c hot ng
phc tp v th khi p dng cc phng php ti u ho c nhng c im
ring, nhng u vit v kh khn nht nh. khai thc p dng hiu qu
cc phng php ti u ho cn phi nhn r cc c im ny.
2. KHI NIM V PHNG PHP TI U HO- U IM V KH
KHN P DNG

Theo ngha chung nht [1] c th coi mi cch thc trong mt qu trnh
x l y (theo ngha t c mc ch t ra) u l cc phng php
hay k thut ti u ho (Optimisation techniques). Tuy nhin, trong ti liu
ny, cng nh trong [1], mun ni v cc phng php ti u ho p dng
trong quy hoch v vn hnh HT, ch gii hn nh ngha ti u ho bao
gm cc phng php c th m t c bng ton hc trong cha cc
bin iu khin (control variables) cn c la chn t c tr s cc
i hoc cc tiu mt hm mc tiu. Ni khc i, cc phng php v k
thut ti u ho c nh ngha nh l cc phng php ton, cc k thut

x l s, t hp cc phn mm tnh ton t ng cc trng thi khc nhau ca

HT nhm xc nh c li gii tt nht, tng ng vi mt tiu chun
(criteria) cho. Mt bi ton (problem) ti u ho, khi , c hiu l bi
ton tm li gii tt nht trong s nhng li gii kh thi (feasible) tho mn
cc yu cu cho. Mt li gii c coi l li gii kh thi nu n tho mn
mi gii hn v rng buc v c kh nng k thut thc hin trong h thng.
Mt li gii c coi l li gii tt nht c th nu n lm cho tiu chun ti
u la chn nhn gi tr cc i hay cc tiu.
Vic xc nh li gii ti u c th bao gm mt s cng on, trong
mt s cng on c th c thc hin t ng, mt s khc cn c s phi
hp x l bng con ngi.
Vi v d v bi ton ti u ho thng c ngh p dng cc
phng php ti u ho trong quy hoch v vn hnh HT [1]:
u t hp l trang thit b mi v pht trin li truyn ti nhm p
ng nhu cu tng trng ph ti trong tng lai.
Xy dng k hoch bo tr sa cha ti u.
Tm ch phn b cng sut v iu chnh in p tho mn tin
cy v ch tiu kinh t vn hnh.
Cc i ho li tc thu nhp (income) kinh doanh in nng trong mt
chu k tnh ton (v d trong 24 gi k tip).
Nhiu trng hp, li gii xp x ti u c th a ra c bi cc
chuyn gia quy hoch c kinh nghim. Tuy nhin khi HT pht trin phc tp
cch lm ny gp rt nhiu kh khn nu phi xt n y cc yu t, cc
iu kin gii hn v rng buc. Vic p dng cc phng php ti u ho
cng khng phi lun lun thun li. Bng 1-1 tng kt c tnh cht so snh
cc thun li v kh khn khi p dng cc phng php v k thut ti u ho
vo HT (theo [1]).

Bng 1-1
Phng
php p
dng
Ti u ho

Khng ti u
ho

Li gii nhn
c

Mc tiu

Thun li

Kh khn

. Tt nht
trong s cc
li gii kh thi

. Xc nh r
rng

. Thc hin vo
thc t cc li
gii ti u.
. i hi cao v
s lng v
cht lng cc
s liu u vo.
. M hnh bi
ton.
. Yu cu trnh
o to cao.

. Mt li gii
(khng ti u)
. Nhn c
nh kinh
nghim
chuyn gia
. Ph thuc
con ngi

. Ph thuc
ngi s
dng

. a h thng vo
cc iu kin tt.
. H tr (lm nh
nhng) cng vic
ngi vn hnh.
. S dng hiu qu
thi gian.
. Phn tch kho st
c phng php.
. Tm c trng thi
ti u.
. Xem xt c cc
tnh hung tng lai.
. Gip ngi vn
hnh x l nhanh
trong cc iu kin
thc ca h thng.
. Ch cn kho st
mt s t phng n
xut.

. Kinh nghim
thc t.
. S lng cc
la chn.
. Hiu qu s
dng thi gian
km.

2.1. u im ca cc phng php ti u ho

1. V phng din li ch. Li gii ng ca bi ton ti u ho tng
ng vi gii php tt nht trong s cc gii php c th, tho mn c hai yu
cu kinh t v k thut.
2. V tng quan hiu qu li gii. Trong nhng iu kin xc nh
ca hm mc tiu, ca cc bin iu khin v cc rng buc, li gii ti u s

10

hon ton tng ng vi s la chn tt nht ca ngi vn hnh. Bin iu

khin l cc i lng m v nguyn tc ngi vn hnh c th thc hin. V
th tng ng vi li gii ti u ngi vn hnh c th lm cho h thng t
c hiu qu cao nht theo mc tiu mong mun.
Bn cnh vic p dng li gii ti u, k thut ti u ho cn cho php
khai thc nhng kh nng sau:
3. Khi nghin cu mt cch h thng cc li gii ca bi ton ti u
ho, t trong nhng iu kin khc nhau c th pht hin ra cc quan h rng
buc gii hn c ngha quyt nh trong h thng. V d, xt cc gii hn
truyn ti v so snh li gii vi li gii ti u khng gii hn c th ch r
c nhng khu tc nghn trong li truyn ti ca h thng.
4. C th s dng mt th tc t ng nghin cu mt s lng ln
cc tnh hung khc nhau. iu ny rt quan trng trong nhiu lnh vc ti u
ho, v d khi u t lp t thm cc thit b mi, c th c nhiu a im
cng c nhu cu, vi cc kch c thit b khc nhau. Khi cn phi phn tch
phi hp, so snh hng lot phng n theo mt ch tiu chung.
5. Sau khi nhn c li gii ti u, cc iu kin ti u cng vi cc
mi quan h ton hc s c th cung cp nhng thng tin quan trng v nh
hng thay i ( nhy) ca cc bin iu khin cng nh cc gii hn rng
buc. Thng qua cc thng tin ny c th nhn bit mi quan h ca nhng
tham s quan trng nh hng n li gii.
6. Nu p dng c phng php ti u ho cc nhn vin vn hnh
h thng c th c mt cng c hiu qu cung cp cch x l ti u trong
nhng tnh hung mu thun, d kin c th s xy ra trong tng lai.
2.2. Kh khn ca cc phng php ti u ho

11

Mc d c rt nhiu u im v kh nng, cc phng php ti u ho

cng c nhiu kh khn khi p dng vo cc bi ton quy hoch v vn hnh
HT. Cc l do ch yu l:
1. Bi ton ti u ho thng i hi m t bng mt t hp cc bin
trong cc quan h ton hc phc tp: tuyn tnh, phi tuyn, gin on, ri rc
(nh phn), do c th c nhiu cc tr a phng. Li gii nhn c theo
cc phng php lp thng thng rt c th ch l ti u cc b (nhn mt
cc tr a phng). Li gii ti u ton cc rt kh tm v kh khng nh.
2. Li gii ti u nhn c c th l khng thc t v phng din p
dng (mc d tho mn mi gii hn v rng buc). l v n c th
cha mt s lng ln cc bin khng th xc nh nhanh trong iu kin
bin ng ch vn hnh. (Trong trng hp ny thng p dng cc "thut
ton hiu chnh nh" vi vic s dng mt s t bin v hm mc tiu n
gin hn).
3. M hnh y cc bi ton thc t thng rt phc tp. Cc bin
php ri rc ho, n gin ho nhm nhn c li gii c th dn n nhng
chp nhn khng ti u li gii ng dng cui cng.
4. Tnh phc tp ca bi ton cng c th dn n phi chia nh bi
ton thnh nhng bi ton con. Mi bi ton cn gii ring v phi hp kt
qu. Hiu qu khi c th b gim thp ng k (ph thuc cu trc c th
ca bi ton).
5. C trng hp bi ton khng th m t y bng ton hc v v
th khng c phng php gii. Ch c th x l theo kinh nghim ca ngi
vn hnh. V d m t hm mc tiu qu trnh qu din ra "tt nht".
6. Tnh hp l ca d liu l mt hn ch ca cc phng php ti u
ho. Cc thut ton ti u ho thng a h thng vo cc trng thi gii

12

hn. Khi nh hng ( nhy) ca sai s d liu s ln hn so vi trng

thi bnh thng.
7. Cc phng php ti u ho thng i hi nhiu thi gian tnh ton
hn so vi nhng phng php tnh n gin.
2.3. Cc phng thc (modes) s dng
C 2 phng thc s dng chnh: quy hoch (off-line) v vn hnh (online). Mi phng thc li bao gm mt s lng ln cc lnh vc ng dng
vi nhng yu cu khc nhau.
Trc ht l cc bi ton quy hoch pht trin, trong cn thit xem
xt qu trnh u t chn lc cu trc h thng sao cho p ng c nhu cu
cung cp in trong tng lai lun tng trng. thc hin bi ton ny cn
phi tnh ton v nh gi hng lot cc phng n u t, theo c khng gian
v thi gian ( xut v tr v d kin cng sut trang thit b t thm theo
tng giai on). Trong trng hp ny ngoi cc phng php tnh ton nh
gi, cc thut ton phi hp phng n so snh c ngha rt quan trng,
i khi l phn chnh ca k thut ti u ho chim phn ln thi gian thc
hin. Chng trnh tnh ton quy hoch pht trin dung lng b xut
trong [1] l mt v d.
Cc yu cu i vi m hnh v phng php gii trong phng thc
vn hnh c nhiu khc bit so vi quy hoch. Trong phng thc vn hnh
tc tnh ton v tnh n gin c tm quan trng c bit. Mc ch l s
dng c ngay cc kt qu tnh ton. V th trong trng hp m hnh khng
c li gii cn phi xc nh ngay c nguyn nhn v a ra nhng iu
chnh hp l. Phng thc on-line c th da trn kt qu tnh ton mt trng
thi c th. Tuy nhin, khi ni dung hiu chnh sai lch do cc tc ng
ngu nhin l rt cn thit, khng th thiu m bo s ph hp ca li gii
ti u.

13

Khi ch thay i thng xuyn, vic phi hp cc phng php tnh

ton vn hnh (on-line) vi tnh ton quy hoch (off-line) thng em li hiu
qu cao.
3. CC LNH VC NG DNG K THUT TI U HO (TRONG HT)

3.1. Quy hoch h thng

Quy hoch h thng bao gm quy hoch pht trin v quy hoch vn
hnh. Quy hoch pht trin HT ng nht vi bi ton m rng v tng
cng ti u cu trc HT hin ti nhm p ng nhu cu ph ti tng lai.
Quy hoch vn hnh h thng bao gm cc bi ton lp k hoch bo tr nh
my in (NM) v cc thit b li truyn ti.
C hai ni dung quy hoch pht trin v quy hoch vn hnh u lin
quan vi vic pht hin ra cc khu yu nht trong h thng da vo vic tnh
ton phn tch mt s lng ln cc kch bn xut.
Mt trong nhng p dng ca phng php ti u ho vo lnh vc ny
l m phng ch vn hnh ti u h thng theo cc kch bn tng lai v
nh gi chi ph (cost) thng qua kt qu tnh ton. Tuy nhin, khng th biu
th y c mi yu t nh hng n vn hnh h thng trong mt m
hnh duy nht, cn thit phi phn chia bi ton thnh nhng m hnh ti u
ho ring m trong nhiu yu t c xp x ho hoc b qua. Hy xt c
th hn v nhng bi ton in hnh.
3.1.1. Quy hoch di hn ngun v li truyn ti
Bi ton thng c t ra l la chn mt chin lc pht trin ti u
h thng trong khong 10 - 20 nm, p ng c nhu cu tng trng ph
ti, trong khi tho mn mi yu cu v ch tiu k thut h thng [3.16].
Hm mc tiu trong bi ton ny thng c chn phi hp mc
nht nh gia chi ph nh nht v tin cy cao (d phng ln).

14

Mt s ti liu gii thiu cc chng trnh tnh ton tng ng vi

bi ton quy hoch ni trn, in hnh l trong [3.1-3.3], da trn c s
phng php Monte Carlo. Hm mc tiu l chi ph nh nht cho s
(pattern) pht trin ngun m bo nhu cu ph ti v khng gy ra bt c
hin tng qu ti no theo gii hn pht nng trong li truyn ti. Tn tht
trong li truyn ti c phn b dch chuyn vo thanh ci. Phng php
Monte Carlo cho php m phng ngu nhin cc s c ngun v cc phn t
trong li truyn ti. Mt s yu t khc c m t trong chng trnh nh
sau:
- C thanh ci cn bng;
- Ph ti c m t theo ng cong ko di tun;
- Tn tht trong li truyn ti gi thit khng ph thuc vo ngun
pht v phn b v nt ti;
- S dng mt nh my thu in ng tr v mt h cha nc.
- Khng xt n gii hn pht cng sut cc tiu ca cc t my pht
nhit in, chi ph nhin liu c tuyn tnh ho (!);
- Chi ph vn hnh (bao gm chi ph nhin liu v chi ph ph) cng vi
vn u t c a vo hm mc tiu (chi ph tng h thng) cc tiu
ho.
Giai on tip theo l nh gi tng hp hot ng ca ngun v li
truyn ti. Cng nh nhiu tnh ton thc t khc, bi ton c phn chia xt
ring theo bi ton phn b ti u cng sut tc dng (nhm xt qu ti li)
v phn b cng sut phn khng (nhm ti u ho lch in p).
Thc ra mt gii hn quan trng khc cn phi c xt n l gii
hn n nh h thng. Tuy nhin cho n nay cc gii hn ny trong m hnh
bi ton quy hoch (c ch bnh thng v ch s c) vn b b qua

15

[3.6]. Kh khn l ch, cc tnh ton kh phc tp, khng th m t chung

v thc hin trong mi kch bn v tnh hung xt n.
3.1.2. Quy hoch trung hn cng sut phn khng (VAR planning)
Bi ton quy hoch CSPK thng c xt trong khong 3-5 nm
(trung hn) v gii theo 2 bc [3.8]. Bc th nht xc nh tng dung lng
b (dung hoc khng) ti thiu theo yu cu gi in p nt ca li truyn
ti v khng d tr cng sut phn khng ngun (cc t my pht). Bc
th hai, xc nh mc u t c li nht v kinh t cho vic t thm cc
ngun cng sut b (so snh chi ph t thm thit b b vi tit kim chi ph
tn tht CSTD).
Cc tnh ton c thc hin cho tnh hung xu nht, trong c bit
quan tm n thut ton nh gi mc st p. thc hin tnh ton bng
chng trnh [ 3.4,3.7 - 3.9] mt s lng ln cc tnh hung nguy him
c chn a vo xem xt.
3.1.3. Mt s yu cu c bit trong bi ton quy hoch
Trong cc HT hp nht c cc ng dy ti in di lin kt nhiu
khu vc, xut hin nhng yu cu mi trong tnh ton quy hoch. Vn l
ch, cc ng dy di in p siu cao thng c gii hn truyn ti ph
thuc ch yu vo phn b in p v iu kin n nh (nm xa gii hn pht
nng). Ngoi ra tn tht cng sut tc dng trn cc ng dy ny rt ng
k v ph thuc vo ch truyn ti. Gi thnh sn xut in nng mi
khu vc khng ging nhau. Hiu qu khai thc h cha nc ca cc NMT
rt ph thuc vo gii hn truyn ti cng sut gia cc khu vc. B qua
nhng yu t ny c th lm sai lch kt qu n mc khng chp nhn c
trong cc bi ton quy hoch. Nhiu nghin cu thc t th hin r rt kt
lun ny [3.5, 3.12]. Trong [3.13] ch ra yu cu phi xt n gii hn

16

truyn ti ti cc khu vc trong quy hoch ngun in, k n ng thi yu

t kinh t v yu t tin cy h thng trong bi ton quy hoch.
3.2. Quy hoch vn hnh
Cc h thng in ln, lin kt nhiu khu vc ngy cng tr nn ph
bin. Trong cc h thng ny t trng tn tht trong li c vai tr ng k,
gii hn cng sut truyn ti v lch in p cc nt l nhng yu t c
ngha rt quyt nh, trong khi yu cu i vi cc ch tiu vn hnh kinh t,
tin cy ngy cng cao.
ng trc thc t ny nhiu nghin cu nhm pht trin chng trnh
v thut ton quy hoch ti u vn hnh HT c thc hin. Trc ht l
vic a vo xem xt cc bin phi tuyn nhm th hin mi quan h phi tuyn
r rt gia tn tht v dng cng sut truyn ti. Tip n l vic p dng cc
thut ton mnh nhm gii c cc bi ton ln xt n tng hp nhiu yu
t gii hn, tnh ton nhanh v cho li gii tin cy.
Ni chung cc chng trnh tnh ton phn b ti u cng sut cho n
hin nay vn tch ring : phn b ti u CSTD v ti u ho CSPK.
Khi gii bi ton phn b ti u CSTD cc bin iu khin c s
dng l cng sut tc dng ca cc t my v tc ng iu chnh pha ca
thit b FACTS. Khi ti u ho CSPK cc bin iu khin c s dng l
CSPK v in p u cc ca cc t my pht, t s bin p ca cc my bin
p iu p di ti, cng sut phn khng to ra ca cc thit b b. Trong c
hai bi ton trn u phi xt n tn tht cng sut tc dng.
Hm mc tiu ca bi ton phn b ti u CSTD c th bao gm cc
thnh phn nhm cc tiu ho tng chi ph nhin liu cc NMN trong h
thng, nhim mi trng v tn tht trong li, cc i ho cng sut tc
dng truyn ti gia cc khu vc. Cc quy tc xc nh gi thnh truyn ti c
th c ghi vo chng trnh thng qua vic gii bi ton truyn ti m.

17

Truyn ti in mt chiu cng c xt n trong m hnh bi ton (xem chi

tit phn di).
3.2.1. Hot ng iu phi cng sut tc dng
Hot ng iu phi CSTD dng trong mi trng EMS ng vi nhng
khong thi gian khc nhau, xt n tin cy s dng cng sut v in
nng khong tnh ton k tip. Thng c chp nhn cc khong tnh
ton sau:
. K hoch trc mt ngy (day-before scheduling);
. iu phi thi gian thc (advance dispatch);
. iu phi tc thi (instantaneous econmic dispatch) .
Bi ton xy dng k hoch trc cho vn hnh mt ngy k tip
thng c gi l bi ton phn b ti u cng sut tc dng trong 24 gi.
Cc khong thi gian tnh ton thng chn t 5 pht n 1 gi, trong ph
ti c ly theo biu d bo [3.16,3.17]. Cc t my nhit in thng
c gi thit khng ng ct hoc ch ng ct trong nhng trng hp ht
sc c bit. Gii hn v nhim mi trng c cho theo gii hn in
nng pht ca mt s NMN (ph thuc c tnh nhin liu v iu kin thi
tit).
Bi ton ti u ho iu phi thi gian thc nhm iu chnh li biu
vn hnh theo nhng d bo ngn hn v ph ti (30 pht n 1 gi). Cc tnh
ton ti u ho phn b cng sut tc dng c thc hin cho nhng khong
thi gian t 1 n 5 pht [3.20,3.21]. Cc thut ton ny cn la chn c
th tnh ton nhanh.
Cui cng l iu phi kinh t sau nhng bin ng ngu nhin. Trong
trng hp ph ti c bin ng ln t ngt ngoi d bo, thit b t ng
iu chnh tn s cc my pht hot ng, thay i cng sut tc dng gi
tn s. Sau nhng tc ng ny cn c tc ng iu phi li theo iu kin

18

kinh t (economic dispatch) gi l iu phi kinh t tc thi (instantaneous

econmic dispatch). Thut ton s dng trong bi ton ny thng l xp x ti
u: hiu chnh nhanh theo iu kin mi trn c s cc t l phn b ti u
cng sut trc . Cc nghin cu kh in hnh v cc thut ton ny c
trnh by trong cc ti liu [3.20, 3.28].
3.2.2. Ti u ho in p v cng sut phn khng
Bi ton ti u ho CSPK c thc hin cho khong thi gian 1 ngy
m da trn c s bi ton ti u ho ngn hn phn b CSTD v biu
ph ti 1 ngy m. Hm mc tiu l cc tiu tn tht CSTD trong li truyn
ti. Cc bin iu khin l in p u cc (hoc CSPK) cc t my pht, u
phn p ca cc my bin p iu p di ti, cng sut lm vic ca cc thit
b b. Cc rng buc bao gm gii hn CSPK pht ca cc my pht, gii hn
in p cc nt trong li, gii hn truyn ti CSPK trn cc ng dy (c
th theo iu kin n nh).
iu phi rt ngn hn CSPK (15-30 pht) cng c nghin cu.
Trong [3.10] cn trnh by mt phn mm xy dng nhm ti u ho thi
gian thc iu chnh in p (hay CSPK) my pht. Tuy nhin, vic iu phi
rt ngn hn CSPK hin nay cn t c p dng.
3.2.3. Ch vn hnh cng bc
Cc bi ton nghin cu v phn b dng cng sut thng thng c
m t vi ph ti bit, tng ng vi CXL 3 pha i xng. Cn phn bit
CXL bnh thng v CXL cng bc. Trong CXL bnh thng cc quan
h rng buc da trn c s cu trc thc bnh thng (actual structure) ca
li vi s nt, s nhnh hon ton xc nh, k c trng thi lm vic ca cc
my pht. Cc rng buc trong ch cng bc (cn gi l ch c mc
an ton n-1 hoc ch khn cp) c nh ngha nh sau. Mt h thng
vn hnh trong ch n-1 nu:

19

. Trc t bin tho mn cc rng buc vn hnh bnh thng;

. C mt nhnh (k c thit b b ngang) hoc mt my pht ngng lm
vic.
Ti u ho ch vn hnh cng bc c lin quan nhiu vi yu cu
v tin cy. l v trong trng thi vn hnh cng bc, nu c xy ra mt
t bin no th h thng d chuyn sang ch rt xu. khi phc
c cn phi mt mt thi gian qu . Trong trng hp ny mu thun
gia yu cu nng cao tin cy vi chi ph tng thm v vn u t v
nhim mi trng c ngha trng yu trong ni dung bi ton. M hnh ton
hc bi ton phn b dng ti u trong ch cng bc, xt n cc rng
buc v tin cy cng c nghin cu trong kh nhiu cng trnh [3.24,
4.2, 4.5].
3.3. H thng truyn ti m
S lin kt h thng in gia cc nc ang tr thnh xu hng. Ca
m lin thng gia cc h thng a n nhng yu cu quan trng trong
qun l v tnh ton, trc ht l gi mua v bn in. iu ny kh phc tp
v c quan h vi u t li ca c hai pha (mua CSTD, t b CSPK chng
hn). Trong ti liu ca CIGRE TF38.04.03 : "Methods and Tools for
Transmission Costing" c m t chi tit v ni dung ni trn.
Hm mc tiu trong trng hp ny bao gm cc ch tiu:
- Cc tiu chi ph;
- Truyn ti ti a;
- Tn tht t nht.
i vi h thng pht c th a cc ch tiu trn vo hm mc tiu c
lp vi h thng nhn cng sut. Sau t chc qu trnh vn hnh v thit
lp phng php mua bn in nng. i vi h thng nhn, cn tnh ton gi
in mua trong bi ton ti u ho u t li v phng thc mua bn. y

20

cng l mt ni dung kh phong ph, rt mi m nhng cn c quan tm

i vi HT Vit Nam.
Bng sau tng kt cc lnh vc ng dng, kh nng v hn ch ca vic
s dng k thut ti u ho trong HT.

21

Bng 2.
Phm vi ng dng
thi gian bi ton

Quy hch
thng

Ngun v li

Mc tiu ti u
ha
vn u t v chi
ph vn hnh

Cung cp v cng

vn u t v chi
ph tn tht

Lin kt h thng

vn u t v chi
ph thiu in

Phn b hu cng

chi ph sn xut

Phn b v cng

d tr v cng, gi
in p, chi ph tn
tht

Quy hoch vn
hnh (gi, ngy,
tun, nm)

Lin kt h thng

Kh nng ti, chi

ph phc v

Phn b hu cng

chi ph sn xut

Phn b v cng

tn tht, lch
in p, d tr v
cng

Cc ng dng
thi gian thc

Ni dung m hnh
Bin iu khin: P, P+Q
M hnh li: T,DC,AC
Rng buc: dng P, gii
hn.U
Bin iu khin: Q
M hnh li: AC
M hnh li: dng P, gii
hn.U
Bin iu khin: P, P+Q
M hnh li: T,DC,AC
Rng buc: dng P, gii
hn.U
Bin iu khin: P, P+Q
M hnh li: DC,AC
Rng buc: dng P, gii
hn.U
Bin iu khin: Q, P+Q
M hnh li: AC, t.t. ho
Rng buc: dng P, gii
hn.U
Bin iu khin: P, Q, P+Q
M hnh li: DC
Rng buc: dng P, gii
hn.U
Bin iu khin: P
M hnh li: DC, t.t. ho
Rng buc: dng P
Bin iu khin: Q
M hnh li: AC
Rng buc: gii hn.U

Trin vng p
dng c hiu qu
M phng Monte Carlo
T hp cc phng
n in hnh
Hm mc tiu tng
hp, xt n chi ph
tn tht v d tr
v cng
M phng Monte Carlo
T hp cc phng
n in hnh

iu khin T cng
sut pht (AGC)
iu khin th cp

K hiu trong m hnh: B. - bin iu khin, L .- li in, R. - rng

buc.
K hiu kiu ng dng: O - operational, UD - Under development, R research.

20

TI LIU THAM KHO

[1]. Application of Optimisatipon Techniques to Study Power Systeem Network
Performance. CIGRE TF 38.04.02. October - 1997.
[2]. S. Granville, M.V.F. Pereira, A. Monticelli. "An integrated methodology for
VAR souce planning". IEEE Transaction on Power Systems. Vol 3, May 1988.
[3]. WG37-10. Electra No 161. August 1995.
[4]. R. M. Dunnett, J. F. Macqueen. "Transmission Planning by Monte Carlo
Optimisation". Proceedings of 10th PSCC, August 1990.
[5]. P. Noferi, L. Salvadri. "Monte Carlo method for Power System evaluation in
Transmission and Generation Planning". Annual Reliability and Maintainability
Simposium, IEEE 75, Washington, 1975.
[6]. J. C. Dodu, A. Merlin. "Recent Improvement in Mexico model for Probabilistic
planning Stady". Electrical Power and Energy Systems. Vol. 1, May, 1988.

Cc ti liu tham kho ca [1]:

[1.2] Optimization in Planning and Operation of Electricai Power Systems, Editors:
K.Frauendorfer, H.Glavitsch, R.Bacher, Physica- V erlag Heidelberg (A Springer
Company), 1993, ISBN 3-7908-0718-4.
[3.1] R.M. Dunnett, J.F. Macqueen, 'Transmission Planning by Monte Carlo
Optimisation', Proceedings of 10th PSCC, pp. 24-31, Aug. 1990.. .
[3.2] P. Noferi, L. Paris, L. Salvaderi, 'Monte Carlo method for power system
evaluation

in

transmission

and

generation

planning',

Annual

Reliability

and

Maintainability Symposium. IEEE 75, CHO 918-3 RQC, Washington, Jan. 1975
[3.3] J.C. Dodu, A. Merlin, 'Recent improvements in Mexico model for probabilistic
plan_ing studies', Electrical Power and Energy Systems, Vol. l, No. l, April 1979.
[3.4] S.Granville, M.V.F. Pereira, A. Monticelli, 'An integrated methodology for V
AR source planning', IEEE Transaction on Power Systems vol 3, pp 549-557, May 1988.
[3.5] L. Feltin, F. Descamps, 'A new model to assess the composite adequacy and
the operating costs of large interconnected systems' ,.IEEE/KTH, Stockholm Power Tech,
June 1995.

21

[3.6] Bryan, M.c. Calviou, 'Representing the effect of Post-Fault actions in a

Security Constrained MW optimisation planning program', Proceedings of29th UPEC, pp
149-151, Sept. 1994.
. [3.7] Thomas, A.M. Dixon, D.T. Cheng, RM. Dunnett, G. Schaff, J.D. Thorp,
'Optimal reactive planning with security constraints', Proceedings of PICA 95, pp. 79-84,
Salte Lake City, May 1995.
[3.8] A. Ardito, B. Cova, M. Innorta, P. Marannino, S. Nevaloro, 'Active constraint
strategies in optimisation algorithrns applied to V AR compensation planning of electric
power systems.' CIGRE Meeting 1990. paper No. 37-301, Paris, Aug. 1990.
[3;9] B. Blanchon, J.c. Dodu, A. Renaud, M. Bouhtou, 'Implementation of a primaldual interior-point method applied to the planning of reactive power compensation
devices', Proceedings of XII pscc Conference, Dresden, Germany, Aug. 1996.
[3.10] S. Corsi , P. Marannino, N. Losignore, G. Moreschini, G. Piccini,
'Coordination between the reactive power scheduling and the hierarchical voltage control
of the EHV ENEL system', IEEE Transactions on PWRS, VoLlO, NO. 2, pp. 686-694, May
1995.
[3.11] O. Bertoldi, A. Rivoiro, L. Salvaderi, 'New trends in power system planning
and related effect on the reliability evaluation', Reliability Engineering and System Safety
46, Elsevier Publishing, pp. 49-61, 1994
[3.12] O. Bertoldi, M. Innorta, G. Demartini, L. Salvaderi, P. Marannino, 'New
issues in bulk power system planning', CIGRE General Meeting 1996, paper 37-106, Paris,
Aug. 1996
[3.13] J. Carpentier, 'Optimal power flows (a survey)', Int. J.Electr. Power &
Energy Syst., Vol. 1, No. 1, pp. 3-15, April 1978
[3.14] L. Franchi, M. Innorta, P. Marannino, C. Sabelli: 'Evaluation of economy
and/or security oriented objective functions for reactive power scheduling in large sc ale
systems', IEEE Transactions on PAS, Vol. PAS-1O2, No. 10, pp. 3481-3488, Ott. 1983.
[3.15] L.M. Barruncho, P. Suchena Paiva, Chen Ching Liu, R. Pestana, A. Vidigal,
'Reactive management and voltage monitoring and control', Electric Power and Energy
Systems, Vol 14, No.2/3,pp. 144-157, ApriVJune, 1992.
[3.16] WG37-1O. Electra no 161, August 1995.

22

[3.17] D. W. Ross, S. Kim, 'Dynamic economic dispatch of generation' ,IEEE

Trans. Power Appar. & Syst. , Vol. PAS-99, No. 6, pp. 2062-2068, Nov.-Dec. 1980.
[3.18] S. F. J. Brodsky and R. W. Hahn, 'Assessing the influence of power pools on
emission constrained economic dispatch', IEEE Transactions on PWRS, Vol. PWRS-l, No.
1, pp. 57-62, Feb. 1986.
[3.19] R. Yokoyama, B. S. Kermanshahi, K. Aoki, T. Satoh, H. Sasaki, M.
Kanezashi, 'Dynamic generation dispatching considering security and e_vironmental
operating constraints', Proceedings of9th PSCC , pp. 36-40, Cascais, Aug.1987.
[3.20] M. Innorta, P. Marannino, 'Advance dispatch procedures for the centralized
contrai of real power', IEEE Transactions on Power Systems, Vol. PWRS-l, No. 2, pp. 233240, May 1986.
[3.21] 1. Carpentier, 'Towards a secure and optimal automatic operation of power
system', Proceedings of 15th PICA, pp. 2-37, Montreal, May 1987.
[3.22] G. Gross, F. D. Galiana, 'Short-term 1000 forecasting' Proc. IEEE, Vol. 75,
No.12, pp. 1558-1573, Dec. 1987.
[3.23] F.F. Wu, 'Real-time network security monitoring, assessment and
optimization', lnt. J. Electr. Power & Energy Syst. , Vol. 10, No. 2, pp. 83-100, April 1988.
[3.24] B. Stott, O. Alsac, and A. J. Monticelli, 'Security analysis and optimization',
froc. IEEE, Vol. 75, No. 12, pp. 1623-1644, December 1987.
[3.25] B. Cova, G. P. Granelli, M. Montagna, A. Silvestri, M. Innorta, P. Marannino,
'Largescale application of the Han-Powell algorithm: to compact models of static and
dynamic dispatch of real power', Int. J. Electr. Power & Energy Syst., Vol. 9 No. 3, pp.130141, July 1987.
[3.26] P. Marannino, G.P. Granelli, M. Montagna, A. Silvestri, 'Different time-scale
approaches to the real power dispatch of thermal units', IEEE Transactions on PWRS, Vol.
5, N. l, pp. 169-176, Feb. 1990.
[3.27] G. Gross, D. Finlay, 'Optimal bidding strategies in competitive electricity
markets', Proceeding of XII pscc Conference, Dresden, Aug. 1996.
[3.28] R. Bacher, H. P. Van Meeteren, 'Real-time optimal power flow in automatic
generation control' ,IEEE Transactions on PWRS, Vol. 3, No. 4, pp. 1518-1529, Nov.1988.

23

[4.1] AM Chebbo, M R Irving, and N Dandachi, 'Combined Active and Reactive

Dispatch, Parts 1 and II', IEE Proceedings, Part C, Vol. 142, NoA, July 1995, pp 393-405.
[4.2] B Cova, N Losignore, P Marannino, M Montagna, 'Contingency constrained
optimal reactive power flow procedures for voltage control in planning and operation',
Proceedings of IEEE Athens Power Tech Conference, Vol 2, pp 585-590, Athens, Sep 1993
[4.3] M. Ilic, F. Galiana, L. Fink, A. Bose, P. Mallet, H. Othman: 'Transmission
Capacity in Power Networks', Invited paper at the PSCC - Dresden - 08/1996
[4.4] N. Flatabo, J.A. Foosnes, T.O. Bemtsen: 'Transformer Tap Setting in Optimal
Load Flow' , IEEE SM 84, Paper no. 84 SM 551-8.
[4.5] A Monticelli, M V F Pereira, and S Granville, 'Security constrained optimal
power flow with post-contingency corrective rescheduling' , IEEE Trans on Power Syst,
Vol PWRS-2, pp175-182, Feb 1987.
[4.6] W. Fritz, H.J. Haubrich, p. Stelzner, D. Heinz: 'Optimal Power Flow Algorithm
for Common Treatment of Generation and Grid including Generator Losses' , . PSCC Dresden 08/1996.
[4.7] J. Griffin, D. Atanackovic, F.D. Galiana, 'A Study of the Impact ofFAcrS on
the Secure-economic Operation of Power Systems', Proceeding of the"xn PSCC
Conference, Dresden, Germany, August 1996, pp 1077-1082.
[5.1] J.L. Martinez Ramos, A. Gomez Exposito, V.H. Quintana, 'Reactive Power
Optimisation by Interior Point Methods: Implementation Issues', Proceeding of the Xli
PSCC Conference, Dresden, Germany, August 1996, pp 844-850.
[5.2] AD. Patton: Dynamic 'Optimal dispatch of real power for thermal generating
units', Proceedings VIII PICA Conference. , pp. 403-411, Minneapolis, 1973.
[5.3] T.E. Bechert, N. Chen: 'Area automatic generation control by multi-pass
dynamic programming', IEEE PES Winter Meeting, New York, Feb. 1977.
[5.4] D. W. Ross, S. Kim': 'Dynamic economic dispatch of generation', IEEE
Transactions on PAS, VOL. PAS-99, No. 6, pp. 2060-2068, Nov.-Dec. 1980.
[5.5] M. Innorta, P. Marannino, 'Advance dispatch procedures for the centralised
control of real power' , IEEE Transactions on Power Systems, Vol. PWRS-l, No. 2, pp.
233-240, May 1986.

24

[5.6] M. Huneault, A. Voidani, M. Juman, R. Calderon, F.D. Galliana: 'The

continuation method in power system optimization: Application to economy security
functions', IEEE Transactions on PAS, Vol. PAS-I04, pp. 114-124, Jan. 1985.
[5.7] M. Innorta, P. Marannino, G.P. Granelli, M. Montagna, A. Silvestri: 'Security
constrained dynamic dispatch of real power for thermal groups', IEEE Transactions on
PWRS, Vol. 3, N 2, pp. 774-781, May 1988.
[5.8] M. Yoshikawa, Y. Harada, N. Toshida, M. Tsurugai, 11. Nakajima, Y. Nakata,
"On-line
economic load dispatch based on fuel cost dynamics, IEEE PES Winter Meeting,
paper 96 WM 289-9 PWRS, Baltimore, Jan. 1996
[5.9] O. Aisac, B. Stott, and W.F. Tinney: "Sparsity-oriented compensation methods
-for modified network solutions", IEEE Transactions on PAS, vol PAS-1O2, pp- 10501060, May 1983.
[5.10] J.F. Benders, 'Partitioning for solving mixed variables prograrnming
problems', Numerische Mathematik, Vol. 4, pp.238-252,1962.
[5.11] L L Lai, 1 T Ma and K P Wong, 'Evolutionary progrimuning for economic
dispatch of units with non-smooth input-output characteristic functions', 12th PSCC,
Dresden, Germany, Aug 1996.
[5.12] G. BlanJ:hon, J.C. Dodu, J.Y. Leost: UA Benders-type decomposition
method for planning reactive power compensation devices", Proceedings of Xl PSCC
Conference, VoL, pp. Avignon, Aug. 1993.
[5.13] S. Granville, M. C. A. Lima: 'Application of Decomposition techniques to
Var planning: Methodological & computational aspects', IEEE Transactions on PWRS,
Vo1.9, No 4, pp.1780-1786, Nov. 1994.
[5.14] G.B. Dantzig, P. Wolfe, 'A decomposition principle for linear programs',
Operations Research, Vol. 8, No.l, 1959.
[5.15] R. Romano, V.H. Quintana, R. Lopez, V. Valdez, 'Constrained economic
dispatch of multi area systems using the Dantzig-Wolfe decomposition principle', IEEE
Transactions on PAS, Vol. PAS-lOO (4), pp. 2127-2137, Apr.1981.

25

[5.16] M. Aganic, S. Sasan, 'Security constrained economic dispatch using non

linear DantzigWolfe decompsition',IEEE PES Winter Meeting, paper 96WM 195-8 PWRS,
New York, Jan. 1996.
[5.17] S. Virmani, E.C. Adrian, K.Irnhof, S. Mukherjee, 'Implementation of a
lagrangian relaxation based unit commitment problem', IEEE Transactiona on PWRS, Vol.
4, No. 4, pp. 1373-1379, Ocr. 1989.
[5.18] S.J. Wang, S.M. Shahidehpour, O.S. Kirschen, S. Mokhtari, G.D.
Irisarri,'Short term generation scheduling with transmission and environmental constraints
using an augmented lagrangian relaxation', IEEE Transactions on PWRS, Vol. 10, No. 3,
pp. 1294-1301, Aug. 1995.
[5.19] N.I. Deeb, S.M. Shahidehpour, 'Linear reactive power optimization in a large
power network using the decomposition approach', IEEE Transactions on PWRS, Vol. 5,
No. 2, May 1990, pp. 428-438.
. [5.20] B. Stott, J.L. Marinho: "Linear Programming for Power System Security
Applications",
IEEE Transactions on PAS, Vol. PAS-98, pp. 837-848, May/June 1979.
[5.21] D.I. Sun, B. Ashley, B. Brewer, A. Hudges, W.F. Tinney: "Optimal power
flow by' Newton approach", IEEE Transactions on PAS, Vol. PAS-1O3, pp. 2864-2880,
Oet. 1984.
[5.22] J T Ma and L L Lai, 'Evolutionary Programming Approach to reactive power
planning', IEE Proceedings - Generation, Transmission and Distribution, Vol 143, No 3,
May 1996.
[5.23] V.C. Ramesh, S.N. Talukdar, 'A parallel asynehronous decomposition for online contingency planning'" Proceedings of PICA Conference, pp.243-248, Salt Lake City,
May 1995.
[5.24] H.W. Dommel, W.F. Tinney: 'Optimal power flow solutions'. IEEE Trans. on
Power Apparatus and Systems. Vol. PAS-87. No. 10, pp. 1866-1876, Ocr. 1968.
[5.25] RC. Bu(chett, H.H. Happ. D.R Vierath, K.A. Wirgau: 'Developments in
optimal power flow', Proceedings of PICA Conf.. 1981.
[5.26] J. Welge, N. Peterson: Optimal control of real and reactive power flow under
constraints' , Proceedings of W PSCC. Grenoble, 1972.

26

[5.27] F. Wu, G. Gross, J.F. Luini, P.M. Lock: 'A two stage approach to solving
large sc ale optimal power flows' , Proceedings of PICA Conference, Clevelend 1979
[5.28] J. Peschon, D.W. Bree, L.P. Hajdu: 'Optimal solutions involving system
security'. ProceedingsofPICA Conference, pp. 210-218, May 1971.
[5.29] J. Carpentier: 'Results and extensions of the methods of differential and total
injections'.
Proceeding of IV PSCC Conf. , Grenoble, 1972.
[5.30] J. Carpentier: 'Differentiai injections method, a general method for a secure
and optimal load flow', Proceeding of PICA Conference, pp. 263-268, 1973.
[5.31] J. Carpentier, V. Saminaden, D. Boull, R. Girard, V. Nguyen: 'Real and
reactive decoupling possibilities in optimal load flows: A compact version of the
differential injection method', Proceedings of V PSCC Conference. ,Cambridge, 1975.
[5.32] J.Abadie, J. Carpentier: 'Generalization of the Wolfe reduced gradient
method to the case of non linear constraints', in Optimization Accademic Press, pp- 37-47,
1969.
[5.33] L L Lai and J T Ma, 'Application of evolutionary programming to reactive
power planning - comparison with non-linear programming approach', IEEE Power Winter
Meeting, January 1996, Paper No. 96 WM 248-5-PWRS
[5.34] M. Huneault, F.D. Galliana: 'A Survey of the optimal power flow literature',
IEEE Trans. on PWRS, V 01.6, No. 2, pp. 762-770, May 1991.
[5.35] A.M. Sasson: 'Non linear programming solution for load flow, minimum loss
and economic dispatch problems', IEEE Trans. on PAS, Vol. PAS-88, pp. 3?9-406, April
1969.
[5.36] A.M. Sasson, F. Vitoria, F. Aboyotes: 'Optimal load flow using the Hessian
matrix', Proceedings of Pica Conerence. pp. 203-209, 1971.
[5.37] A.M. Sasson: 'Combined use of the Powell and Fletcher Powell non linear
programming methods for optimalload flow', , IEEE Trans. on PAS, Vol. PAS-88, pp. 15301537, Cct. 1969.
[5.38] B. Cory, P. Henser: 'Economie dispatch with security using non linear
programming', Proceedings of N PSCC, Grenoble 1972.

27

[5.39] E. Housos, G.D. Irisarri: 'Real and reactive power system security dispatch
using a variable weights method', IEEE Trans. on PAS, Vol. PAS 102, No. 5, pp. 12601268, 1983.
[5.40] D. G. Luenberger, Linear and non-Linear Programming, Reading; AddisonWesley, 1984.
[5.41] A. Velasco-Levy and S. Gomez, 'Sequential gradient-restoration algorithm
for the optimisation of a non-linear constrained function', The Journal of the Astronautical
Sciences, Vol. XXX, No. 2, pp. 131-142, April-June 1982.
[5.42] A. Miele, A_ Calabro, F. Rossi, A.K. Wu' 'The prerestorative step in the
sequential gradient restoration algorithm for mathematical programming problems with
inequality constraints', Applied Mathematics and Computation, No. 3, 1977.
[5.43] P. Marannino, G.P. Granelli, M. Montagna, A. Silvestri, 'Different time-scale
approaches to the real power dispatch of thennal units', IEEE Tranactions_ on PWRS, Vol.
5, N. 1, pp. 169-176, Feb. 1990.
[5.44] S. P. Han, 'A globally convergent method for non linear programming',
Report No. 75257, Department of Computer Science, Comell University, Itaca, 1975.
[5.45] T.c. Gras, S.N. Talukdar: 'Quasi-Newton methods for optimal power flows',
Int. J. Electr. Power and Energy Systems, Vol. 3, No. 2, pp. 59-64, April 1981.
[5.46] J.S. Lipowski, C Charalambous: 'Solution of optimal load flow problem by
modified recursive quadratic programming method', Proc. lnst. Electr. Eng. , Vol. 128 Pt C
No 5, pp. 288-294.
[5.47] S.N. Talukdar, T.C. Giras, V.K. Kalyan: 'Decompositions for optimal power
flows', IEEE Trans. on PAS, Vol. PAS 102, No. 12, pp. 3877-3884, Dec. 1983.
[5.48] L Franchi, M. Innorta, P. Marannino, C. Sabelli: 'Evaluation of economy
and/or security oriented objective functions for reactive power scheduling in large sc ale
systems', IEEE Tranaction on PAS, Vol. PAS-1O2, No. 10, pp. 3481-3488, October 1983.
[5.49] B. Cova, G. P. Granelli, M. Montagna, A. Silvestri, M. Innorta, P. Marannino,
'Largescale application of the Han-Powell algorithm to compact models of static and
dynamic dispatch of real power', lnt. J. Electr. Power & Energy Syst., Vol. 9 No. 3, pp.130141, July 1987.

28

[5.50] H. Glavitsch, M. Spoerry: 'Quadratic 10ss fonnula for the reactive dispatch',
IEEE Trans. on PAS, Vol. PAS-1O2, No. 12, pp.3850-3858, dec. 1983.
[5.51] K. Aoki, M. Kanezashi: 'A modified Newton method for optimal power flow
using quadratic approximated power flow', IEEE Tranactions. on PAS, Vol. PAS-I04, NO.
8, pp. 2119, Aug. 1985.
[5.52] E.M. Beale: ' Mathematical Programming n Practice', Sir Isaac Pitman and
Sons Ltd., 1968.
[5.53] B.A. Murtagh, M.A. Saunders: Minos AugmentedUser's Manual': Report
SOL 80-14, 1980, Dep. of Operations Research, Stanford University, 1980.
[5.54] G. Blanchon, J.F. Bonnans, J.c. Dodu, ' Optimisation des rseaux lectriques
de grande taille par une mthode de Newton', in Lecture Notes in Information and Control
Sciences, N 144, A. Bensoussan and'J.L'Lions eds, Berlin, pp. 423-431, 1990.
[5.55] P. Gill, W. Murray, H. Wright: 'Practical Optimization', Academic Press,
1981,
[5.56] RC. Burchett, H.R. Happ, D.R Vierath: ' Quadratically convergent optimal
power flow', IEEE Trans. on PAS, Vol. PAS-1O3, No. Il, pp. 3267-3275, Nov. 1984.
[5.57] B. Stott, B. Hobson, 'Power system security control calculation using linear
programming' ,Part.! and PartIT, IEEE Transactions on PAS, Vol. PAS-97,pp. 17131731,Sep./Oct 1978.
[5.58] c.M. Shen, M.A. Laughton, 'Power system 10ad scheduling with security
constraints using duallinear programming' ,Proceedings of IEE, Vol. 117, No Il, Nov. 1970.
[5.59] W. L. Snyder: 'Line'ar Programming adapted for Optimal Power Flow', IEEE
Tmorial Course, ,Publ. no. 90, 36EHO328-5, pp. 20-36, 1990.
[5.60] J. Rosen:'The gradient projection method for non-linear programming, Part l,
Linear Constraints' , J. Soc. Indust. Appl. Math. 8, pp 181-211, 1960.
[5.61] G.P. Granelli, M. Montagna, M. Innorta, P. Marannino, 'A parallel approach
to security assessment and to. real power rescheduling on a supercomputer', Proceedings
of XI PSCC Conference, Vol. l, pp. 503-509, Avignon, Aug. 1993.
[5.62] R.W. Freund, N.M. Nachtigal, 'QMR: a quasi-minimal residual method for
nonHermitian linear systems', Numer. Math., Vol. 60, pp. 315-339, 1991.

29

[5.63] N. Karmarkar, 'New polinomial-time algorithm for linear programming',

Combinatorica 4,pp.313-395,1984.
[5.64] I. Adler, N. Karmarkar, M.c;:J. Resende, G. Veiga: 'An implementation of
Karmarkar's algorithm for linear programming', Mathematical Programming 44 , pp. 297335,1989.
[5.65] J.A. Momoh, 'Application of quadratic interior point,.algorithm to optimal
power flow',
EPRI Report RP 2473-36 II, March 1992.

[5.66] LS. Vargas, V.H. Quintana, A. Vannelli: 'A tutorial description of an interior
point' method and its applications to security-constrained economic dispatch', IEEE
Transactions on
PWRS, Vol. 8, pp. 1315-1323, Aug. 1993.
[5.61] Yu-Chi Wu, A. Debs, R.E. Marsten: ' A direct nonlinear predictor-corrector
primal-dual interior point algorithm for optimal power flow', IEEE Transactions on PWRS,
Vol. 9, No 2, pp. 816-883,May 1994.
[5.68] S. Granville, J.C.O. Mello, A.C.G. Melo: "Application of interior point
methods to power flow unsolvability", IEEE Summer Meeting, Paper no. 95 SM 599-1
PWRS.
[5.69] M.V. Cazzol, A. Garzillo, M. Innorta, N. Losignore, P. Marannino, 'The
solution of voltagelreactive security problems in V AR planning and in operation
scheduling by dual affine Karmarkar algorithm', Proceedings.of Il PSCC Conference, Vol.
1, pp. ,Avignon, Sept. 1993
[5.10] J.M. Momoh, S.X. Guo, E.c. Ogbuobiri, R. Adapa, "The quadratic interior
point method solving power system optimization problems", IEEE Transactions on PWRS,
Vol. 9, No. 3, pp.1327 -1336, Aug. 1994.
[5.11] S. Mehrotra, "On the implementation of a primal-dual interior-point method",
SIAM Journal on Optimization, Vol. 2, No. 4, pp. 575-601, 1992.
[5.12] S. Granville, 'Optimal reactive dispatch through interior point methods',
IEEE Transactions on PWRS, Vol. 9,.No 1, pp. 136-146, Feb. 1994.

30

[5.13] B. Blanchon, J.c. Dodu, A. Renaud, M. Bouhtou, "Implementation of a

primal-dual interior-point method applied to the planning of reactive power compensation
devices", Proceedings of XII pscc Conference, Dresden, Germany, Aug. 1996.
[5.74] K. Iba. H. Suzuki, K.I. Suzuki, K. Suzuki: "Practical reactive power
allocation/operation planning using successive linear programming", IEEE Transactions
on PWRS,. Vol. 3, No.2, May 1988.
[5.75] O. Alsac, J. Bright, M. Frais, B. Stott: 'Further developments in LP-based
optimal power flow', IEEE Trans. on Power Apparatus and Systems, Vol. 5, No.3 pp. 697711, Aug. 1990.
[5.76] J.L Martinez Ramos, A. Gomez Exposito, V.H. Quintana, 'Reactive power
optimization by interior-point methods: implementation issues', Proceedings of the XII
PSCC, pp. 844-850, Dresden, August 1996.
[5.77] J.R. Bunch, B.N. Parlett, ' Direct methods for solving symmetric indefinite
systems of linear equations " SIAM J. on Numerical Analysis, Vol. 8, pp. 639-655, 1971.
[5.78] E. Rothberg, A. Gupta, 'Efficient sparse matrix factorization on highperformance workstations-exploiting the memory hierarchy " ACM Trans. on
Mathematical Software, Vol.17, N 3, pp. 303-314, September 1991.
[5.79] F.L Alvarado, W.F. Tinney, 'State estimation using augmented blocked
matrices', IEEE Trans. on Power Systems, Vol. 5, N 3, pp. 911-921, August 1990.
[5.80] A. Merlin. P. Martin, 'Mthode de repartition journalire d'un ensemble de
moyens de production thermique-hydraulique', EDF- Bulletin de la direction d'Etudes et
RecherchesSrie B-no 4, pp. 13-32, 1969.
[5.81] T.J. Bertram, K.D. Demaree, Le. Dangelmaier: 'An integrated package for
real-time security enhancement', Proceedings of the IEEE Power Industry Computer
Application Conference, Seattle, 1989, (PICA'89)
[5.82] Proceedings of the Expert Systems Applications to Power Systems (ESAPS),
Symposiums in Stockholm (1987), Seattle (1989), Tokyo (1991) and Melbourne (1993)
[5.83] D. Reichelt, H. Glavitsch: 'Features of a hybrid expert system for security
enhancement',
IEEE Transactions on PWRS, Vol. 7, No. 2, pp. 907-913, May 1992.. .
[5.84] L. A. Zadeh, 'Fuzzy Sets and Applications', John Wiley & Sons, 1987

31

[5.85] H. J. Zimmermann, 'Fuzzy Sets Theory - and its Applications', KluwerNijhoff Publishing, 1990
[5.86] V. Miranda, J. T. Saraiva, 'Fuzzy modelling of power system optimalload
flow', IEEE Transactions on PWRS, Vol. 7, No. 2, pp. 843-849, May 1992
[5.87] J.A. Momoh, X.W. Ma, K. Tomsovic, 'Overviewand literature survey of
fuzzy set theory in power systems', IEEE Transactions on PWRS, Vol. 10, No 3, pp. 16761690, Aug.1995.
[5.88] K. H. Abdul-Rahman, S. M. Shahidehpour, 'Static security in power system
operation with fuzzy realload conditions', IEEE Transactions on PWRS. Vol. 9, No 2, pp.
589-597, May 1994.
[5.89] W. H. Edwin Liu, X. Guan, 'Fuzzy constraint enforcement and control action
curtailment in an optimal power flow' Proceedings ofIEEE/PICA, Salt Lake City, 1995
[5.90] K.H. Abdul-Rahman, S.M. Shahidehpour, 'Application of fuzzy sets to
optimal reactive power planning with security constraints', IEEE Transactions on PWRS,
Vol. 9, No 2, pp. 898905, May 1994.
[5.91] J. Kumar, G.B. Sheble, 'Clamped state solution of artificial neural network
for real time economic dispatch', IEEE Transactions of PWRS, Vol. 10, No 2, pp. 925-931,
May 1995.
[5.92] A. Ravindran, D.T. Phillips, J.J. Solberg: 'Operations Research, Princip les
and Practice', ISBN 0-471-85980, John Wiley, 1987.
[5.93] D. Reichelt, H. Glavitsch, 'A Knowledge-based system for security
enhancement combining AI-techniques and analytical algorithms', Proceedings of the lOth
Power Systems Computation Conference,'Graz, Austria, Aug. 1990.
[5.94] R. Cicoria, P. Migliardi, P. Marannino, 'Knowledge based methodologies
versus conventional optimization algorithms: Applications to the reactive power
compensation', Proceedings of XI PSCC Conference, Avignon, Sept. 1993.
[5.95] D.E. Goldberg: 'Genetic Algorithms in Search', ISBN 0-201-15767-5,
Addison Wesley 1989.
[5.96] K. Iba: 'Reactive Power Optimization by Genetic Algorithm', IEEE
Transactions on PWRS, Vol. 9, No 2, pp.685-692, May 1994.

32

[5.97] Yun-Lin Chen, Chun-Chang Liu, 'Optimal multi-objective Var planning using
an interactive satisfying method', IEEE Transactions of PWRS, Vol. 10, No 2, pp. 664-670,
May 1995.
[5.98] G.B. Sheble, K. Brittig, 'Refined genetic algorithm- economic dispatch
examples', IEEE Transactions ofPWRS, Vol. 10, No l, pp. 117-124, Feb. 1995.
[5.99] P.H Chen, H.c. Chang, 'Large scale economic dispatch by genethic
algorithm', IEEE Transactions of PWRS, Vol. ID, No 4, pp. 1919-1926, Nov. 1995.
[5.100] R.H.J. Ouen, LP.P.P. Van Ginneken, 'The annealing algorithm', Kluwer
Academie Publishers, 1989.
[5.101] Ying-T. Hsiao, Hsiao D. Chiang, Chun-Chang Liu, 'A computer package for
optimal multi-objective V AR planning in large scale power systems', IEEE Transactions
on PWRS, Vol. 9, No 2, pp. 668-676, May 1994.
[5.102] V. Chankong, Y.Y. Haimes, 'Multiobjective decison making: Theory and
methodology' ,North Rolland, New York, 1983.
[5.1,03] A.D. Papalexopoulos, C.F. Imparato and F.F. Wu, 'Large-scale optimal
power flow: Effects of initialization, decoupling and discretization,' IEEE Transactions on
PAS, Vol. PWRS-4, pp. 748-759, May 1989.
[5.104] S.V. Venkatesh, E. Liu, A.D. Papalexopoulos, 'A least squares solution for
optimal power flow sensitivity calculations,' IEEE Transactions on PWRS, Vol. 7, No. 3,
pp.1394-1401, August 1992. .
[5.105] J.A. Momoh, RJ Koessler, M.S. Bond, B. Stott, D. Sun, A. Papalexopoulos,
R. Ristanovic, 'Challenges to optimal power flow', IEEE 96 Winter Meeting, paper 96 WM
312-9 PWRS, Baltimore, Jan. 1996.
[5.106] T. Gomez, I.J. Perez-Arriaga, J. Lumbreras, V.M. Parra, , A security
constrained decomposition approach to optimal reactive power planning' , IEEE
Transactions on Power Systems, vol 6, pp 1069-1076, August 1991.
[5.107] 1.F. Bonnans, ' Asymptotic admissibility of the unit stepsize in exact penalty
methods' , SIAM J. on Control and Optimization, Vol. 27, pp. 631-641, 1989.
[5.108] G. Blanchon, J.C. Dodu, A. Merlin, ' New deve10pments of the reactive
power flow optimization model used at EDF', Proceedings of the VIII PSCC, pp. 426-433,
Helsinki,' August 1984.

33

[5.109] R.D.C. Monteiro, 1. Adler, 'Interior path following prima1-dual algorithms',

Mathematical Programming, N 44, pp. 27-66, 1989.
[6.1] Imhof K., Oesch F., Nordanlycke 1., "Modelling oftap-changer transformers in
an Energy Management System", 1995 IEEE.
[9.1] The IEEE Reliability Test System - IEEE Paper 96 WM 326-9 PWRS.

34

PH LC 1. CC M T TON HC BI TON TI U
HO
4.1. Dng chung ca bi ton
Mt bi ton ti u ho c 3 ni dung c bn: hm mc tiu, cc rng
buc phi tho mn v cc bin.
Trong trng hp chung, c th m t bi ton nh sau:
Cc tiu ho hm f(x,u)

(4.1)

sao cho:
g(x,u) = 0
hmin < h(x,u) < hmax

(4.2)
(4.3)

Trong :
f(x,u)

hm mc tiu

g(x,u)

phng trnh

h(x,u)

rng buc bt phng trnh

vect bin trng thi

vect bin iu khin

hmin

gii hn trn ca rng buc bt phng trnh

hmax

gii hn di ca rng buc bt phng trnh

4.2. Hm mc tiu
C nhiu hm mc tiu khc nhau c th c s dng trong cc bi
ton ti u ho HT.
4.2.1. Cc tiu ho chi ph
Hm mc tiu trong trng hp ny c biu din dng tng chi ph
vn hnh ca tt c cc my pht cng vi chi ph trao i cng sut vi h

35

thng lin kt. Chi ph tn tht trn li thng c k n thng qua h

phng trnh cn bng cng sut li.
Dng chung ca hm mc tiu trong trng hp cc tiu ho chi ph
vn hnh l:
NS

m 1

i 1

f ( x, u ) t m C i ( Pgi ) min (4.4)

tm khong thi gian m;

NS s khong thi gian;
G s my pht;
Ci(Pgi) hm chi ph vn hnh ca my pht th i hoc chi ph cng sut
trao
i vi HT lin kt;
Pgi cng sut tc dng.
Trong bi ton tnh (ch c mt bc thi gian) hm c thu gn li
thnh:
G

f ( x, u ) Ci ( Pgi ) min (4.5)

i 1

Hm chi ph Ci(Pgi) th hin mi ph thuc chi ph vn hnh ca my

pht vo cng sut tc dng ca n. Hm ny trong mc gn ng khc
nhau c th l tuyn tnh, tuyn tnh tng khc, hm bc hai, a thc bc cao
hn... Dng hm c quan h quyt nh n kh nng s dng cc phng
php gii bi ton.
Trong k hiu dng chung ca hm f(x,u) x l vect cc bin trng thi
h thng, u l cc bin iu khin (CSTD ca my pht v CS trao i qua
HT lin kt), mun ni ln s ph thuc phc tp ca HMT vo ch h
thng. S ph thuc ny xc nh bi quan h ca cng cc sut P gi trn HMT
vi s c mt ca chng trong h rng buc v gii hn (4.2) v (4.3) ca bi

36

ton. Trong bi ton phn b ti u cng sut y cc bin iu khin bao

gm c CSTD v CSPK, u nm trong HMT [3.13, 3.24].
Khi gii bi ton ti u ho di hn hm mc tiu cn cha bin cng
sut ca mi t my (chng c th ch tham gia trong nhng khong thi nht
nh, quyt nh bi li gii ti u). Khi cc chi ph khi ng, iu chnh
cng sut v chy khng ti u cn phi a vo.
4.2.2. Cc tiu ho tn tht cng sut tc dng
Bi ton cc tiu ho tn tht CSTD thng c thc hin tip sau bi
ton cc tiu ho chi ph vn hnh hay cng c th hiu l giai on 2 ca bi
ton phn b ti u cng sut y (c CSTD v CSPK). Khi cng sut
tc dng ca tt c cc my pht k c my pht ca nt cn bng u c
coi l hon ton xc nh v ti u theo chi ph vn hnh. Ti u ho cc
bin iu khin ch cn l phn b cng sut phn khng, iu chnh in p.
Trong trng hp ny thc cht tr s ca hm mc tiu chnh l tng
cc tn tht trn mi nhnh ca li tnh theo cng thc chung RI 2. Tuy
nhin, thun tin hn c th s dng cc bin trong cc phng trnh rng
buc (phng trnh trng thi ca li). Ngi ta thng biu din hm mc
tiu theo 2 cch: cc tiu cng sut tng ca nt cn bng hoc cc tiu tng
cng sut cc hai u cc nhnh ca li.
Trng hp th nht hm mc tiu c dng:
f ( x, u ) Px 0 min

(4.6)

Trng hp th hai, hm mc tiu c vit theo cng sut hai u ca

mi nhnh:
f ( x, u ) ( Pij Pji ) min

(4.7)

Tng c ly theo mi nhnh trong vng li quan tm.

4.2.3. Cc i ho d tr cng sut phn khng

37

Ph thuc vo cu trc h thng, vic thc hin cc tiu ho tn tht

CSTD c th lm nh hng n an ton vn hnh (v d mt n nh in
p), bi v cc tiu ho tn tht CSTD c th dn n d tr CSPK mt s
vng b cn kit. trnh nguy c ny cn a vo hm mc tiu cc quan h
m bo d tr CSPK cho mi khu vc (tt c cc my pht).
Hm mc tiu c biu din trong trng hp ny l tng c trng s
d tr CSPK ca tt c cc my pht. Hm c dng sau:
G

f ( x, u ) Wi (Q gi Q gi ) 2 max (4.8)
i 1

Cc h s gia trng trong biu thc c tnh nh sau:

Wi Q gi Q gi

(4.9)

Trong ,
Q gi , Q gi

l cc gii hn trn v gii hn di ca cng sut phn

khng pht ca cc my pht.

C th thy h s gia trng t l nghch vi rng vng iu chnh ca
CSPK ca mi my pht.
4.2.4. Cc i ho cng sut truyn ti
Do nhng l do khc nhau (nht l trong trng hp qun l li in
theo c ch th trng mua bn in) cn phi cc i ho CSTD truyn ti
trn nhng phn li quan tm. Trong trng hp ny hm mc tiu c th
biu din theo mt s dng ph thuc vo cu trc li. C 3 trng hp cn
phn bit (hnh 4.1).
a) Trng hp truyn ti gia 2 nt (point-to-point).
Hm mc tiu c th chn l cng sut ngun Pg hoc tng cng sut
ti PL. Trong trng hp chung hn PL c th gm ti c cc nt trung gian
trong li (nt 2,3,4).

38

b) Trng hp truyn ti gia 2 nt, c li song song cng c yu ti

cc i.
Hm mc tiu cng ging nh trng hp trn nhng cn thm rng
buc v quan h phn ti vi li sng song. Trng hp ring n gin nht
khi ti trn li xt lm vic c lp vi li song song. Khi khng cn c
rng buc no b sung.
c) Trng hp c nhiu mch truyn ti ni lin kt hai li phc tp.
Hm mc tiu trong trng hp ny c th biu din l tng cng sut
tc dng truyn ti i qua mt ct A-A no tch ring hai phn li. Ta c:
N

f ( x, u ) Pi max (4.10)
i 1

Trong trng hp ny rng buc v gii hn in p cc nt cn phi

c xt n.
Mt vn ang c quan tm nghin cu hin nay lin quan n cc
i ho CSTD truyn ti l kh nng iu khin thay i mm do thng
s ca h thng truyn ti. Vic pht trin cc thit b FACTS (flexible AC
transmission systems) gn y trong li truyn ti cho php thc hin cc
thut ton iu khin nhm cc i ho CSTD truyn ti. Nhiu cng trnh
bt u nghin cu cc thut ton ny [4.3, 4.7]. Tuy nhin vic iu khin
cc thit b FACTS vt ra khi phm vi cc i ho CSTD truyn ti. Nhiu
mc tiu khc c ngha quan trng hn.
Trong trng hp n gin nht FACTS c t v iu khin nhm
nng cao kh nng truyn ti cho cc li ang tn ti. Vn l ch, s
pht trin t nhin ca cc li truyn ti (trong tin trnh tng trng ph ti)
lun dn n (sau mt thi gian) trng thi phn b cng sut khng ti u
theo truyn ti gii hn ca cc mch. Hm mc tiu trong trng hp ny

39

cn cha cc yu t iu khin ca FACTS nh thc hin trong [4.3] v

[4.7].

1
5

PL
4

a)

Li song
song
2

1
5

PL
4

b)

Li I

P1

P2

PN

Li II

c)
Hnh 4.1

40

4.2.5. Cc tiu ho nhim mi trng

C nhng i lng khc nhau biu th nh hng nhim mi trng,
v d khi lng kh thi (SO 2) t cc NMN, tng nhit nc sng do
hot ng ca h thng nc tun hon lm mt cc bnh ngng. Hn ch cc
i i lng ny c th thc hin trong rng buc nhng cng c th a vo
hm mc tiu theo ngha cc tiu ho (s c li hn trong nhiu trng hp).
Hm mc tiu trong trng hp ny c dng:
G

f ( x, u ) Ei ( Pgi ) min (4.11)

i 1

Trong Ei l hm biu din quan h gia i lng nhim vi cng sut

t my. Quan h ny thng c dng phi tuyn, xc nh bng thc nghim v
biu din gn ng theo a thc.

41

Phn th hai
PHT TRIN NG DNG PHNG PHP
XP X HO M HNH TI U PHI TUYN
(Thut ton v chng trnh tm li gii ti u ton cc xp x ca bi
ton quy hoch phi tuyn, ng dng trong H Thng in)

42

Chng I. NHNG VN CHUNG LIN QUAN N NG

DNG QUY HOCH TON HC
1.1. M HNH TUYN TNH V M HNH PHI TUYN

Phn mt tng quan v nhng ng dng cc phng php ti u ho

trong cc bi ton nng lng. C th thy ni ln hai ni dung c bn l: m
t ton hc cc i tng cn c ti u ho v xc nh li gii ti u cho
bi ton t ra nhm hng i tng theo mc tiu mong mun.
M t ton hc i tng v tm li gii bi ton l nhng ni dng
khc bit nhau nhng khi thc hin trn mt i tng c th li c mi lin
quan rt mt thit vi nhau. Tht vy, i tng c m t ton hc rt y
chnh xc di dng bi ton quy hoch ton hc nhng khi bi ton li
c th khng gii c (hoc nhn c li gii mt cch kh khn, km tin
cy) th m hnh khng th a vo ng dng. Ngc li, n gin ho m
hnh hoc b bt cc iu kin gii hn nhn c li gii li c th dn
n kt qu c sai s nhiu hoc nm ngoi cc iu kin c t thc thi th m
hnh cng khng cn ngha ng dng. Vic la chn m hnh phi hp vi
cc thut ton gii lun lun l vn ca l thuyt iu khin ti u ng
dng trong nhng lnh vc c th.
i vi lnh vc in nng c rt nhiu th nghim ng dng l
thuyt ti u ho : mong mun cui cng l xy dng c nhng m hnh
bi ton ph hp vi i tng thc t v c th nhn c li gii ti u
lm c s cho cng tc quy hoch thit k v vn hnh.
1.1.1. M hnh tuyn tnh (QHTT)
M hnh quy hoch tuyn tnh (nguyn, thc v nguyn thc hn hp)
lun c cc ng dng hng ti bi s tn ti cc thut ton gii chung.
Nu li gii ca bi ton tn ti th ni chung c th tm c li gii ti u
ton cc. l mt u im ni bt bi mi lnh vc ng dng u mong

43

mun c c mt phng n chc chn ti u so snh v p dng. Ngoi

ra, m hnh QHTT cho php m t khng hn ch cc rng buc dng bt
phng trnh, cng l mt th mnh xt n cc gii hn hay phm vi
thay i kh dng ca cc i lng cn la chn ti u. Nhc im rt r
rng ca m hnh chnh l s gii hn m t trong cc quan h tuyn tnh,
iu m cc i tng thc t khng phi bao gi cng tho mn. Cc bi
ton v nng lng cng khng phi l ngoi l.
c tnh tiu hao nng lng s cp cc t my ca nh in c th ly
lm v d : s tn ti cc phm vi vn hnh theo cc hiu sut khc nhau phn
nh tnh phi tuyn kh r nt ca cc c tnh (hnh 1.1). Xt vi cc c tnh
ng tr (ton nh my) ng cong cn c th c dng nhy bc hay gin
on tng khc do c cc phm vi cm vn hnh, ng thm cc thnh phn
trang thit b. Chi ph c nh rt thng gp trong cc quan h c tnh kinh
t (vn u t vi cng sut, chi ph tiu hao khng ti ...) cng l mt yu t
phi tuyn (bi c tnh khng i qua gc). Trong trng hp ny cn thng
phi chp nhn c im ri rc ti gc to , tng ng vi phng n
"khng" (khng vn hnh hoc khng u t th chi ph bng khng). c
tnh tn tht cng sut trn li truyn ti c dng phi tuyn gn vi bc hai
cng thng gy phc tp ng k cho hu ht cc bi ton h thng.
D thy rng QHTT c rt nhiu u im nhng cha phi l p
dng cho cc bi ton v nng lng.
1.1.2. M hnh quy hoch phi tuyn (QHPT)
C th ni ngay l v phng din m t i tng th QHPT c kh
nng rng ri hn nhiu so vi QHTT, ph hp c vi hu ht cc bi ton
(tnh v tin nh). QHPT bao hm QHTT nh mt trng hp ring. Vn
l cha c cc thut ton hiu qu gii cc dng khc nhau ca bi ton,
c bit cc dng quan h hm phi tuyn gin on, c cha cc im ri rc.

44

Ngoi ra cc rng buc dng bt phng trnh cn l yu t kh khn khng

khc phc c ca rt nhiu thut ton gii QHPT. Ngoi lp cc bi ton
dng ring (nh quy hoch li, quy hoch DC ... ) hin nay cha c nhng
thut ton tin cy tm li gii ti u ton cc cho mt dng bt k ca
QHPT.
Nh vy QHPT c kh khn ch yu trong phng php gii, nht l
xt n tnh phc tp a dng ca cc bi ton trong lnh vc nng lng.
1.2. C IM LI GII CA QUY HOCH TUYN TNH

1.2.1. M t ton hc ca QHTT

Dng chung ca QHTT vi cc bin nguyn v thc hn hp c th m
t nh sau:
p

Hm mc tiu:

c x d

Cc rng buc:

i 1

i 1

j 1

y j min (max)

(1-1)

ik

xi b jk y j g k
j 1

xi 0;

; (1-2)

i 1,2,..., p;

p+q = n ; k = 1,2, ..., m.

Trong :
x1, x2,...,xp - cc bin thc, nhn cc gi tr dng;
y1,y2,..., yq - cc bin nguyn, trng hp ring ph bin ch nhn cc
gi tr 0 v 1 (bin nh phn).
n - s bin tng cng (nguyn, thc); m - s rng buc.
Nu q = 0 bi ton c dng QHTT bin thc thng thng, cn p = 0 l
bi ton quy hoch nguyn. Bi ton QHTT nguyn thc hn hp thng
c xt vi bin nguyn nh phn.
D thy rng li gii ca QHTT nguyn thc hn hp tng ng vi
so snh li gii ca mt t hp cc bi ton QHTT bin thc (cho trc cc
bin nguyn). Do xt c im li gii ca QHTT ta ch cn quan tm

45

n bi ton bin thc thng thng. Hn na ch cn xt cho dng chun

hoc dng chnh tc ca bi ton bi mi dng chung lun lun c th a
c v dng chun hoc dng chnh tc.
Dng chun

c x
i 1

Dng chnh tc

c x

min ;

i i

i 1

i i

min ;

aik xi g k ; k 1,2,..., m ;

xi 0;

xi 0;

i 1

i 1

i 1,2,..., n ;

ik

xi g k ;

k 1,2,..., m ;

i 1,2,..., n ;

Dng chun v chnh tc hon ton tng ng nhau bi mi rng

buc phng trnh:
p

a
i 1

ik

xi g k ;

c th m t tng ng bng hai bt phng trnh:

p

aik xi g k ;
i 1

a
i 1

x gk ;

ik i

Ngc li, mi rng buc bt phng trnh cng c th a v dng

phng trnh bng cch t thm mt bin ph, v d xn+1 :
p

a
i 1

ik

xi x n 1 g k ;

Nh vy, khi rng buc l hn hp lun c th bin i a bi ton

v mt trong hai dng trn.
1.2.2. Li gii cho php v li gii ti u ca QHTT
Tip theo ta xt c im li gii ca bi ton xut pht t dng chnh
tc.

46

c x
i 1

a
i 1

ik

min ;

xi g k ; k 1,2,..., m ;

xi 0;

(1.3)

i 1,2,..., n ;

Vi dng chnh tc, s rng buc cn xt l m < n ( bi ton khng

mu thun). Khi n = m bi ton vn c th c nghim nhng l trng hp
tm thng, bi nghim tn ti l duy nht khng c la chn. Khi n-m = k ta
c k bin t do la chn. Trong mc ny, thun li cho minh ho hnh
hc v khng lm gim tnh tng qut ta xt trng hp k = 2. H rng buc
c dng :
a11 x1 a12 x 2 ... a1n x n g 1 ;
a 21 x1 a 22 x 2 ... a 2 n x n g 2 ;
a m1 x1 a m 2 x 2 ... a mn x n g m ;

(1-4)

xi 0 ; i 1,2,..., n ;

Gi s chn cc bin x1 v x2 lm bin t do, ta c th xc nh cc bin

cn li theo ch hai bin ny. Tht vy, nu coi x1 v x2 nh bit, chuyn s
hng ca cc bin ny sang v phi (1-4) s gm m phng trnh, m n s.
Gii ra ta s nhn c biu thc ca cc bin x 3, x4, ..., xn. Sau khi rt gn ta
c cc biu thc dng sau:

x3 31 x1 32 x 2 3 ;
x 4 41 x1 42 x 2 4 ;
. . . . . .
x n n1 x1 n 2 x 2 n1 ;

(1-5)

47

V cc bin thc ch c nhn cc gi tr dng nn ta c h bt

phng trnh sau:
x1 0 ;
x2 0 ;
x3 31 x1 32 x 2 3 0 ;
x 4 41 x1 42 x 2 4 0 ;

(1-6)

....
x n n1 x1 n 2 x 2 n1 0 ;

H (1-6) tng ng vi (1-4) nhng c xc nh trn mt phng

ca cc bin t do (x1,x2). Mi bt phng trnh gii hn mt na mt phng
khng cho php nhn li gii ca cc bin x1 v x2 , phn chia bng cc ng
thng, tng ng vi cc phng trnh sau:
x1 0 ;
x2 0 ;

31 x1 32 x 2 3 0 ;
41 x1 42 x 2 4 0 ;
....
n1 x1 n 2 x 2 n1 0 ;

x2

x4= 0

x2opt
x1= 0

x3= 0

LG
x1opt
x2= 0

x1

Hnh 1-2

Trn hnh v ta gi thit na mt phng pha b gch cho ca ng

thng l khng cho php. Ph thuc vo h s ca cc phng trnh xc nh
cc ng thng c th tn ti (hoc khng) mt min gi tr cho php tho

48

mn mi rng buc (hnh 1-2), cn c gi l min li gii cho php. R

rng mt im nm trong min ny s xc nh gi tr ca x 1, x2 v theo (1-4)
cho tt c cc bin tho mn mi rng buc. chnh l min xc nh cc
nghim tho mn mi rng buc nhng khng nht thit ti u ca bi ton.
By gi nu cc bin trong hm mc tiu cng c biu din theo x 1
v x2 bng cch s dng (1-5) ta s nhn c biu thc dng:
Z 0 1 x1 2 x2

Cho Z mt tr s L no th trn mt phng x 1Ox2 ng thng c

phng trnh:
0 1 x1 2 x 2 L

biu th tp hp cc im c cng gi tr hm mc tiu l L (cn gi l

ng mc). Gi thit khi gim tr s L ng mc chuyn ng theo hng
mi tn trn hnh v (hng chuyn ng xc nh bi du ca 1 v 2).
nghing ca ng mc khng thay i bi n ch ph thuc t s 1/2. Mi
im nm trn on ng mc trong min li gii cho php LG s xc
nh mt nghim chp nhn c vi gi tr hm mc tiu l L. Nh vy theo
hnh (1-2) nghim ti u ca bi ton s phi tng ng vi im B, im cho
gi tr hm mc tiu b nht (ng mc chuyn ng n v tr cui cng
cn c im thuc min LG. Sau khi xc nh c x 1opt v x2opt c th tm
mi gi tr bin ti u khc da vo (1-5).
Mc ch ca mc ny l nhn xt v a ra cc c im li gii ca
QHTT. Ta c cc kt lun sau.
Li gii ti u nu tn ti khng nm bn trong min li gii cho php
m lun nm trn gii hn ca min (nh hoc cnh). Cng cn ch
khng nhm vi gi tr gii hn ca cc bin. Trong v d trn hnh 1-2, im
B thuc mt nh ca bin gii min LG, cn x 1opt, x2opt v tr trung gian trn
cc cnh.

49

Li gii ti u c th khng phi l duy nht. l trng hp khi

ng mc ca hm mc tiu trng vi cnh ca a gic li gii khi t ti
gi tr cc tiu.
Nu min li gii cho php khng gii ni theo hng gim ca hm
mc tiu (ng vi bi ton tm cc tiu) th bi ton khng c li gii ti u
mc d vn c li gii chp nhn c.
Li gii ti u lun thuc v mt nh ca a gic li gii. Trong trng
hp nghim ti u nm trn mt cnh (a nghim) th cc nh ca cnh ny
cng l nghim ti u v c cng gi tr hm mc tiu. Nh vy nghim ti
u ca QHTT chc chn s tm c nu so snh tr s hm mc tiu ti tt c
cc nh ca a gic li gii (sau mt s hu hn bc). Li gii ti u nhn
c l li gii ti u ton cc.
Trong li gii ti u lun c cha t nht k ga tr bin bng 0 vi k l
s bin t do: k = n-m. Trong khng gian 2 chiu (v d trn) a gic li gii
l mt phng th mi nh phi c t nht 2 cnh gii hn i qua (x3 = 0 v x4 =
0 i qua im B). Cng c th c thm ng gii hn khc i qua im ny.
Cc kt lun trn u ng cho trng hp chung khi k > 2.
1.2.3. Gii bi ton QHTT bng phng php n hnh
Vic nghin cu cc c im li gii ca QHTT rt c ngha trong
vic ng dng v pht trin cc thut ton gii cc bi ton ti u ho. Thc
cht ca phng php n hnh, c a ra ln u tin (bi D. Dantzig,
nm 1949) l h qu trc tip ca vic phn tch cc c trng ca li gii.
Theo thut ton ny li gii ti u c tm bng cch i t nh ny qua nh
khc ca a gic li gii theo hng gim dn gi tr HMT. Khi khng cn
hng gim c gi tr HMT (sau mt s hu hn bc) th nh ang ng
chnh l nh cha nghim ti u ca bi ton.

50

Phng php n hnh cha phi l thut ton hiu qu nht bi c th

phi i qua chng ng di (thm ch phi qua mi nh). Tuy nhin, l
mt thut ton n gin v in hnh. Hy xt k hn mt cht v thut ton
ny.
Vn ly bi ton dng (1-3) nhng vi gi thit n>m v k = n-m tu .
Chn cc bin t x1 n xm lm c s. Cc bin t xm+1 n xn lm bin t do.
Xut pht t (1-4) ta xc nh v biu din c cc bin c s theo
cc bin t do. Tng t nh (1-5) ta c :
x1 '1, m 1 x m 1 '1, m 2 x m 2 ... '1, S x S ... '1, n x n '1 ;
x 2 ' 2, m 1 x m 1 ' 2 , m 2 x m 2 ... ' 2 , S x S ... ' 2 , n x n ' 2 ;
. . . . . .
x r ' r , m 1 x m 1 ' r , m 2 x m 2 ... ' r , S x S ... ' r , n x n ' r ;
. . . . . .
x m ' m , m 1 x m 1 ' m , m 2 x m 2 ... ' m , S x S ... ' m , n x n ' m ;

thun li cho cc php bin i ta vit li h dng sau :

x1 1, m 1 x m 1 1, m 2 x m 2 ... 1, S x S ... 1, n x n 1 ;
x 2 2, m 1 x m 1 2 , m 2 x m 2 ... 2 , S x S ... 2, n x n 2 ;
. . . . . .
x r r , m 1 x m 1 r , m 2 x m 2 ... r , S x S ... r , n x n r ;

(1-7)

. . . . . .
x m m , m 1 x m 1 m , m 2 x m 2 ... m , S x S ... m , n x n m ;

Hm mc tiu c vit theo cc bin t do v c th a v dng sau:

Z 0 ( m 1 x m 1 m 2 x m 2 .. S x S ... n x n )

(1-8)

Gi thit nhn c cc tr s i trong (1-7) u dng. Khi chc

chn s tn ti min li gii cho php, t nht l im gc to , tng ng
vi cc bin t do u nhn gi tr 0, cn cc bin c s xc nh theo (1-7):
xi = i ; i = 1, 2, ... , m. Vi nghim cho php ny gi tr hm mc tiu, theo

51

(1-8), s l Z = 0 . Hy tm cch gim thm gi tr HMT bng cch thay i

gi tr cc bin t do (thnh khc khng). Cc bin u phi dng nn HMT
ch gim c khi c t nht mt gi tr no dng, v d S . Khi tng
xS HMT s gim dn. Khi c nhiu h s dng c th chn bt k hoc
chn c tr s ln nht.
Khi xS tng cc bin c s s thay i tr s, v th gii hn tng x S ph
thuc iu kin m bo cc bin c s khng tr thnh m. T (1-7) ta c
cc iu kin:

x1 1 1S x S 0 ;
x2 2 2 S x S 0 ;
. . . .
x r r rS x S 0 ;

(1-9)

. . . .
x m m mS x S 0 ;

Nu tt cc cc h s u m th xS c th tng v hn. Khi bi

ton v nghim v hm mc tiu c th gim n - . Trong trng hp
ngc li xS ch c th tng n tr s gii hn:
xS

r
min i ;
rS
is

y ta gi thit bt phng trnh ng vi bin c s x r cho gii hn xS

nh nht. Khi tng n tr s ny th x r = 0 (nu tng na n s l bin nhn
gi tr m u tin).
D thy, thc cht ca qu trnh bin i trn l mt bc i t nh gc
ca min li gii cho php n mt nh mi c HMT nh hn. nh mi
nm trn cnh ng vi phng trnh xr = 0. By gi nu coi xr l bin t do,
i cho bin xS tr thnh bin c s th trong khng gian cc bin t do nh
mi li tr thnh nh gc (v gi tr tt c cc bin t do u bng 0), tr li

52

trng thi nh ban u nhng c gi tr HMT nh hn. Qu trnh c th tin

hnh lp li tip tc gim HMT cho n khi kt thc: nh gc c gi tr
HMT nh nht.
mi bc bin i cn thc hin nhng tnh ton thit lp li h
rng buc (1-7) v biu din HMT (1-8). chnh l cng vic ch yu ca
qu trnh tm li gii ti u ca QHTT theo phng php n hnh. Ngoi ra,
cn c nhng bc tnh ton ph nhng rt quan trng khc nh a bi ton
v dng chnh tc, xc nh cc bin c s v t do ban u c li gii xut
pht...
Php chuyn i h c s
Trong h c c phng trnh ca bin xr :
x r r , m 1 x m 1 r , m 2 x m 2 ... r , S x S ... r , n x n r ;

cn i li vit cho bin xS . Bng cch chia hai v phng trnh cho h
s ca xS , chuyn v ta nhn c biu thc ca n:
xS

r ,m 1
r ,m 2
r ,n
1
1
x m 1
x m 2 ...
x r ...
xn
r ;
r ,S
r ,S
r ,S
r ,S
r ,S

Xp xp li ta c:
xS

r , m 1
r ,m 2
r ,n
1
1
x m 1
x m 2 ...
x r ...
xn
r ;
r ,S
r ,S
r ,S
r ,S
r ,S

(1-10)

V phi ca cc phng trnh cn li cn c vit theo bin x r (bin t

do) v khng cha bin xS (bin c s). Mun vy cn thay xS bng biu thc
ca n v nhm li. Ta c :
xi ( i , m 1
... ( in

iS r , m 1

) x m 1 ( i , m 2 iS r , m 2 ) x m 2 ...(0 iS ) x r ...
r ,S
r ,S
r ,S
iS r , n

) x n ( i iS r ) ; i 1,2,...m; i r .
r ,S
r ,S

(1-

11)

53

Thay biu thc xS vo hm mc tiu ta cng c:

Z ( 0 S

r
) ( m 1 S r ,m 1 ) x m 1 ( m 2 S r ,m 2 ) x m 2 ...
r ,S
r ,S
r ,S
r ,n
1
) x r ... ( n S
) xn .
r ,S
r ,S

. . . (0 S

(1-12)

Nh vy (1-10), (1-11) v (1-12) li c dng c s nh (1-7) v (1-8)

thc hin php bin i tip theo.
Nu s dng ch s (k) k hiu cho cc h s bc th k, v (k+1) cho
bc tip theo, ta c th vit quy tc bin i chung nh sau.
Vi cc hng th i r :

( k 1)
ij

( k 1)
j

(k )
ij

(k )
j

(k )
iS

(k )
S

rj( k )
;
rS( k )

rj( k )
;
rS( k )

i( k 1) i( k ) r( k )
0( k 1) 0( k ) S( k )

iS( k )
;
rS( k )

r( k )
;
rS( k )

Vi hng r :

( k 1)
Sj

rj( k )
r( k )
( k 1)
(k ) ; S (k ) ;
rS
rS

C th nhn thy rng php bin i ph thuc vo phn t c chn

hng th r v ct s. Ct s c chn theo h s dng ln nht ca HMT cn
hng r chn theo gii hn nh nht c th tng ca bin x S. Khi v nghim
hoc n nghim ti u th khng cn chn c phn t ny na.
Chuyn h rng buc v dng chnh tc v dng c s ban u
Rng buc dng bt phng trnh
V d c h sau:

54

Z c0 c1 x1 c 2 x 2 c3 x3 min ;
a11 x1 a12 x 2 a13 x3 b1 ;
a 21 x1 a 22 x 2 a 23 x3 b2 ;
a31 x1 a32 x 2 a 33 x3 b3 .

Nh nu trn, a cc rng buc v phng trnh cn a thm

vo mi phng trnh mt bin ph. Ta c :
Z c 0 (c1 x1 c 2 x 2 c3 x3 )
0 ( 1 x1 2 x 2 3 x3 ) min ;
a11 x1 a12 x 2 a13 x3 x 4 b1 ;
a 21 x1 a 22 x 2 a 23 x3 x5 b2 ;
a31 x1 a32 x 2 a33 x3 x6 b3 .

Ta nhn c ngay dng chnh tc v dng c s ca bi ton. Sau khi

gii nu c li gii ti u cc bin ph vn c gi tr xc nh, nhng khng
c ngha ng dng.
H rng buc dng bt phng trnh v dng phng trnh
Trong trng hp ny h rng buc tho mn l cc phng trnh
(dng chnh tc) c th a vo mi phng trnh mt bin ph vi du m.
Tuy nhin khi rt kh bin i c v dng c s. Kh khn cng tng
t vi dng phng trnh.
c dng c s (mi phng trnh c mt bin vi h s +1 ngi ta
a thm vo thm na cc bin nhn to. Cc bin nhn to a vo mi
phng trnh vi h s +1. Cc bin nhn to s lm sai lch rng buc nu n
c gi tr khc 0. Do cn a n vo hm mc tiu vi h s dng tht
ln. Khi kt qu trong li gii ti u cc bin ny s bng 0.
V d bi ton quy hoch pht trin 3 ngun ti u cung cp cho
ph ti Pt vi nhu cu in nng mi nm l Et.
Hm mc tiu:
Z tc (V1 P1 V2 P2 V3 P3 ) g 1Tmax 1 P1 g 2Tmax 2 P2 g 3Tmax 3 P3 ) min ;

Cc rng buc:

55

P1 P2 P3 Pt
Tmax 1 P1 Tmax 2 P2 Tmax 3 P3 E t ; ;
P1 a1 ;
P2 a 2 ;
P3 a3 ;

Chuyn v dng c s ban u ta s dng cc bin ph x 1, x4, x5,x6 v 2

bin nhn to x2 v x3. Cc h s M trong hm mc tiu c th chn s dng
tu ln nhn c trong kt qu x2=0 v x3 = 0.
P1 P2 P3 x1 x 2 Pt
Tmax 1 P1 Tmax 2 P2 Tmax 3 P3 x3 E t ; ;
P1 x 4 a1 ;
P2 x5 a 2 ;
P3 x 6 a 3 ;

Z tc (V1 P1 V2 P2 V3 P3 ) g1Tmax 1 P1 g 2Tmax 2 P2 g 3Tmax 3 P3 Mx 2 Mx3 min ;

Nh vy ta c th nhn c ngay h c s ban u cho qu trnh thc

hin thut ton. Cc bin c s bc ny l: x 2, x3, x4, x5, x6. Cc bin t do
l P1, P2, P3, v x1.
Phng php n hnh va nu l phng n n gin nht cho php
tm c li gii ti u (ton cc) ca bi ton QHTT sau mt s hu hn
bc tnh. Tuy nhin cha phi l phng php hiu qu nht bi khi lng
tnh ton c th rt ln.
Nhm gim bt thi gian tnh ton ngi ta nghin cu nhng thut
ton hiu qu khc nh phng php n hnh ci tin, phng php i ngu
... v xy dng nhng chng trnh my tnh chuyn dng gii bi ton
QHTT dng chung vi kh nng rt ln.
1.2.4. Quy hoch tuyn tnh nguyn thc hn hp
V nguyn tc bi ton QHTT nguyn thc hn hp c th chuyn v
gii theo thut ton QHTT bin thc bng cch t hp cc tnh hung bin
nguyn nh nhng tham s hu hn. Nhng ng dng n gin (t bin

56

nguyn) i khi p dng kh hiu qu phng php ny. Ni khc i v

nguyn tc lun c th tm c li gii ca bi ton QHTT nguyn thc hn
hp (nu tn ti). Tuy nhin, khi s bin nguyn ln cch gii n gin trn
chim thi gian rt ng k. Ngi ta nghin cu rt nhiu thut ton khc
nhau gii hiu qu hn bi ton ny, nht l khi bi ton ch gm cc bin
nguyn nh phn. C th n cc thut ton da trn c s phng php
nhnh v cn, thut ton ct Gomory, phng php hp nht ho trong bi
ton ci ti, thut ton Balas trong bi ton quy hoch nguyn nh phn, cc
phng php gn ng...
Trong ti ny cn thit phi quan tm n cc phng php v
chng trnh tnh ton cho php gii c cc bi ton QHTT nguyn thc
hn hp vi kch c ln.
1.3. KH NNG GII BI TON QHTT BNG CC CHNG TRNH
MY TNH

Cng vi qu trnh pht trin hon thin cc thut ton gii, cc chng
trnh my tnh gii bi ton QHTT dng chung c xy dng v ng dng
kh rng ri. Thng thng cc chng trnh c xy dng cho bi ton quy
hoch tuyn tnh nguyn thc hn hp vi dng vit tu .
C th k ra mt s chng trnh nh th:
- Chng trnh XA ca hng Sunset Computer Inc. M, cp bn quyn
cho Asian Institute Technology (AIT) nm 1990, chng trnh ny c th gii
c bi ton c s bin n 5000 v s rng buc n 1000.
- Chng trnh LP_SOLVE, c vit bng ngn ng lp trnh C, dng
phng php gii l nhnh cn. Chng trnh c s bin v s rng buc gn
nh khng hn ch ch ph thuc vo b nh ca my tnh.
- Chng trnh LINDO chy trong mi trng DOS, LINGO chy trong
mi trng Ms. Windows ca hng Lindo System M, cp bn quyn cho

57

AIT. Chng trnh ny c th gii cc bi ton c s bin l 32000 v s rng

buc 100000. Chng trnh s dng phng php nhnh v cn c kt hp
vi thut ton ct Gomory.
- Chng trnh OSL ca hng IBM, cng s dng thut ton nhnh v
cn vi s bin v s rng buc c m t l khng hn ch.
Vi s pht trin vt bc v k thut my tnh, vi s hon thin ca
cc phng php gii, c th khng nh nhng u im ni tri v trin vng
ng dng ca QHTT. ng quan tm c bit l kh nng m t nhng bi
ton c kch c rt ln, trong khi thi gian tnh ton c th chp nhn c v
ngy cng c ci thin theo tc ngy cng tng cao ca cc my tnh th
h mi. cng l tin cho mt hng nghin cu mi trong ti l
chuyn i xp x cc bi ton QHPT thnh QHTT nguyn thc hn hp.
1.4. DNG CNG TNH CA BI TON QUY HOCH PHI TUYN

Khc vi QHTT bi ton QHPT c m t ht sc a dng. Cn phn lp

cc dng bi ton mi c th a ra c phng php gii chung. ti
nghin cu ny quan tm n mt lp rt rng cc m t ton hc ca bi ton
QHPT, tuy nhin v mt phng php c gii hn thc hin i vi cc m
hnh QHPT dng cng tnh. c im bi ton nh sau:
Hm mc tiu:
n

Z ( x1 , x 2 ,..., x n ) f i ( xi ) min(max) ;
i 1

Cc rng buc:
n

j 1

ij

(x j )

( , , ) ci ;

a j x j bj ;

i 1,2,..., m ;

j 1,2,..., n ;

Trong m hnh trn, HMT v cc rng buc c biu din di dng

tng ca cc hm mt bin. Cc hm v c dng phi tuyn bt k, c th
bao gm cc quan h hm gii tch tng khc (biu din gii tch c th khc

58

nhau), c cha cc im ri rc. C th m t dng chung nht cho php ca

mi hm v nh trn hnh v 1-3.

fi

(xi)
v

(xi)

(xi)

(xi)

u1 a 1

a2 a3

a4 u2 a5

a6

xi

Hnh 1-3

Cc hm cn n tr theo bin ca n, do cc gi tr ri rc (u 1, u2)

phi nm ngoi cc on lin tc ca hm. S on biu din v s im ri
rc khng hn ch. Hm trn hnh 1-3 c th m t ton hc nh sau:

khi xi u1 0 ;
0
( x ) khi a x a ;
1
i
2
i

( xi ) khi a2 xi a3 ;

f i ( xi )

( xi ) khi a3 xi a4 ;
v
khi xi u 2 ;

( xi ) khi a1 xi a2 ;

59

C th nhn thy m t trn bao hm mt lp rt rng cc bi ton bi

v a s cc bi ton c hm mc tiu l tng chi ph ca cc thnh phn. Cc
rng buc dng trn cng bao hm hu ht cc m t h thng (tuyn tnh, phi
tuyn).
Khi trong m t c cha cc quan h dng tch ca 2 hay nhiu bin, v
nguyn tc lun c th a v dng tng. Chng hn c hm:
( x, y ) axy .

Ta c th a thm vo mt bin mi z vi rng buc z =x+y ; Khi :

z 2 x 2 2 xy y 2 ;

suy ra:

axy 0,5az 2 0,5ax 2 0,5ay 2 .

Nh vy hm li c dng: ( x, y ) 1 ( z ) 2 ( x) 3 ( y ) .
C th p dng lin tip cch bin i trn cho nhng quan h phc tp
hn. Tuy nhin gp nhng trng hp nh va nu phi thc hin nhng
php bin i trc, khng p dng c trc tip phng php thc hin
trong ti.

Chng 2. TM LI GII TI U TON CC XP X CA

BI TON QUY HOCH PHI TUYN
2.1. GII XP X BI TON QHPT THEO M HNH QHTT NGUYN
THC HN HP

2.1.1. tng c bn ca phng php

Quy hoch tuyn tnh c nhng hn ch trong kh nng m t cc ti
tng nhng li c nhng u im ni bt trong kh nng nhn li gii:
Tn ti phng php chung tin cy c th nhn c li gii ti
u (nu c) ca bi ton dng tng qut.

60

Li gii nhn c l ti u ton cc (hay l mt trong nhng li gii

ti u ton cc c cng gi tr hm mc tiu - khi c nhiu li gii).
Ngc li QHPT cho php m t c hu ht cc i tng thc t
nhng li khng c c mt phn cc u im k trn. cng l l do
ngi ta t vn m t xp x bi ton QHPT theo m hnh QHTT tm
li gii. C s ca phng php l ch, lun c th biu din xp x mt
ng cong phi tuyn bt k vi mt ng cong gp khc (tuyn tnh tng
khc) vi cc im chia on nm trn ng cong phi tuyn. Khi chn s
im chia tng ln th c th khng ch sai s gia hai ng cong nh theo
mong mun.
(x)
(x )
(x11)

x1

Hnh 2-1

Vn m t tng ng xp x bi ton QPHT theo QHTT c

nhiu tc gi xut t nhng nnm 70 ca th k trc, v d trong cng
trnh ca A.Khaufmann [ 2-1 ] trnh by cch m t xp x bi ton cho
trng hp hm phi tuyn lin tc trn mt min cho trc (xem mc tip
sau).
Thc cht, vic tm li gii ti u ca bi ton quy hoch l s la chn
gi tr b nht (hay ln nht) ca hm mc tiu khi cho gi tr ca tt c cc
bin thay i trong nhng phm vi c th ca n, tho mn cc rng buc. V
th, hai bi ton s l tng ng nhau nu m bo c cc iu kin sau:

61

C s tng ng mt-mt mi gi tr ca hm mc tiu gia hai bi

ton;
Khi cho thay i cc bin mi (trong m hnh QHTT) theo mi gi tr
c th ca n tho mn cc rng buc th cc bin c (trong m hnh QHPT)
cng thay i nhn mi gi tr c th ca n trong HMT v cc rng buc.
D thy, iu kin th nht lun c m bo do cch biu din xp x
hm nu trn. Mi khong gi tr xc nh (cn gi l min xc nh) ca hai
ng cong (ng cong phi tuyn ban u v ng gp khc xp x) u
nh nhau, do mi im trn min xc nh, tng ng ch c mt gi tr
trn mi ng cong (hnh 2-1).
m bo iu kin th hai cn thit lp mi quan h gia cc bin
mi vi cc bin c v s dng thm cc rng buc. C nhng cch khc
nhau m bo iu kin ny v cho cng mt kt qu. Do thng chn
nhng cch biu din c ngha vn nng v c khi lng tnh ton t.
Biu din tng ng xp x cc hm phi tuyn trong m hnh QHPT
Hm phi tuyn lin tc trn mt min xc nh
Trc khi a ra quy tc chung ta hy xt mt m hnh phi tuyn n
gin (ly theo ti liu [2-1]). Hm mc tiu:
f ( x1 , x 2 ) sin(

x1 1 3
) x 2 min ,
2
2

vi rng buc : (2-1)

x12 2 x 2 3
0 x1 4
0 x2 2

Nu tuyn tnh ha cc hm phi tuyn bng cc hm tuyn tnh tng

khc nh trn hnh 2-2 th c th chuyn bi ton v dng sau :
Hm mc tiu :

62

f ( x10 , x11 , x12 , x13 , x14 , x20 , x 21 , x 22 )

1
x11 x13 x 21 4 x22
2

min

Cc rng buc:
2x11 + 4 2x12 + 9 2x13 + 16 2x14 - 2x21 - 4x22 3
x10 + x11 + x12 + x13 + x14 = 1
y10 + y11 + y12 + y13 = 1
x10 y10
x11 y10 + y11
x12 y11 + y12
x13 y12 + y13
x14 y13

x20 + x21 + x22 = 1

y20 + y21 = 1
x20 y20
x21 y21 + y22
x22 y22

Trong , cc bin thc :

x10 , x11 , x12 , x13 , x14 , x20 , x21 , x22 0
cn cc bin nguyn :
y10 , y11 , y12 , y13 , y20 , y21 = 0 hoc 1.

63

f1(x1
)

(x1)

sin

x1
2
x1

0 2 4

x12

f2(x2
)

1 3
x2
2
x2

x1

012

024

Hnh 2-2

S thay i ca cc bin mi (nguyn v thc) tha mn cc rng buc

a ra, s tng ng vi s bin thin ca cc bin c x 1, x2 trong gii hn
cho, cn hm f s nhn mi gi tr tng ng theo ng cong tim cn.
D chng minh c iu ny qua hm bc ba

f 2 ( x2 )

1 3
x
2

thay i trong

phm vi 0 x2 2. tim cn hm ny cn s dng ba bin thc x20, x21, x22,

v hai bin nguyn y20, y21.
t x2 = u20x20 + u21x21 + u22x22
= 0.x20 + 1.x21 + 2.x22 (1)
vi u20, u21 v u22 l gi tr cc im chia on ca hm tim cn.
Cc rng buc cn c b sung i vi cc bin thc v nguyn l :

64

x20 + x21 + x22 = 1 (2)

y20 + y21 = 1 (3)
x20 y20
x21 y20 + y21 (4)
x22 y21 .
V cc bin nguyn y20, y21 ch c cc gi tr 0 v 1, ng thi phi tha
mn (3) nn ch c hai trng hp xy ra y20 = 0, y21 =1 v y20 = 1 , y21 = 0.
Cc bin thc ch nhn gi tr dng, ng thi phi tha mn (2) v
(4) nn
a) nu y20 = 1 (y21 =0) th :
x2 = u20x20 + u21x21
x20 + x21 =1 . (a)
b) nu y20 = 0 (y21 = 1) th :
x2 = u21 x21 + u22x22
x21 + x22 = 1 (b)
Nh vy, mt cp gi tr tha mn (a) ca x20, x21 s xc nh duy nht 1
im (mt gi tr ca x2) trn on (u20, u21). Cn mt cp gi tr tha mn (b)
ca x21, x22 s xc nh tng ng 1 im (mt gi tr ca x 2) trn on
(u21,u22). Ngha l s thay i gi tr cc bin nguyn xc nh khong tim
cn ca hm, cn s thay i ca cc cp bin thc tng ng xc nh chnh
xc im tnh ton.
V gi tr hm, ta c :
f2(x2) = f2(u20)x20 + f2(u21)x21 + f2(u22)x22 .
Do , trng hp (a) x22 = 0 , hm nhn cc gi tr trn on thng t
f2(u21) n f2(u22) , cn trng hp (b) x22 = 0 ,hm nhn cc gi tr trn on

65

thng t f2(u20) n f2(u21) . Ngha l hm xp x c tnh lin tip theo cc

on gp khc.
C th suy ra quy tc chung, vi mt hm phi tuyn lin tc c biu
thc ton hc bt k ( nm trong thnh phn ca hm mc tiu hoc rng
buc) k hiu l fi(xi) , c tim cn ha bng ng gp khc n on, ni
tip nhau ti cc im phn chia u i0, ui1, ..., uin (gi tt l cc im chia) th
hm xp x c th biu din l:
f i* ( xi )

f (u
j 1

ij

) xij (2-2)

vi cc rng buc :
n

x
j 1

ij

y
j 1

ij

xi0 yi0 (2-3)

xi1 yi0 + yi1
............
xin-1 yin-2 + yin-1
xin yin-1
xi0 , xi1 , . . . , xin 0
yi0 , yi1 , . . . , yin = 0 hoc 1 .
Quan h gia bin c v cc bin mi :
xi

u
j 2

ij

xij (2-4)

Chnh cc rng buc lin quan n bin nguyn m bo cho cc gi

tr hm bin thin ni tip qua cc on thng: vi mi t hp khc nhau ca

66

cc bin nguyn, ch c mt cp bin thc khc 0 , xc nh tng ng mt

gi tr ca bin c xi tnh theo (2-4) v mt gi tr hm tnh theo (2-2) .
Theo quy tc trn ta c th tnh c s lng bin v s cc rng buc
cn thit trong m hnh QHTT. Nu hm c tim cn bng n khong (n+1
im chia, k c hai gi tr bin ca min xc nh) th cn phi s dng n+1
bin thc v n bin nguyn cho biu din. m bo cho m hnh QHTT
tng ng vi m hnh phi tuyn ban u cn b sung 2 phng trnh v
n+1 bt phng trnh (xem (2-3)) vo h rng buc ca QHTT. Quan h (2-4)
gia bin c v bin mi c th nm ngoi m hnh (tnh ton sau), li gii
vn hon ton xc nh. Tuy nhin, thng c a vo h rng buc
nhn c ngay cc kt qu theo bin c trong li gii ca QHTT.
Hm phi tuyn gin on c cha cc im ri rc
C th m rng thut ton nu trn i vi cc hm f(x) dng gin
on, k c c cc gi tr ri rc. S thay i khi ch nm trong cch chn
bin v biu din rng buc (5,a). Chng hn, vi hm c th trn hnh 2-3 ,
h rng buc bao gm:
14

xj 1;
j 0

12

yj 1; x
j 1

u j x j
j 0

14

u
j 10

j 1

xj ;

x0 y1 ;
x1 y2 ; x2 y2+y3 ; x3 y3 + y4 ; x4 y4+y5 ; x5 y5 ;
x6 y6 ;
x7 y7 ; x8 y7+y8 ; x9 y8 ;
(x)

x10 y9 ; x11 y9+y10 ; x12 y10 + y11 ; x13 y11+y12; x14 y12 .
Hm mc tiu vn c dng ging nh (5), cn tnh cho mi bin mi:
(x)

(x)
(x)
13
f 6 ( x ) 0 x0 (u j ) x j f 6 x 6 (u j ) x j (u j ) x j 1
*

y1 y2

j 1

j 7

y3

y4 y5

y6 y7

j 9

y8 y9 y1

y1

y1

0 u1 u2
u
u u u u u
u u 0 u 1 u12
2 u13
x0 x1 . . . . . . . .3 . . . .4 . .5 . 6. . .7 . 8. . . . x99 10 11
x10 . . . . . . . . . .
x14
Hnh 2-3

67

Dng hm nu trn c ngha m rng ng k, cho php m t cc bi

ton c xt n nhng la chn theo cc yu t ri rc, lm thay i t bin
gi tr hm mc tiu v cc rng buc.
Hm xy dng theo s liu thc nghim
Theo quy tc chung nu trn biu din xp x cc hm trong m
hnh QHTT ta ch cn bit gi tr ca hm ti cc im chia. V th vi cc
hm c cho theo s liu thc nghim (ch c gi tr hm ti mt s hu hn
im) ta c th biu din c ngay bng cch chp nhn cc im chia chnh
l cc im c gi tr hm c cho. Trong trng hp ny cn mt s ch :
Cn phn bit cc khong xc nh khi hm lin tc vi cc im ri
rc nm ngoi p dng cc cng thc cho ph hp.
C th p dng cc php ni suy tm thm cc im chia nm gia
cc gi tr c (nhm nng cao chnh xc biu din).
Cc kh khn p dng phng php xp x ho tm li gii ti u
ton cc bi ton QHPT v mt hng gii quyt
C th ni, tng v cc phng php bin i m hnh nh c a
ra trong cc mc trn c t rt sm, v dng nh cho php gii quyt
c kh hon thin vn phng php gii chung cho cc bi ton QHPT ?

68

Tuy nhin, thc t phng php li khng my c ch v cho n nay

vn c rt t cc ng dng c th vo cc lnh vc k thut. C th gii thch
iu ny bng nhng kh khn khi p dng:
Trc ht, phng php khng cho php p dng c ngay vi m t
ton hc ban u, ngi s dng cn hiu y thut ton v thit lp c
m hnh QHTT xp x. Cc chuyn gia ng dng phng php ti u ha
thuc cc lnh vc chuyn mn k thut khc nhau, khng phi c ngay
kh nng ny.
Tip theo, v phng din thc hin, php bin i m hnh i hi mt
khi lng tnh ton rt ln nhm tnh gi tr ca hm ti cc im chia v
kim tra sai s. S im chia cn chn t nht c th nhng m bo c sai
s tim cn nh cho hm mi min xc nh. Qu trnh ny thng i
hi cc php tnh lp nhiu ln gi tr hm m vi kh nng thc hin bng
tay ch c th thch hp cho cc bi ton c nh. Khi hm c tnh phi tuyn
cao, m bo chnh xc s im chia cn phi chn rt ln. Khi vi
nhng m hnh phc tp, khi lng tnh ton tng ln ng k.
Sau khi c cc gi tr bin v hm cn tnh ton, vi mt s lng
ln cc bin v quan h rng buc cn a vo (hng chc nghn bin v hng
nghn rng buc) vic thit lp m hnh QHTT cng l mt ni dung phc
tp, thc hin rt kh khn (tn nhiu thi gian v cng sc).
Cui cng l cng vic tnh ton bng chng trh QHTT mt bi ton
c kch c rt ln v hon nguyn li cc bin ban u t li gii ti u nhn
c.
Cc l do trn hn ch c bn u im ca phng php v lm mt
kh nng ng dng. Cng cn ni thm rng khi chuyn t m hnh QHPT
sang QHTT s bin v s rng buc tng ln rt nhiu (nh tnh trn) ,
kch c ca bi ton l qu ln so vi kh nng b nh v tc tnh ton ca

69

cc my tnh th h c. Chnh v vy, hng nghin cu p dng phng php

ny gn nh b lng qun. Hin nay, vi s pht vt bc v k thut my
tnh, kh nng m rng b nh gn nh khng b hn ch, tc tnh ton
tng ln hng trm ln ch sau vi nm ci tin, hng tnh ton tm li gii
xp x ca QHPT theo m hnh QHTT t ra c rt nhiu trin vng.
Mt trong nhng hng pht trin tip phng php l tn dng kh
nng ca my tnh t ng x l thng tin v chuyn i m hnh. Nu gii
quyt c khu ny th phng php tht s tr thnh hiu qu v c th xy
dng cc chng trnh tnh ton c ngha ng dng vn nng : ngi s
dng ch cn m hnh bi ton QHPT ban u (theo cch bnh thng nht vit cc biu thc ton hc) mi cng vic cn li l ca my, v nhn li gii
cui cng.
Mun vy, cn thc hin x l bng my tnh cc khu ch yu sau:
Nhn dng c m t ton hc ca bi ton QHPT do ngi s dng
thit lp, phn tch thnh cc hm chun c bn ca ton hc sn sng thc
hin tnh ton.
Xp x ho hm theo thut ton nu trong mc II. Khu ny bao gm
cc cng vic sau:
T ng xc nh cc im chia hp l xp x ho hm. Cc im
chia cn chn sao cho m bo sai s hm xp x ti mi ni trn min xc
nh u nh theo yu cu trng khi s im chia l ti thiu.
Ghi nhn gi tr ca cc im chia chn v tnh cc gi tr hm ti
cc im ny (l nhng s liu cn thit cho thit lp m hnh QHTT xp x).
T ng t tn cc bin mi theo s khong chia (i vi cc bin
nguyn) v s im chia (i vi cc bin thc). Cc gi tr ri rc ca hm
cng tng ng vi mt bin nguyn v mt bin thc. C y cc thng
tin ny m hnh QHTT xp x s c th thit lp c.

70

T ng thit lp m hnh bi ton QHTT xp x di dng mt file d

liu u vo tng thch vi cc chng trnh gii QHTT. Bc ny c
thc hin da trn kt qu tnh ton gi tr cc im chia, gi tr hm ti cc
im ny v cc tn bin tng ng t.
X l kt qu QHTT, quy i v bin QHPT ban u.
cng l nhng cng vic nghin cu chnh ca cc tc gi ti
nhm pht trin phng php .
MTNH
hnh bi
ton TM
QHPTLI
banGII
u XP X CA QHPT
2.2. CHNG1TRNH
TON
(file dng TEXT cha cc hm i(xi))

Trn hnh 2-3 l s khi chng

i = 1trnh tnh ton tm li gii ti u
xp x ca bi ton QHTT dngNhn
cngdng
tnh,
biutng ng vi cc thut ton
xut trong mc 2.1,II.

thc hm fi(xi)

Cho o ,Xmax
Chng trnh bao gm cc khij =chnh
sau:
1

2.2.1. To m hnh bi ton QHPT

X = Xmax

Thc cht ca khi ny l to file d liu u vo theo chun t quy

hm trong
khongtin
chiacho ngi s dng ng
nh cho bi ton.3Yu Tnh
cu gi
ttrchun
l thun

thi d dng cho cng vic lp trnh (thng c u tin ti a cho ngi s
j=j+1
4 nh gi sai s
Gim
dng). Trong trng hp m hnh
QHPT vic quy nh chun
cX
ngha rt

quan trng. l v m t ton hc ca bi ton

trueht sc a dng : t hp ca
< o

false
cc loi hm c bn vi tt c cc du ca
php tnh (+, -, x, /, lu yha, tr
i = i+1

Ghi nhn uij , v i(uij)

tuyt i,...) v c th c kt
hp bng du ngoc nhiu lp. Hn na hm

c th c nhiu khong xc nh khc

nhau, cha cc im ri rc (hnh 2-2).
X=X+X
true

X < Xmax
false

Khng cn cc hm thnh false

phn trong HMT v RB

true
6 Thit lp bi ton QHTT
5
7 Gii bi ton QHTT
In kt qu
Stop

71
Hnh 2-3

Gii php hu hiu trong trng hp ny l thit lp thng tin theo mi

hm thnh phn trong hm mc tiu v cc rng buc. Do bi ton c dng
cng tnh nn hm mc tiu cng nh mi rng buc u c th coi nh bao
gm n hm thnh phn (tng ng vi n bin). S lng ti a cc hm thnh
phn s l n.(m+1), trong n l s bin, m l s rng buc. Cc thng tin
cho mi hm bao gm:
Tn bin;
Dng hm;
Cc khong xc nh;

72

Cc gi tr ri rc (nm ngoi min lin tc);

Yu cu v sai s.
Tn bin c th t t do theo mun ca ngi s dng (gi l cc
bin c hay bin ban u ca bi ton QHPT).
Dng hm chnh l cc biu thc ton hc ca hm, cn c vit theo
quy c. Ni chung, cc quy c lun c chn thun li nht cho ngi s
dng, gn vi cch vit t nhin ca ton hc. C cc hm c bn sau:
Tn hm
Cc hm c bn
ABS
ATN
COS
EXP
FIX
INT
LOG
RND
SGN
SIN
SQR
TAN
Cc hm m rng
SEC
COSEC
COTAN
ARCSIN
ARCCOS
ARCSEC

C php

Ni dung

Abs(Arg)
Atn(Arg)
Cos(Arg)
Exp(Arg)
Fix(Arg)
Int(Arg)
Log(Arg)
Rnd(Arg)
Sgn(Arg)
Sin(Arg)
Sqr(Arg)
Tan(Arg)

Gi tr truyt i
arctang
Hm cosine
Hm e m
Ct phn nguyn
Lm trn s nguyn
Logarit c s 10
S ngu nhin
Ly du
Hm sin
Cn bc 2
Hm tang

Sec(Arg)
COSEC(Arg)
COTAN(Arg)
ARCSIN(Arg)
ARCCOS(Arg)
ARCSEC(Arg)

Sec(Arg) = 1 / Cos(Arg)
1 / Sin(Arg)
COSEC(Arg) = 1 / Sin(Arg)
COTAN(Arg) = 1 / Tan(Arg)
ARCSIN(Arg) = Atn(Arg / Sqr(-Arg * Arg + 1))
ARCCOS(Arg) = Atn(-Arg / Sqr(-Arg * Arg + 1)) + 2 *
Atn(1)
ARCSEC(Arg) = Atn(Arg / Sqr(Arg * Arg - 1)) +
Sgn(Arg - 1) * (2 * Atn(1))
ARCCOSEC(Arg) = Atn(Arg / Sqr(Arg * Arg - 1)) +
(Sgn(Arg) - 1) * (2 * Atn(1))
ARCCOTAN(Arg) = Atn(Arg) + 2 * Atn(1)
HSIN(Arg) = (Exp(Arg) - Exp(-Arg)) / 2
HCOS(Arg) = (Exp(Arg) + Exp(-Arg)) / 2
HTAN(Arg) = (Exp(Arg) - Exp(-Arg)) / (Exp(Arg) +
Exp(-Arg))
HSEC(Arg) = 2 / (Exp(Arg) + Exp(-Arg))
HCOSEC(Arg) = 2 / (Exp(Arg) - Exp(-Arg))
HCOTAN(Arg) = (Exp(Arg) + Exp(-Arg)) / (Exp(Arg) Exp(-Arg))
HARCSIN(Arg) = Log(Arg + Sqr(Arg * Arg + 1))
HARCCOS(Arg) = Log(Arg + Sqr(Arg * Arg - 1))
HARCTAN(Arg) = Log((1 + Arg) / (1 - Arg)) / 2
HARCSEC(Arg) = Log((Sqr(-Arg * Arg + 1) + 1) / Arg)
HARCCOSEC(Arg) = Log((Sgn(Arg) * Sqr(Arg * Arg
+ 1) + 1) / Arg)

ARCCOSEC

ARCCOSEC(Arg)

ARCCOTAN

ARCCOTAN(Arg)

HSIN
HCOS
HTAN
HSEC

HSIN(Arg)
HCOS(Arg)
HTAN(Arg)
HSEC(Arg)

HCOSEC
HCOTAN
HARCSIN

HCOSEC(Arg)
HCOTAN(Arg)
HARCSIN(Arg)

HARCCOS
HARCTAN
HARCSEC
HARCCOSEC
HARCCOTAN

HARCCOS(Arg)
HARCTAN(Arg)
HARCSEC(Arg)
HARCCOSEC(Arg)
HARCCOTAN(Arg)

73

Cc hm khng phi ton hc

TIMER
TIMER
YEAR
YEAR
MONTH
MONTH
DAY
DAY
WEEKDAY
WEEKDAY
HOUR
HOUR
MINUTE
MINUTE
SECOND
SECOND

Gi hin ti (gi + pht + giy)

Nm hin ti
Thng hin ti
Ngy hin ti
Th (trong tun) hin ti
Gi hin ti
Pht hin ti
Giy hin ti

Cc hng s
PI
E
ZERO

PI
E
ZERO

3.14159265358979
2.71828182845905
0

Cc php tnh bao gm: cng (+), tr (-), nhn (*), chia (/), m (^).
V d, mt hm thnh phn c vit nh sau: 2*x*(sin(x)/
(x+x^3)+2*x^2)
l hon ton hp l vi quy c, ngi dng cng d dng hiu c.
Nh vy v nguyn tc c th lit k v son tho ht ton b thng tin
ca cc hm thnh phn trong hm mc tiu v cc rng buc. B sung thm
cc rng buc gii hn ca cc bin n (bounds) ta c y m hnh bi
ton QHPT ban u. C th xy dng phn chng trnh son tho chuyn
dng nhp biu thc v cc thng tin c thun li hn (c th b sung
v sa cha).
Nhn dng biu thc hm
Nhim v ca khi ny l to ra kh nng tnh gi tr hm theo ngha
ton hc ca cc biu thc m t hm thnh phn. Cng vic ny kh phc
tp, bi biu thc ban u i vi my ch c nhn nhn nh l mt xu k
t. Yu cu l, trn c s cc k hiu v quy tc biu din chung my thc
hin cc php so snh, phn tch, nhn dng ra cc nhim v ton hc ca
biu din c th ln lt thc hin cc chc nng ny cho n khi nhn
c gi tr ng ca hm (tng ng vi mt gi tr cho ca bin. ng
nhin l biu thc phi hp l theo quy tc (trong trng hp ngc li cn
bo li).

74

Thng cn tin hnh theo th t cc cng vic sau:

Duyt cc k t kim tra ng php biu din. V d, biu thc ch c
cha k t x (tn bin), cc t kho hm c bn, cc du php tnh, cc du
ngoc.
Phn tch du ngoc;
Phn tch du php tnh.
Hai cng vic cui cng ng thi cng l qu trnh ghi nhn cc chc
nng ton hc. V d, khi du ngoc kim tra ng th ng thi cng ghi
nhn th t thc hin php tnh "t trong ra ngoi". Vi mi du ngoc cn
ghi nhn cc php tnh i vi gi tr cc hm c bn theo th t "nhn chia
trc, cng tr sau". Cui cng l nhn dng cc hm c bn c th gi th
tc chun ca ngn ng lp trnh tnh gi tr ca n.
Cui qu trnh phn tch cc kt qu c th c ghi li di nhng
dng khc nhau, chng hn dng bng (ma trn). V d, sau khi phn tch biu
thc hm trong phn trn, my c th ghi li cc hng ca ma trn nh sau:
AB C
1 sin(x) x^3 x^2 cc hm c bn trong cng;
2 x+B1 2*C1 php tnh trong ngoc;
3 A1/A2 A3+B2 nhn chia trc cng tr sau;
4 2*x A4*B3 t tri sang phi.
Mi ca ma trn l mt php tnh n, gm du php tnh, phn t
tri, phn t phi (hoc t kho hm, gi tr bin) c ghi li theo quy c
ring, t c th gi hm chun ca ngn ng lp trnh thc hin tnh ton.
Gi tr ti B4 chnh l gi tr ca hm tng ng vi bin x cho.
Xp x ho hm phi tuyn bng hm tuyn tnh tng khc
y l khi tnh ton chnh khi thc hin chuyn i m hnh. Ni
dung ch yu ca khi ny l xc nh cc im chia cn thit cho xp x ho

75

hm, ghi nhn v tr ca cc im chia ny v gi tr hm ti . im chia

dng chung cho tt cc cc hm cng bin (thuc hm mc tiu v mi rng
buc), do phi m bo sai s tim cn nh trong cc khong chia i
vi cc hm ny.
C nhng cch la chn im chia khc nhau, mi cch c u nhc
im ring. n gin nht phi k n cch chia u cc khong chia v tng
dn s khong (khong chia s ngn li) cho n khi sai s ln nht mc phi
tnh cho mi khong nh hn gi tr cho php. Trn s thut ton l
trng hp chn tr s Xmax nh. Nhc im ca cch chia ny l s
im chia c th nhiu khng cn thit (khi cong ca ng biu din hm
khc nhau nhiu). Ti nhng min ng cong gn vi ng thng s im
chia ch cn rt t.
Mt cch chia khc, ngc li, ly Xmax ln qu trnh la chn
im chia gim dn X. im chia s c chn khi sai s ln nht trong
khong nh hn . im chia chn t u n cui min xc nh (hnh 2-4).

f(x)

Xmax

Xmax

Xmax

Hnh 2-4

76

u im ca cch chia ny l s im t nht, m bo sai s tng i

ng u trn cc khong. Nhc im l kh phi hp cc im chia khi c
nhiu hm cng c tim cn.
khc phc nhc im ny c th p dng cch chia i khong
chia ch cho nhng khong khng t yu cu sai s (hnh 2-5).
f(x)

Xmax

Xmax

Xmax

Hnh 2-5

u im cch chia ny l thun tin cho vic chia phi hp cho nhiu
hm cng mt lc. Sai s kim tra cho mi hm. Nu c mt trong cc hm
khng t yu cu ca sai s th khong c chia i. im chia mi ny
c chp nhn b sung cho mi hm. Nh th s khong chia s tng i
t, ng thi p ng c yu cu cc im chia dng chung c cho mi
hm.
Mt vn lin quan n ngi s dng l vic quyt nh gii hn sai
s. Cn kt hp gia ngha vt l ca i lng s dng v dng iu hm.
S rt kh khn quyt nh nu ngi s dng khng nhn bit c kt qu
tim cn. Chng trnh to chc nng v hm c th ng thi quan st

77

hm phi tuyn ban u v hm tim cn trn cng h to . Sai s ln nht

c th nh gi c theo khong cch gia hai ng cong, nh lng theo
n v tnh. Khi sai s khng tho mn, ngi s dng c th cho li v quan
st li. Tnh ton ch c thc hin khi mi sai s c xem l tho mn.
Thit lp bi ton QHTT
Cng vic ch yu ca khi ny l t tn bin v to file s liu cho
chng trnh gii QHTT. V phng din ton hc l qu trnh x l, thay
th tt c cc hm phi tuyn trong HMT v cc rng buc bng hm tuyn
tnh xp x dng (2-2). Thay th xong mi hm, cn b sung thm vo h rng
buc cc rng buc mi bao gm (2-3) v (2-4). Rng buc (2-4) c th
khng a vo nu kt qu c x l ring sau khi nhn li gii. V phng
din thc hin chng trnh, khi ny cn to c file d liu tng thch
vi nh dng ca chng trnh gii bi ton QHTT (thng c xy dng
c lp). Do vi mi ng dng, nh dng file ny c th khc nhau, ngi
lp trnh cn nghin cu trc.

78
Hnh 2-6,a

x
Hnh 2-6,b

Mt ni dung rt ng ch trong khi thit lp bi ton QHTT l yu

cu nhn gi tr m ca QHPT trong khi QHTT ch chp nhn cc bin dng.
Khi cc bin ca QHPT Do c th phi dch chyn h to ca bi ton
QHTT. Chng hn, cng tt cc cc bin ca QHTT vi mt s dng ln
cc bin u c gi tr dng (hnh 2-6,a,b). m bo khng thay i
kt qu th tt c cc gii hn cng phi c cng vi s dng ny. Sau khi
nhn c li gii, cn dch ngc gi tr cc bin. Gi tr hm mc tiu

79

khng b thay i. Ni chung khi a cc rng buc (2-4) vo h, th vic to

kh nng dch chuyn h to l nht thit, bi s c mt ca bin x i ban
u. Trong chng trnh cn thit lp kh nng ngi s dng c th dch
chuyn tu h to khi cn thit.
Gii bi ton v x l kt qu
Gi tr HMT nhn c ca QHTT chnh l gi tr xp x HMT ca bi
ton QHPT, cn chp nhn kt qu ny cho li gii ti u. Theo tnh cht ca
QHTT, gi tr HMT lun lun l cc tr tuyt i ca bi ton. Trong trng
hp QHTT c nhiu nghim ti u th gi tr HMT phi nh nhau. Nh vy
gi tr HMT nhn c cng chnh l li gii ti u ton cc xp x ca bi
ton QHPT.
c gi tr cc bin tng ng vi li gii ti u, cn s dng quan h
(2-4), trong trng hp quan h ny cha c a vo m hnh. Ngc li,
ch cn "lc" gi tr ca cc bin c trong li gii ca QHTT, v chng c
sn trong m hnh.
Khi c s dch chuyn h to trnh gp phi gi tr m trong
QHTT (nh ni trong mc (2-2.4) ) cn c s dch chuyn ngc nhn
c gi tr ng ca QHPT (cc gi tr m).

Chng 3. GII THIU V HNG DN S DNG

CHNG TRNH
3.1. MN HNH GIAO TIP CA CHNG TRNH

Khi chy chng trnh, mn hnh xut pht c th hin nh hnh v

di trc khi hin th cc chc nng s dng.

80
Hnh 3-1

Tip theo l mn hnh lm vic c dng thng dng nh trn hnh 3-2,
vi chc nng file c th thc hin. Ngi s dng c th to file s liu mi
(New Project) hoc m file s liu c (Open Project). Chn mt trong 2 chc
nng trn s xut hin mn hnh nh hnh 3-3. Cho tn file (nu son tho
mi) hoc chn file nu lm vic vi s liu c.

81
Hnh 3-2

Hnh 3-3

Tip theo s c th lm vic vi cc chc nng: son tho (Edit), chy

chng trnh tnh vi s liu c va m (Run), hoc kho st cc hm nhp
s liu trn mn hnh (View). Trng thi mn hnh nh hnh 3-4.

82
Hnh 3-4

1. Lm vic vi cc chc nng son tho s liu

Sau khi nhp tn file s xut hin mn hnh nh trn hnh 3-4,a. Chn
Edit s c thm ca s, vi cc chc nng lm vic c th la chn, bao gm :
General..., Objective...,Constraitns..., Bounds...

Hnh3-4,a

a) Chn Objective son tho hm mc tiu. Ln lt nhp thng tin

cc hm thnh phn trong hm mc tiu. Mn hnh son tho nh hnh 3-5,
cho php cng thm dn cc s hng (hm thnh phn, mt bin) cho HMT.
Thng tin c nhp theo hng trong bng, bao gm:
- Dng hm (Formula): vit biu thc ton b hm thnh phn theo quy
nh. Ch hm thnh phn c hiu l tt c cc biu thc ca mt bin
(c th c nhiu s hng v c hng s). Khi vit biu thc hm, bin lun s
dng l x.

83
Hnh 3-5

Tn bin (Variable Name) : cho tn bin t, tng ng vi hm thnh

phn ang vit. Khi thc hin bin ny s thay vo v tr x trong biu thc.
Min xc nh

(Min X, Max X):

cn trn v cn di ca min xc nh

hm.
Sai s cho php (Tolerant) v s khong chia ban u (No Point).
Kt thc nhp mt hng (tng ng kt thc vit mt hm thnh phn
ca HMT) cn nhn nm "Save" cng vo biu thc chung ca HMT.
Cc hm thnh phn trong HMT cn c th cha cc im ri rc.
cho to ca cc im ri rc ny cn nhn ca s " Isolated Points". Thng tin
gm tn bin (tng ng vi mt hm thnh phn), gi tr bin (cho vo ct
Value) v gi tr hm (cho vo ct Function). Thng tin ch cn cho i vi
nhng hm c im ri rc.
Kt thc son tho HMT, nhn "Close".

84

Khi cn sa cha mt hng son tho, cn nhn p chut vo hng

cn sa cha, mn hnh sa cha s hin ln nh hnh 3-5,a. Sa cha xong
nhn Save ghi li (hoc Cancel hu b).

Hnh 3-5,a

b) Chn Constraints son tho cc rng buc (phc hp).

B tr mn hnh son tho Constraints nh trn hnh 3-6. Na pha tri
hin th cc rng buc nhp xong. Na pha phi son tho. Vi mi
rng buc, cc cng vic bao gm: vit biu thc hm thnh phn ng vi
tng bin, vit tn bin (nh chn trn HMT), chn du ( , = , ) v cho
hng s v phi. Kt thc son mi rng buc li nhn nm "New" bt u
rng buc mi. Loi b rng buc son tho bng phm "Delete". Son
tho ht cc rng buc cn nhn "Close" ghi vo v tr v chc nng
chnh.

85

Sa cha cc thng tin rng buc cng c thc hin tng t nh

i vi HMT, cn nhp p chut vo biu thc cn cha cho n khi hin
ln ca s nhp thng tin (hnh 3-6).
c) Chn Bounds cho cc rng buc gii hn .
Mi rng buc loi ny cn cho tn bin (Variable), cn di (Low
value) v cn trn (High value).

Hnh 3-6

d) Chc nng General... :

Cho php xem nhanh tng hp ton b cc thng tin nhp: General
Informations, Objective, Constraints, Bounds. Mn hnh nh hnh 3-7. Vi
mn hnh ny ta cn c th:
Nhp thm thng tin m t bi ton (General Parametrs);
La chn mc tiu ti u ho (MINIMIZE, MAXIMIZE) ;
Cho dch chuyn cc bin (nu cn thit) bin c gi tr dng ( X
offset).

86

Khi cho thm cc thng tin ny cn nhn "Update" cp nht vo file,

v nhn "Close" tr v.
Trong khi quan st cc Objective, Constraints, Bounds trn mn hnh
General ta cng c th s dng phm "Change" sa cha thng tin (ging
nh trong Edit).

Hnh 3-7

2. Lm vic vi chc nng View

l chc nng kho st th trn mn hnh (hnh 3-8).

87
Hnh 3-8

C th chn "All" xem ng cong ca tt c cc hm thnh phn

trong HMT, hoc xem tng hm cng vi hm tim cn xp x.
Dng chc nng "Options" la chn mn hnh th. xem xt k
hn cc im chia c th ct ca s phng to phn th cn quan st. Tr
s hm c th xc nh c bng cch di chut trn trc gi tr bin.
Trn hnh 3-9 th hin cc mn hnh kho st kt qu tim cn hm
hnh sin vi cc sai s khc nhau ( = 0.2, = 0.1). Khi chn = 0.01, tng
ng vi sai s 10% ) hai ng cong gn nh trng kht ln nhau.

88

Hnh 3-9
89

Hnh 3-10

3. Chy chng trnh v ghi li kt qu

Nhn phm "Run" chy chng trnh. Khi mn hnh lm vic ca
chng trnh gii QHTT s xut hin (tu thuc vo chng trnh s dng).
Hnh 3-11 l ch ang tnh ton ca chng trnh LINGO. Pha di l kt
qu nhn c. Trong trng hp ny l li gii ti u, vi gi tr hm mc
tiu (Objective Solution) l -0,313359, gi tr ti u ca bin: X = 3,461905,
Y = 0.

90

Hnh 3-11

91

3.2. NH GI HIU QU CA PHNG PHP QUA LI GII CA

MT S M HNH N GIN

nh gi hiu qu ca phng php cch tt nht l p dng c th

vo m hnh cc bi ton. C hai ni dung cn quan tm, l chnh xc
ca li gii v kch c ca bi ton QHPT c th p dng c phng php.
V ni dung th nht, c th phn tch qua li gii ca nhng m hnh
n gin. Vi nhng m hnh ny ta c th gi thit nhng dng hm phc tp
tu , cn li gii th bit trc. Khi , kt qu s khng kh kim tra.
Vi ni dung th hai, cn thc hin sau khi chnh xc v tnh ph
hp ca li gii cho cc v d n gin c khng nh. C th chn m
hnh bi ton l nhng ng dng khc nhau trong lnh vc k thut. Ni dung
ny tn nhiu thi gian v cng sc hn, cn kt hp vi nhng nghin cu
ng dng chuyn su c th. Bi ton xy dng biu vn hnh ti u ngn
hn (ngy m) h thng in hp nht Bc - Trung - Nam xt n gii hn
truyn ti cng sut gia cc khu vc c th coi l phc tp, kch c ln.
Kt qu nghin cu c trnh by trong mt ti liu ring. Trong ti liu ny
s trnh by mt v d n gin hn, bi ton phn b ti u dung lng b
trong li phn phi.
Li gii ca bi ton QHPT n gin, in hnh
Hm mc tiu:

F ( x, y) f1 ( x) f 2 ( y) min ;
sin( x)
f1 ( x )
2

0 x 3,5 ;

f 2 ( y) y 2

0 y 3,5

x4;

Rng buc:

92

x2 y2 R2 .

Xt li gii vi cc gi tr v phi R2 khc nhau ( = 9, 10, 15, 16,5 ).

D thy rng min gi tr ca hm mc tiu l 1/4 hnh trn bn knh l
R v cc bin x v y ch nhn gi tr dng, ng thi HMT phi tho mn
rng buc l nm bn trong hnh trn tm (0,0) bn knh l R trn mt phng
x0y. Tu theo bn knh ca hnh trn m im ri rc (4,0) vi gi tr hm
mc tiu F = f1(x)+f2(y)= -1 nm trong hay ngoi min rng buc.
Mt khc, f2(y) l hm bc hai i qua gc nn nghim ti u ca bi
ton phi tng ng khi y = 0. Ngha l thuc ng cong giao tuyn ca mt
phng x0F vi mt cong ca hm mc tiu: chnh l ng cong hnh sin
f1(x). T y ta nhn thy nghim ti u ca bi ton tng ng vi cc chm
im trn hnh 3-10.
Trng hp th nht R2 = 9 , nghim ti u F = 0 khi x=0;
Trng hp th hai R2 = 10 , nghim ti u F < 0 khi x R

10 ;

Trng hp th ba R2 = 15 , nghim ti u F = sin(3,5) khi x=3,5 nm

trn gii hn min lin tc ca x. im ri rc nm ngoi min rng buc;
Trng hp th t R2 = 16,5 , nghim ti u F = -2, tng ng vi gi
tr ri rc ca hm f1(x) ; im ny tng ng vi

x4R

16,5 .

2
y

1
0

2
I

-1

3
II

III

IV

93

-2

Hnh 3-10

Kt qu tnh ton bng chng trnh cho ta cc gi tr c th nh bng

sau (ly sai s tim cn hm l 0,01).
Trn
g hp
1
2
3
4

Gi tr ti u
ca x

Gi tr ti u
ca y

Gi tr ti u
ca HMT

0
0
0
0

0
-0,02053
-0,35078
-2

0
3,16228
3,5
4
Nhn xt:

Gi tr ti u
ng ca
HMT
0
-0,02068
-0,35078
-2

Sai s hm mc tiu c kch c nh sai s tim cn ca hm.

Nghim l ti u ton cc. C th ly trng hp 1 v 2 so snh.
Trng hp 1 R =3,0 < , cn trng hp th hai R=3,16228 > . Ch
mt thay i rt nh ca bin gii min rng buc nhng nghim ti u x
thay i rt nhiu, t gi tr x = 0 nhy n gi tr x = 3,16228, trong khi
HMT thay i khng ng k. C th thy l, nu s dng cc phng php
gradien nghim s nhn c nh nhau (ch ph thuc vo im ban u ca
x ly nh hn hay ln hn /2).
Trng hp 3 v 4 c kt qu khc hn nhau l do c im ri rc ca
hm f1(x). Vi min gii hn nh (bn knh R = 3,5) im ri rc nm ngoi
gii hn, hm mc tiu nhn gi tr bin. Khi bn knh

16,5

min gii

hn bao trm im ri rc ca hm (ti x = 4, f 1(4) = -2). Hm mc tiu nhn

gi tr F = f1(4)+f2(0) = -2 chnh l gi tr nh nht.

94

Nh vy phng php gii xp x QHPT ang xut cho php p

dng kh thun li trong trng hp hm c im ri rc. l mt li th
ni tri ca phng php ny so vi cc phng php khc. Trong thc t,
l cc trng hp rt hay gp. Tht vy, hu ht cc d n u t (sn xut cc
loi sn phm chng hn) c vn u t ph thuc lin tc vo quy m (khi
lng) sn phm lm ra, nhng lun cn mt phn vn ti thiu V 0 ban u
no . Phn vn ny s khng c khi loi sn phm khng c chn,
chnh l im ri rc (0,0) ca hm (hnh 3-11).

V
f(x)

V0

f ( x)
0

V ( x)

x 0 ;
x0
x

(0,0
)
Hnh 3-11

C th k ra hng lot quan h trong HMT c dng ni trn.

Bi ton phn b dung lng b CSPK trong li phn phi
Cn ni ngay l ni dung bi ton xt trong mc ny cha c m t
y ng dng tnh ton thc t la chn v tr v dung lng b ti u.
Vi mc ch minh ho hiu qu ca phng php trong bi ton c kch c
tng i ln bi ton c m t n gin ho nhng s li phn phi
c s lng nhnh v nt bt k.

95

M t bi ton
Xt trng hp tng qut, mng in gm n nt (khng k nt thanh ci cung
cp). Mi nt u c ph ti v dung lng b. Nt khng c ph ti v khng cn
t dung lng b s tng ng vi tr s cng sut bng 0. S th t nt c
nh s lin tc t 1 n n cn s th t nhnh c ly theo s th t ca nt cui,
tnh theo hng cng sut cung cp t ngun (ch thun li cho vit cc biu
thc dng tng qut).

i vi mi nt i , k hiu:
- Cng sut cc i ca ph ti Sti = Pti + j Qti ;
- Cng sut b Qbi ;
Ti mi nhnh i , k hiu :
- Tng tr nhnh Zi = Ri + j Xi ;
- Cng sut truyn ti n cui ng dy: Si = Pi + j Qi .
Tn tht cng sut tc dng trn nhnh th i xc nh gn ng theo cng thc:
Pi

Pi 2 Qi2
Ri Ai Bi Qi2 ; (1)
2
U dm

Pi 2
Trong : A i 2 Ri ;
U dm

Bi

Ri
.
2
U dm

Tn tht tng trong ton mng s l: P

(A

i 1

Bi Qi2 ) , vi Ai Bi l

nhng hng s.
Gi l thi gian tn tht cng sut ln nht, g l bn gi in trung
bnh ta tnh c chi ph tn tht hng nm : C = g.. P /kWh.
Vn u t cho thit b b t ti nt i tnh theo biu thc: Vi = V0i + ki
Qbi ; trong ki l sut vn u t tnh cho mi n v cng sut (phn
khng), V0i l phn vn khng i khng ph thuc vo dung lng b. Vn
u t tng cho thit b b:

96

V
i 1

(Qbi )

(V
i 1

0i

k i Qbi ) .

Dng hm mc tiu l cc tiu chi ph tnh ton, ta c :

Z tc V C

[
i 1

tc

(V0i k i Qbi ) g . .( Ai Bi Qi2 )] min . (2)

Cn ch l trong biu thc hm mc tiu Z mi ch biu din c

quan h vn u t t thit b b khi Q bi 0. y hn cn hiu cc quan
ny dng hm:

khi Qbi 0;
0
Vi (Qbi )
V0i ki Qbi khi Qbi 0.
Trong chng 2 ch ra cch cho cc hm ny khi son tho s liu
vo cho chng trnh tnh ton. l cc hm c im ri rc nm ngoi
min gi tr bin lin tc.
H rng buc cn thit lp cho bi ton bao gm:
Phng trnh cn bng cng sut phn khng cc nt;
Cng sut b ti a ti mi nt (dng bt phng trnh) .
Tng dung lng b cn t cho ton li (mt phng trnh).
Trong trng hp chung, mi nt c phng trnh cn bng cng sut
dng sau:
Qi Qbi Qti [Qk (C k Dk Qk2 )] 0 ;
k

i 1, 2 , ... , n .

(3)

Trong mi phng trnh, tng k ly theo cc nhnh ni vi nt i (c

cng sut i ra khi nt).
Tng t nh tnh tn tht cng sut tc dng, biu thc tnh tn tht
CSPK trn mi nhnh k cng c dng bc 2 :

97

Qk

Pk2 Qk2
X k C k Dk Qk2 ;
2
U dm

Cc h s trong biu thc tnh tn tht cng sut phn khng xc nh

c theo thng s nhnh:
Pk2
Ck 2 Xk ;
U dm

Dk

Xk
.
2
U dm

Cc gii hn dung lng b c th vit di dng:

Qbi Qbi max . i = 1 , 2, 3 , ... , n . (4)

D xc nh c cc tr s Qbi max theo cng sut ph ti ( b n 100%
l cao nht).
Tng dung lng b cho ton li c th tnh theo ph ti tc dng
tng ly t thanh ci:
Q0 P0 tg ; Q1 Q0 C1 D1Q12 . ;

(5)

Tr s cos cn c chn xut pht t iu kin c th ca li pha

trn (li truyn ti) v cc yu ring ca li phn phi.
Bi ton vi hm mc tiu dng (2) , cc h rng buc (3), (4) v (5) l
bi ton quy hoch phi tuyn, dng cng tnh c th gii c theo phng
php xp x ho, sai s c th khng ch theo mong mun.
V d c th

th nghim phng php, tin hnh tnh ton xc nh dung

lng b ti u cho mng in hnh tia trn hnh 3-12. Cc s liu ban u
c cho trong bng 3-1.

98

1400+j80
0

4
A

1400+j80
0

500+j300
400+j250

7
1
1

800+j500

1000+j600 1500+j800 1250+j700

800+j500 600+j300 800+j500

1
0

Hnh 3-1

Bng 3-1
STT
nt
nhnh
1
2
3
4
5
6
7
8
9
10
11

Tng tr
nhnh
Ri + j Xi
(m)
0.1+j0.12
0.12+j0.14
0.1+j0.12
0.12+j0.14
0.2+j0.22
0.15+j0.2
0.1+j0.13
0.2+j0.25
0.2+j0.25
0.3+j0.33
0.25+j0.3

S liu u vo
Cng sut ti
V0i
Pti + j Qti
(kVA)
103 ng
1000+600
1500+j800
1250+j700
1000+j600
1400+j800
400+j250
500+j300
800+j500
600+j300
800+j500
800+j500

20
20
25
20
20
20
20
20
20
20
20

ki
103 /
kvar
100
100
100
100
100
100
100
100
100
100
100

Kt qu
tnh dung
lng b
ti u Qb t
(kvar)
0
0
265
0
0
0
300
0
198
500
500

Trong trng hp ny ta c h phng trnh cn bng cng sut phn

khng nt nh sau:

99

Q1 Qb1 Qt1 (Q8 Q8 ) (Q2 Q2 ) (Q4 Q4 ) 0

Q2 Qb 2 Qt 2 (Q3 Q3 ) (Q9 Q9 ) 0
Q3 Qb 3 Qt 3 (Q10 Q10 ) (Q11 Q11 ) (Q7 Q7 ) 0
Q4 Qb 4 Qt 4 (Q6 Q6 ) (Q5 Q5 ) 0
Q5 Qb 5 Qt 5 0 ;

Q6 Qb 6 Qt 6 0

Q7 Qb 7 Qt 7 0 ;

Q8 Qb 8 Qt 8 0

Q9 Qb 9 Qt 9 0 ;

Q10 Qb10 Qt10 0

Q11 Qb11 Qt11 0

Cc tn tht cng sut Qi c cng biu thc tnh theo (3) (gn ng c
th b qua). Cc gii hn cng sut b (4) c th vit cho mi nt theo cng
sut ti cc i Qti:
Qbi Qti ; i = 1, 2, ... , 11 .

Bi ton c gii bng chng trnh xy dng. Kt qu nhn

c li gii ti u c ghi trong bng 3-1.
Kt qu cho thy chnh lch tn tht cng sut Pmax = 373,2 - 309,4 =
61,8 MW. Chi ph tn tht gim tng ng: C = 61,8 x 3000 x 0,68 = 126
triu ng.
Tng vn u t cho thit b b l : V = 100+175,3=275,3 triu ng.
Thi gian thu hi vn u t: T = 275,3 / 126 = 2,2 nm.
gii th bi ton theo m hnh ny cho nhiu li khc nhau vi s
nt v nhnh ln ti 500. Ni chung khng c kh khn g v dung lng b
nh cng nh tc thc hin. Nhc im ch yu khi s dng trc tip
chng trnh gii cc bi ton ng dng nh nu l kh nng nhp s
liu u vo. Vi s nhnh s nt li tng i ln th vic phn chia
nhp s liu theo tng s hng trong HMT v cc RB tn rt nhiu thi gian.
ng dng vo mi bi ton c th file s liu cn c to ring bng

100

nhng phn mm chuyn bit. Cc phn mm ny c th to file s liu ng

chun ca chng trnh chung t nhng s liu ti thiu cn nhp bi ngi
s dng. Cc phn mm b sung ny, r rng, cn phi c thit lp t cc
chuyn gia trong tng lnh vc. Chng hn, vi bi ton phn b dung lng
b va nu, ngi s dng ch c th nhp cc thng tin v nhnh nt ca s
li (in tr in khng nhnh, cng sut cc nt ti, cos yu cu m
bo ca thanh ci u ngun, gii hn t CS b ti mi nt, ...). Phn to file
s liu do chng trnh thc hin da vo cc quan h t (1) n (5).

TI LIU THAM KHO

1.

L Vn t, Nguyn c Cng (2000), "Xy dng chng trnh tnh

ton thit lp biu vn hnh ti u cc nh my in trong h thng in",

K yu hi ngh ng dng ton hc ton quc ln th nht, H Ni, tr. 287292.
2.

L Vn t, Ng Duy Hng, Nguyn c Cng (2000), "Chng trnh

tnh ton xc nh li gii ti u ton cc xp x ca bi ton qui hoch phi

tuyn vi mt s ng dng trong lnh vc nng lng", K yu hi ngh ng
dng ton hc ton quc ln th nht, H Ni, tr. 293-300.
3.

L Vn t, Trn Quc Tun, Nguyn c Cng (2000), "Biu vn

hnh ti u cc nh my in trong h thng in nhiu khu vc xt n cc

gii hn truyn ti cng sut", Tp ch khoa hc cng ngh s 25+26/2000,
H Ni, tr. 48-51,95.
4.

Nguyn c Cng, L Vn t (2001), "Xy dng chng trnh tnh

ton ng dng, xc nh biu vn hnh ti u cc nh my in lm vic

trong HT hp nht, xt n cc yu t gii hn vn hnh v kh nng trao
i cng sut gia cc khu vc", Bo co ti nghin cu Khoa hc, EVN 2001.

101

5.

Bui Van-Que (HQI), Nguyen Duc Cuong (EVN) - Electricity of Vietnam

(EVN) - Canadian International Development Agency (CIDA) - World Bank

(WB) (1998), Transient Simulation Studies For the 2nd 500-kV line Pleiku - Di
Linh - Tan Dinh - Phu Lam, Hydro-Qubec International Inc..
6.

Ly X. Bui (Hydro-Quebec International Inc.), Nguyen Duc Cuong

(Electricity Of Vietnam) Electricity of Vietnam (EVN) - Canadian

International Development Agency (CIDA) - World Bank (WB) (1998),
Transmission And Distribution Project (EVN 500 kV and 220 kV systems) Report On Loadflow And Stability Studies, Hydro-Qubec International Inc.
7.

T. Tran-Quoc, Ch. Praing, R. Feuillet, J.C. Sabonnadire, U. La-Van, C.

Nguyen-Duc (2000), "Improvement of Voltage Stability on the Vietnam

Power System", IEEE January 2000.
8.

L Vn t, Hong Ngc Thi, Ng Duy Hng (1997), ng dng mt

phng php xc nh li gii xp x ti u ca bi ton QHPT trong ngnh

nng lng, Khoa hc v k thut, Hc vin k thut qun s, 78(1), tr. 6772.
9.

L Vn t, Trn Vinh Tnh, Ng Duy Hng (1999), Xc nh v tr v

dung lng b ti u cng sut phn khng trong mng in phn phi Khoa
hc v cng ngh , Tp ch cc trng i hc k thut, ISSN 0868-3980, 22 ,
tr. 17-19.
10. GS. TS. Trn nh Long (7-1998), D bo v quy hoch pht trin nng
lng, B mn H thng in - Trng i hc Bch khoa H Ni, H Ni.
11. Trung tm iu H thng in Quc gia (1994), Chng trnh khi
ng ng dy 500 kV, H Ni.
12. Vin Nng lng, Tng Cng ty in lc Vit Nam (2000), Tng s
pht trin in lc Vit Nam giai on 2001-2005 c xt trin vng ti 2020
(Tng s giai on V), H Ni.

102

13. ABB Automation Inc. Network Management Department (November

1999), Resource Scheduling - Subsystem design document, Texas.
14. P. M. Anderson, A. a. Fouad (1984), Power System Control and Stability,
The Iowa State University Press. Ams. Iowa. USA., Galgotia Publication,
New Dehli.
15. C. J. Aldridge, J.R. McDonald and S. McKee University of Strathclyde,
Glasgow, UK (1997), "Unit Commitment for Power Systems using a
Heuristically Augmented Genetic Algorithm", Genetic Algorithms in
Engineering Systems: Innovations and Applications, 2-4 September 1997,
Conference Publication No. 446, IEE., pp. 433-438.
16. S.H. Alawaji, K.L. Lo (December 1993), "A new approach for solving
the problem of unit commitment", IEE 2nd International Conference on
Advances in Power System Control, Operation and Management, Hongkong,
pp. 571-577.
17. Salem Al-Agtach, Renjeng Su, IEEE fellow - Department of Electrical
and Computer Engineering, University of Colorado, Boulder-Co 80309
(November 1998), "Augmented Lagrangian Approach to Hydro-Thermal
Scheduling", IEEE Transactions on Power Systems, Vol. 13, No. 4.
18. Y. Al-kalaani, F. E. Villaseca, F. Renovich, Jr. (May 1996), "Storage And
Delivery Constrained Unit Commitment", IEEE Transactions on Power
Systems, Vol. 13, No. 3, pp. 1059-1066.
19. U.D. Annakkage, T. Numnonda, N.C. Pahalawaththa (November 1995),
"Unit

Commitment

by

parallel

Simulated

annealing",

IEE

Proc.-

Gener.Transm. Distrib., Vol. 142 No. 6, pp. 595-600.

20. K. Aoki, M. Itoh, T. Satoh, K. Nara, M. Kanezashi (August 1989),
"Optimal Long-term unit commitment in large scale systems include fuel

103

constrained thermal and pumped-storage hydro", IEEE Transactions on

Power Systems, Vol. 4, No. 3., pp. 1065-1073.
21. P. Carpentier, G. Cohen, J. -C. Culioli, A. Renaud (May 1996),
"Stochastic Optimization of Unit Commitment: a New Decomposition
Framework", IEEE Transactions on Power Systems, Vol. 11, No. 2, pp. 10671073.
22. N. Chowdhury, R. Billinton (November 1990), "Unit commitment in
interconnected generating system using a probabilistic technique", IEEE
Transactions on Power Systems, Vol. 5, No. 4, pp. 1231-1238.
23. T.S. Chung, Y.K. Wong, M.H. Wong (1998), "Application of Evolving
Neural Network to Unit Commitment", IEEE Catalogue No: 98EX137 07803-4495-2/98/$10.000, pp. 154-159.
24. Arthur I. Cohen, Gregory Ostrowski (February 1996), "Scheduling units
with multiple operating modes in unit commitment", IEEE Transactions on
Power Systems, Vol. 11, No. 1, pp. 497-503.
25. D.M. Dalabeih, R. N. Allan, "Statistical determination of unit
commitment risk level", pp. 127-130.
26. Dipankar Dasgupta, Douglas R. McGregor (1993), "Short Term UnitCommitment Using Genetic Algorithms", Proc. of the 1993 IEEE Int.'l Conf.
on Tools with AI, Boston, Massachussets, pp. 240-247.
27. D. Dasgupta, D. R. McGregor (September 1994) , "Thermal unit
commitment using genetic algorithms", IEE Proc. -Gener. Transm. Distrib.
Vol. 141, No. 5, pp. 459-465.
28. G. Demartini, T.R. De simone, G.P. Granelli, M. Montagna, K. Robo
(August 1998), "Dual Programming Methods for Large-scale Thermal
Generation Scheduling", IEEE Transactions on Power Systems, Vol. 13, No.
3, pp. 857-863.

104

29. Joseph J. Distefano, Allen R. Stubberud, Ivan J. Williams (1988), Theory

And Problems of Feedback And Control Systems, Schaum's Outline Series,
McGraw-Hill Book Company, Newyork, St Louis, San Francisco, Auckland,
Bogot, Guetemala, Hamburg, Lisbon, London, Madrid, Mexico, Montreal,
New Delhi, Panama, Paris, san Juan, So Paulo, Singapore, Sydney, Tokyo,
Toronto.
30. Electricit de France International (October 1992), EDF Presentation:
Frequency Control In Power Systems, Jakarta.
31. Electric Power Research Institute (1982), Transmission Line Reference
Book 345 kV and Above/Second Edition, Massachusett, New York.
32. J. I. Fan, L. Zhang, J. D. McDonald (February 1996), "Enhanced
Techniques on Sequencial Unit Commitment with Interchange Transactions",
IEEE Transactions on Power Systems, Vol. 11, No. 1, pp. 93-100.
33. Terje Gjengedal, Stale Johansen, Oddbjrn Hansen (1992), "EconomicEnviromental Unit-Commitment (EEUC) - A multicriteria approach", 0-81862760-3/92, pp. 59-64.
34. F. Gubina, B. Strmenik (1991), "An Approach to unit commitment via
Lagrangian relaxation method", CH2964-5/91/0000-1462$01.00 IEEE, pp.
1462-1465.
35. Keith Frearson, Lloyd Tran, Peter Rasmus, Michael Redpath (1993),
North - South 500kV Transmission Line Project - Consultancy With State
Committee For Technical Acceptance - Phase 3 - Stage 1: Operation And
Capability, SECV International Pty Ltd, Pacific Power (International) Pty
Ltd.
36. Keith Frearson, Lloyd Tran, Peter Rasmus, Michael Redpath (1994),
North - South 500kV Transmission Line Project - Consultancy With State

105

Committee For Technical Acceptance - Stage 2: Operation And Capability,

SECV International Pty Ltd, Pacific Power (International) Pty Ltd.
37. John J. Graigner, William D. Stevenson J. (1994), Power system
Analysis, McGraw-Hill, Newyork.
38. E. Handschin, H. Slomski (November 1990), "Unit Commitment in
Thermal Power Systems with Long-Term Energy Constrains", IEEE
Transactions on Power Systems, Vol. 5, No. 5, pp. 1470-1477.
39. Zhao Hongwei, Yi Liangting, Wang Buyun, Cheng Gang, Yang Haiping
(1997), "A New Genetic Algorithm for Unit Commitment", IEEE
International Conference on Intelligent Processing Systems, October 28-31,
Beijing, China, pp. 606-610.
40. Shyh-Jier Huang, Ching-Lien Huang (May 1997), "Application of
Genetic-Based Neural Networks to Thermal Unit Commitment", IEEE
Transactions on Power Systems, Vol. 12, No. 2, pp. 654-660.
41. J. Jantzen, B. Eliasson (1996), "Fuzzy Array Approach to Unit
Commitment", Power System Control and Management, 16-18 April 1996,
Conference Publication No. 421 IEE, pp. 47-51.
42. Kun-Yuan Huang, Hong-Tzer Yang, Ching-Lien Huang (August 1998),
"A New Thermal Unit Commitment Approach Using Constraint Logic
Programming", IEEE Transactions on Power Systems, Vol. 13, No. 3, pp. 936945.
43. Khadim Hussain (1991), "Solution Method for Unit Commitment
Limitations and Utility Constrains", IEEE Computer Applications in Power,
pp. 16-20.
44. Yuan-Yih Hsu, Chung-Ching Su, Chih-Chien Liang, Chia-Jen Lin,
Chiang-Tsung Huang (August 1991), "Dynamic Security constrained Multi-

106

Area unit commitment", Transactions on Power Systems, Vol. 6, No. 3, pp.

1049-1055.
45. Kasangaki V.B.A., Sendaula H.M., Biswas S.K. (August 1995),
"Stochastic Hopfield Artificial Neural Network for Electric Power Production
Costing", IEEE Transactions on Power Systems, Vol. 10, No. 3, pp. 15251533.
46. S. A. Kazarlis, A. G. Bakirtzis, V. Petridis (February 1996), "A Genetic
Algorithm solution to the unit commitment problem", IEEE Transactions on
Power Systems, Vol. 11, No. 1, pp. 83-92.
47. S. A. Kazarlis, A. G. Bakirtzis, V. Petridis (October 1998), "Varying
Fitness Functions in Genetic Algorithm Constrained Optimization: The
Cutting Stock and Unit Commitment Problems", IEEE Transactions on
Systems, Man, and Cybernetics, Vol. 28, No. 5, pp. 629-640.
48. M.E. Khan, R. Billinton (May 1995), "Composite system spinning
reserves assessment in interconnected systems", IEE Proc.-Gener.Transm.
Distrib., Vol. 142 No. 3, pp. 305-309.
49. Prof. D. P. Kothari, Aijaz Ahmad (1993), "An Expert System Approach
to unit Commitment Problem", IEEE TENCO '93/Beijing, pp. 5-8.
50. S. Kuloor, G. S. Hope, O.P. Malik (March 1992), "Environmentally
constrained unit commitment", IEE Proceedings-c, Vol. 139, No. 2, pp. 122128.
51. Shih-Yih Lai, Ross Baldick (February 1999), "Unit Commitment with
Ramp Multipliers", IEEE Transactions on Power Systems, Vol. 14, No. 1, pp.
58-64.
52. Fred N. Lee, Janice Huang, Rambabu Adapa (February 1994), "MultiArea Unit Commitment Via Sequencial Method and A DC Power Flow

107

Network Model", IEEE Transactions on Power Systems, Vol. 9, No. 1, pp.

279-287.
53. Chao-an Li, Philip J. Jap, Dan L. Streiffert (August 1993),
"Implementation of Network Flow Programming to the Hydrothermal
Coordination in an Energy Management System", IEEE Transactions on
Power Systems, Vol. 8, No. 3, pp. 1045-1053.
54. Chao-an Li, Eric Hsu, Alva J. Svoboda, Chung-li Tseng, Raymond B.
Jhonson (February 1997), "Hydro unit commitment in hydro-thermal
optimzation", IEEE Transactions on Power Systems, Vol. 12, No. 2, pp. 764769.
55. Chao-an Li, Raymond B. Johnson, Alva J. Svoboda (February 1998), "A
New Commitment Method", IEEE Transactions on Power Systems, Vol. 12,
No. 1, pp. 113-119.
56. Chao-an Li, Raymond B. Johnson, Alva J. Svoboda, Chung-Li Tseng,
Eric Hsu (August 1998), "A Robust Unit Commitment Algorithm for HydroThermal Optimization", IEEE Transactions on Power Systems, Vol. 13, No. 3,
pp. 1051-1056.
57. S. Li, S.M. Shahidehpour, C. Wang - Department of Electrical and
Computer Engineering Illinois Institute of Technology Chicago, Illinois
60616 (March 1993), "Promoting the application of expert systems in shortterm unit commitment", IEEE Transactions on applied Superconductivity,
Vol. 3, No.1, pp. 286-292.
58. Per Olov Lindberg, Torbjorn Magnusson (December 1989), "The Unit
Commitment Problem: A Dual Approach", Proccedings of the 28th
Conference on Decision and Control, Tampa, Florida, pp. 1127-1130.

108

59. Peter B. Luh, Yajun Wang, Xing Zhao (1998), "Lagrangian Relaxation
Neural Network for Unit Commitment", 0-7803-4403-0/98/$10.00 IEEE, pp.
490-495.
60. Haili Ma, S. M. Shahidehpour (May 1999), "Unit Commitment With
Transmission Security And Voltage Constrains", IEEE Transactions on Power
Systems, Vol. 14, No. 2, pp. 757-764.
61. H. Mantaway, Youssef L. Abdel-Magid, Shokri Z. Selim (1997), "A new
genetic algorithm approach for unit commitment", Genetic Algorithms in
Engineering Systems: Innovations and Applications, 2-4 September 1997,
Conference Publication No. 446, IEE., pp. 215-220.
62. Jos Medina, Victor H. Quintana, Antonio J. Conejo, F. Prez Thoden
(August 1998), "A comparison of Interior-Point Codes for Medium-Term
Hydro-Thermal coordination", EEE Transactions on Power Systems, Vol. 13,
No. 3, pp. 836-843.
63. N. Misra, Y. Baghzouz, (February 1994), "Implementation Of The Unit
Commitment Problem On Supercomputers", IEEE Transactions on Power
Systems, Vol. 9, No. 1, pp. 305-310.
64. Sasan Mokhtari, Jagjit Singh, Bruce Wollenberg (February 1998), "A
Unit Commitment Expert System", IEEE Transactions on Power Systems,
Vol. 3, No. 1, pp. 272-277.
65. Monticelli (1999), State Estimation In Electric Power Systems - A
Generalized

Approach,

Kluwer

Academic

Publishers,

Boston/Dordrecht/London.
66. H. Mantawy, Youssef L. Abdel-Magid, Shokri Z. Selim (February 1998),
"A Simulated Annealing Algorithm For Unit Commitment",

IEEE

Transactions on Power Systems, Vol. 13, No. 1, pp. 197-204.

109

67. Carlos Murillo-Sanchez, Robert J. Thomas (1998), "Thermal Unit

Commitment Including Optimal AC Power Flow Constrains", Proc. 31st
Annual Hawaii International Conference on System Sciences, pp. 81-88.
68. Shmuel S. Oren, Alva J. Svoboda, raymond B. Jhonson (1997),
"Volatility of Unit Commitment in Competitive Electricity Markets", 10603425/97 $10.00 C 1997 IEEE, pp. 594-601.
69. S.O. Orero and M.R. Irving (May 1998), "A genetic algorith modelling
framework and solution technique for short term optimal hydrothermal
scheduling", IEEE Transactions on Power Systems, Vol. 13, No. 2.
70. Z. Ouyang, S. M. Shahidehpour (1992), "A Multi-Stage Intelligent
System for Unit Commitment", IEEE Transactions on Power Systems, Vol. 7,
No. 2, pp. 639-646.
71. Z. Ouyang, S. M. Shahidehpour (May 1991), "Heuristic multi-area unit
commitment with economic dispatch", IEE Proceedings-c, Vol. 138, No. 3,
pp. 242-252.
72. Z. Ouyang, S. M. Shahidehpour (August 1991), "An Intelligent dynamic
programming for unit commitment application", IEEE Transactions on Power
Systems, Vol. 6, No. 3, pp. 1203-1209.
73. William L. Peterson, Steven R. Brammer, Scott O. Elder (1994), "A New
Method for Unit Ramp Rate Processing in Lagrangian Relaxation Unit
Commitment", 0-7803-1794-1/94/$3.00 C 1994 IEEE, pp. 222-224.
74. Lszl Z. Rcz, Bla Bkay (1988), Power System Stability - Studies in
electrical and electronic engineering 30, Elsevier, Amsterdam-Oxford-New
York-Tokyo.
75. Md-Sayeed Salam, Abdul-Razak Hamdan, Khalid Mohamed Nor
(November 1991), "Integrating an Expert System into a Thermal unitcommitment algorithm", IEE Proceedings-c, Vol. 138, No. 6, pp. 553-559.

110

76. Seyedrasoul Saneifard, Nadipuram R. Prasad, Howard A. Smolleck (May

1997), "A Fuzzy Logic Approach to Unit Commitment", IEEE Transactions
on Power Systems, Vol. 12, No. 2, pp. 988-995.
77. H. Sasaki, M. Wantanabe, J. Kubokawa, N. Yorino, R. Yokoyama
(August 1992), "A Solution Method of Unit Commitment by Artificial Neural
Network", Transactions on Power Systems, Vol. 12, No. 2, pp. 974-981.
78. Gerald B. Sheble (February 1990), "Solution of the Unit Commitment
Problem by the Method of Unit Periods", IEEE Transactions on Power
Systems, Vol. 5, No. 1, pp. 257-260.
79. Gerald B. Sheble, George N. Fahd (February 1994), "Unit commitment
literature synopsis", IEEE Transactions on Power Systems, Vol. 9, No. 1, pp.
128-135.
80. Chung-Ching Su, Yuan-Yih Hsu (August 1991), "Fuzzy Dynamic
Programming: an Application to Unit Commitment", IEEE Transactions on
Power Systems, Vol. 6, No. 3, pp. 1231-1237.
81. Socialist Republic Of Vietnam, Ministry of Energy (March 1994), 500kV
Transmission Project - Volumn 2 Stability Analysis Report, Tractebel Energy
Engineering.
82. Samer Takriti, John R. Birge, Erik Long (August 1996), "A Stochastic
Model for the Unit Commitment Problem", IEEE Transactions on Power
Systems, Vol. 11, No. 3, pp. 1497-1508.
83. Carson W. Taylor (1994), Power System Voltage Stability, McGraw-Hill,
Inc., Singapore.
84. S. K. Tong, S. M. Shahidehpour (February 1990), "Hydrothermal Unit
Commitment with Probabilistic Constrains Using Segmentation Method",
IEEE Transactions on Power Systems, Vol. 5, No. 1, pp. 276-282.

111

85. S. K. Tong, S. M. Shahidehpour, Z. Ouyang (August 1991), "A Heuristic

Short-Term Unit Commitment", IEEE Transactions on Power Systems, Vol. 6,
No. 3, pp. 1210-1216.
86. C.-L. Tseng, X.Guan, A.J.Svoboda (July 1998), "Multi-area unit
commitment for large-scale power systems", IEE Proc.-Gener.Transm.
Distrib., vol. 145 No. 4, pp. 415-421.
87. T. Tran-Quoc, Ch. Praing, R. Feuillet, J.C. Sabonnadire, U. La-Van, C.
Nguyen-Duc (2000), "Improvement of voltage stability on the Vietnam power
system", IEEE August 2000.
88. R. E. Tyson, G. T. Heydt (1989), "An Expert System And Dynamic
Programming Hybrid for Unit Commitment", IEEE.
89. Sudhir Virmani, Eugene C. Adrian, karl Imhof, Shishir Mukher Jee
(October 1989), "Implementation of A Lagrangian Relaxation Based Unit
Commitment Problem", IEEE Transactions on Power Systems, Vol. 4, No. 4,
pp. 1373-1380.
90. M. P. Walsh, M.J. O' Malley (November 1997), "Augmented Hopfield
Network for Unit Commitment and Economic Dispatch", IEEE Transactions
on Power Systems, Vol. 12, No. 4, pp. 1765-1774.
91. Wang, S. M. Shahidehpour (August 1994), "Ramp-Rate Limits in Unit
Commitment and Economic Dispatch Incorporating Rotor Fatigue Effect",
IEEE Transactions on Power Systems, Vol. 9, No. 3, pp. 1539- 1545.
92. Kit

Po

Wong

(November

1997),

"Computational

Intelligence

Applications in Unit Commitment, Economic Dispatch and Loadflow",

Proceedings of the 4th International Conference on Advances in Power
System Control, Operation and Management, APSCOM-97, Hong Kong, pp.
54-59.

112

93. Allen J. Wood, Bruce F. Wollenberg (1984), Power generation,

operation, and control, John Wiley & Son, Newyork, Chichester, Brisbane,
Toronto, Singapore.
94. Han Xueshan, Liu Zuo, "Short-Term Thermal Unit Commitment
Including

Reliability

and

Dynamic

Economic

Dispatch",

IEEE

TENCO'93/Beijing, pp. 64-67.

95. Hong-Tzer Yang, Pai-Chuan Yang, Ching-Lien Huang (May 1997), "A
Parallel Genetic Algorithm Approach to Solving the Unit Commitment
Problem: Implementation on the Transputer Networks", IEEE Transactions
on Power Systems, Vol. 12, No. 2, pp. 661-668.
96. Jin-Shyr Yang, Nanming Chen (December 1990), "Unit commitment and
Hydrothermal Generation scheduling By Multi-pass Dynamic programming",
Proceedings of the 29th Conference on Decision and Control, Honolulu,
Hawaii, pp 3075-3076.
97. Zhai, A.M. Breipohl, F.N. Lee, R. Adapa (February 1994), "The Effect of
Load Uncertainty on Unit Commitment Risk", IEEE Transactions on Power
Systems, Vol. 9, No. 1, pp. 510- 517.
98. Fulin Zhuang, F.D. Galiana (May 1988), "Towards and More Rigorous
and Practical Unit Commitment by Lagrangian Relaxation", IEEE
Transactions on Power Systems, Vol. 3, No. 2, pp. 763- 773.
99. . .. (1973), .,
. .
100. . .. (1981), . . .
101. .,

.-.

..

, .. , .. . . -.

113

 .. . (1977), ., "" .
102. . . , . . . (1952),
., . .
103. . .. (1981), ., ,
.

114