Prikaz uporabnosti metod geometrijskega programiranja za reševanje posebnega razreda nelinearnih logističnih problemov : diplomsko delo univerzitetnega študija

Stojan, Tjaša

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

First page > Show document

Show document

Title:	Prikaz uporabnosti metod geometrijskega programiranja za reševanje posebnega razreda nelinearnih logističnih problemov : diplomsko delo univerzitetnega študija
Authors:	ID Stojan, Tjaša (Author) ID Vrančić, Damir (Mentor) More about this mentor... ID Dragan, Dejan (Comentor)
Files:	UNI_Stojan_Tjasa_i2010.pdf (1,27 MB) MD5: 48E6A3084AE2006172FB9DA0CC5F074D PID: 20.500.12556/dkum/d1777a36-ef20-4a19-853e-a6a9ff03db89
Language:	Slovenian
Work type:	Undergraduate thesis
Organization:	FL - Faculty of Logistic
Abstract:	Diplomsko delo prikazuje uporabnost metod geometrijskega programiranja (GP) za reševanje posebnega razreda nelinearnih logističnih problemov. Ti so v praksi zelo pogosti. Če vsebujejo posinomsko nelinearno kriterijsko funkcijo, se velikokrat izkaže uporaba GP metod kot najustreznejša za ugotavljanje optimalnih rešitev. V prvem delu so opisane GP metode za probleme brez omejitev in z omejitvami. Največji poudarek je namenjen pristopu z diferencialnim računom. Pri reševanju vsakega GP problema je potrebno postaviti ustrezno posinomsko kriterijsko funkcijo, ugotoviti morebitne omejitve in določiti stopnjo težavnosti reševanja problema. Probleme je v enostavnejših primerih možno reševati zgolj analitično, pri težjih pa je potrebno kombinirano reševanje, ki terja poleg analitičnih izračunov tudi numerične metode. V drugem delu so prikazani postopki reševanja hipotetičnih in realnih problemov s pomočjo GP metod. Kot je prikazano na primerih, je uporaba metod GP izredno učinkovita pri reševanju širokega spektra nelinearnih problemov, tudi tistih zahtevnejših.
Keywords:	metode geometrijskega programiranja, posinomske funkcije, nelinearni logistični problemi, stopnja težavnosti reševanja problema
Place of publishing:	Celje
Publisher:	[T. Stojan]
Year of publishing:	2010
PID:	20.500.12556/DKUM-16879
UDC:	519.8(043.2)
COBISS.SI-ID:	512257341
NUK URN:	URN:SI:UM:DK:ABTQU0A3
Publication date in DKUM:	29.11.2010
Views:	2663
Downloads:	172
Metadata:
Categories:	FL
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:	English
Title:	A survey of applicability of Geometric programming methods for the purpose of solving of special class of nonlinear logistic problems
Abstract:	This thesis addresses an overview of applicability of Geometric programming (GP) methods for solving special class of nonlinear logistic problems. Latter can often appear in practice. If they contain posynomial nonlinear criterion function, the GP methods are often most convenient for determination of optimal solutions. First part treats the description of GP methods for unconstrained and constrained problems. The main stress is on the treatment of differential calculus approach, where the corresponding posynomial criterion function must be determined, eventual constraints identified and the degree of difficulty of problem solving must be found. In simpler cases, problems can be solved only by means of analytical calculations. In harder cases, the combined approach of solving must be applied, where numerical methods must be also used besides analytical calculations. In second part, procedures of solving of hypothetical and real problems by means of GP methods are shown. The usage of GP methods is very efficient for solving of broader spectrum of nonlinear problems, even those more difficult.
Keywords:	geometric programming methods, posynomial functions, nonlinear logistic problems, degree of difficulty of problem solving, nonlinear optimization

Comments

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back