|
Nyíregyházi Egyetem Tudományos Elektronikus Adattár >
Természettudományi és Informatikai Kar >
Matematika és Informatika Intézet >
Matematika Intézet - Konferencia előadások >
Ezzel az azonosítóval hivatkozhat erre a dokumentumra forrásmegjelölésben vagy hiperhivatkozás esetén:
https://tea.nye.hu/handle/123456789/291
|
| Besorolás: | Lecture |
| Jelleg: | Scientific |
| Szerzők: | Bajalinov, Erik |
| Cím: | LFP vs LP: comparative analysis of two optimization approaches |
| Konferencia címe: | Challenges for Analysis of the Economy, the Businesses, and Social Progress |
| Megrendező szervezet: | Szeged University |
| Ország: | Hungary |
| Város: | Szeged |
| Konferencia típusa: | International |
| Konferencia kezdete: | 19-nov-2009 |
| Konferencia vége: | 21-nov-2009 |
| Nyelv: | en |
| URI : | http://hdl.handle.net/123456789/291 |
| Kulcsszavak: | LP LFP |
| Absztrakt: | Like a linear programming (LP) problem, linear-fractional programming (LFP) problem can be usefully applied in a wide range of real-world applications. In the last few decades (starting from pioneer paper of B. Martos in 1960's) a lot of research papers and monographs were published throughout the world where authors (mainly mathematicians) investigated different theoretical and algorithmical aspects of LFP problems in various forms.
In contrast with keen interest of mathematical community, economists and practitioners unfortunately do not demonstrate
any considerable interest towards LFP. Moreover there is an opinion spread in certain groups of economists and practitioners that LFP is "superfluous" in general.
In this paper we consider these two approaches to optimization (based on linear and linear-fractional objective functions on the same feasible set) and compare results they lead to. We show that in certain cases both approaches are closely connected with one another and may be fruitfully utilized simultaneously. |
| Ebben a gyűjteményben: | Matematika Intézet - Konferencia előadások
|
Minden dokumentum, ami a TEA rendszerben szerepel, szerzői jogokkal védett. Minden jog fenntartva!
|