| 000 | 02468cam a2200337 i 4500 | ||
|---|---|---|---|
| 001 | 11311881 | ||
| 003 | EG-ScBUE | ||
| 005 | 20241217092931.0 | ||
| 008 | 131128s2003 ne a f b 001 0 eng d | ||
| 020 | _a9781461348221 | ||
| 040 |
_aWaSeSS _beng _erda _cEG-ScBUE _dEG-ScBUE |
||
| 082 | 0 | 4 |
_a519.72 _222 _bBAJ |
| 100 | 1 |
_aBajalinov, Erik B., _eauthor. _938118 |
|
| 245 | 1 | 0 |
_aLinear-fractional programming theory, methods, applications and software / _cErik B. Bajalinov, senior research fellow, Depatment of Computer Science, Institute of Informatics, Debrecen University, Hungary |
| 264 | 1 |
_aDordrecht : _bSpringer Science + Business Media, _c2003. |
|
| 300 |
_axxvii, 423 pages : _billustrations ; _c23 cm. |
||
| 336 |
_2rdacontent _atext _btxt |
||
| 337 |
_aunmediated _2rdamedia _bn |
||
| 338 |
_avolume _bnc _2rdacarrier |
||
| 490 | 0 |
_aApplied Optimization, _x1384-6485 ; _v84 |
|
| 504 | _aIncludes bibliographical references and index. | ||
| 506 | _aLicense restrictions may limit access. | ||
| 520 | _aThis is a book on Linear-Fractional Programming (here and in what follows we will refer to it as "LFP"). The field of LFP, largely developed by Hungarian mathematician B. Martos and his associates in the 1960's, is concerned with problems of op timization. LFP problems deal with determining the best possible allo cation of available resources to meet certain specifications. In particular, they may deal with situations where a number of resources, such as people, materials, machines, and land, are available and are to be combined to yield several products. In linear-fractional programming, the goal is to determine a per missible allocation of resources that will maximize or minimize some specific showing, such as profit gained per unit of cost, or cost of unit of product produced, etc. Strictly speaking, linear-fractional programming is a special case of the broader field of Mathematical Programming. LFP deals with that class of mathematical programming problems in which the relations among the variables are linear: the con straint relations (i.e. the restrictions) must be in linear form and the function to be optimized (i.e. the objective function) must be a ratio of two linear functions. | ||
| 650 | 7 |
_aLinear programming. _2BUEsh |
|
| 650 | 7 |
_aMathematical optimization. _2BUEsh |
|
| 650 | 7 |
_aOperations research. _2BUEsh |
|
| 651 | _2BUEsh | ||
| 653 |
_bENGGEN _cJune2015 |
||
| 655 |
_vReading book _934232 |
||
| 942 |
_2ddc _cBB |
||
| 999 |
_c19488 _d19460 |
||