Fractional programming - a survey (Q1106105)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fractional programming - a survey |
scientific article; zbMATH DE number 4061019
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fractional programming - a survey |
scientific article; zbMATH DE number 4061019 |
Statements
Fractional programming - a survey (English)
0 references
1988
0 references
A fractional program maximizes or minimizes a ratio of two linear, or nonlinear, functions. Such programs arise, Upr. 8, 105-114 (1986). A game of planar pursuit with dynamics described by the equations \(\dot x^ i=v^ i \cos \phi^ i\), \(\dot\phi^ i=u^ i\) \((i=1,2)\), and \(\dot y^ i=v^ i \sin \phi^ i\), \(v^ 1>v^ 2\), \(| u^ i| \leq \bar u^ i<\infty\) is considered. Attainability functions are constructed and an optimal closed-looped strategy for the pursuer is found.
0 references
.
0 references
planar pursuit
0 references
Attainability functions
0 references
optimal closed-looped strategy
0 references