Monday, April 26, 2010

9 am...G3 (26 apr)

Salam...

Kenangan aku dan optimize...

soalan wajib:-

network
- shortest path
- minimmal spanning tree
- maximal flow

soalan pilihan. Jawab 3 daripada 4 soalan:-

1. Integer programming
2. Duality
3. Non-Linear programming
4. Simplex method (maximization)

Integer programming ni pasal 'the branch and bound method'. Firstly kenalah pandai construct objective fx= maximize,Z. Then, kena ada subject to constraints: bla..bla..bla...pastu kena nyatakan X1X2.
Lepas tu, selesaikan...malas cerita panjang-panjang.huhu


p/s: alamak bz nak stdy la...yang len2 tu esok nak muntahkan kat paper...so xjadi lah nak taip kat sni...ok2...tatatititutu~

4 klik dan komen :):

no_cha said...

dh2...pi studi..n rajin2 belajar masak..ak dh puji ko dh..hehehehehehehehehhehehehehe(ketawa golek2+sopan2)

Afie said...

hheheehe...sopan sungguh ko gelak yerrr...heee...okaii akak..saya akan stdy rerajen...saya nak jd mcm ax boleh x???hahahaha...=P

hana zira said...

non-liner programming???
aku cme belajar linear programming jek=D
huhu

Afie said...

hehehe..tu pon ak blaja gak...kna wat graf bagai la..mlas seh..xpe da abes da pon..hehe