Search results
Results From The WOW.Com Content Network
Linear fractional transformations leave cross ratio invariant, so any linear fractional transformation that leaves the unit disk or upper half-planes stable is an isometry of the hyperbolic plane metric space. Since Henri Poincaré explicated these models they have been named after him: the Poincaré disk model and the Poincaré half-plane model.
A linear program can be regarded as a special case of a linear-fractional program in which the denominator is the constant function 1. Formally, a linear-fractional program is defined as the problem of maximizing (or minimizing) a ratio of affine functions over a polyhedron ,
In mathematical optimization, fractional programming is a generalization of linear-fractional programming. The objective function in a fractional program is a ratio of two functions that are in general nonlinear. The ratio to be optimized often describes some kind of efficiency of a system.
The modular group Γ is the group of fractional linear transformations of the complex upper half-plane, which have the form + +, where ,,, are integers, and =.The group operation is function composition.
Formally, a real projective line P(R) is defined as the set of all one-dimensional linear subspaces of a two-dimensional vector space over the reals. The automorphisms of a real projective line are called projective transformations, homographies, or linear fractional transformations. They form the projective linear group PGL(2, R).
In LP the objective function is a linear function, while the objective function of a linear–fractional program is a ratio of two linear functions. In other words, a linear program is a fractional–linear program in which the denominator is the constant function having the value one everywhere. A linear–fractional program can be solved by a ...
More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Its feasible region is a convex polytope , which is a set defined as the intersection of finitely many half spaces , each of which is defined by a linear inequality.
which are called homographic functions or linear fractional transformations. In the case of the complex projective line, which can be identified with the Riemann sphere, the homographies are called Möbius transformations. These correspond precisely with those bijections of the Riemann sphere that preserve orientation and are conformal. [3]