Projective planeIn mathematics, a projective plane is a geometric structure that extends the concept of a plane. In the ordinary Euclidean plane, two lines typically intersect at a single point, but there are some pairs of lines (namely, parallel lines) that do not intersect. A projective plane can be thought of as an ordinary plane equipped with additional "points at infinity" where parallel lines intersect. Thus any two distinct lines in a projective plane intersect at exactly one point.
Integer programmingAn integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.
Rational pointIn number theory and algebraic geometry, a rational point of an algebraic variety is a point whose coordinates belong to a given field. If the field is not mentioned, the field of rational numbers is generally understood. If the field is the field of real numbers, a rational point is more commonly called a real point. Understanding rational points is a central goal of number theory and Diophantine geometry. For example, Fermat's Last Theorem may be restated as: for n > 2, the Fermat curve of equation has no other rational points than (1, 0), (0, 1), and, if n is even, (–1, 0) and (0, –1).
Duality (projective geometry)In geometry, a striking feature of projective planes is the symmetry of the roles played by points and lines in the definitions and theorems, and (plane) duality is the formalization of this concept. There are two approaches to the subject of duality, one through language () and the other a more functional approach through special mappings. These are completely equivalent and either treatment has as its starting point the axiomatic version of the geometries under consideration.
Nonlinear programmingIn mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints or the objective function are nonlinear. An optimization problem is one of calculation of the extrema (maxima, minima or stationary points) of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear.
HyperbolaIn mathematics, a hyperbola (haɪˈpɜrbələ; pl. hyperbolas or hyperbolae -liː; adj. hyperbolic ˌhaɪpərˈbɒlɪk) is a type of smooth curve lying in a plane, defined by its geometric properties or by equations for which it is the solution set. A hyperbola has two pieces, called connected components or branches, that are mirror images of each other and resemble two infinite bows. The hyperbola is one of the three kinds of conic section, formed by the intersection of a plane and a double cone.
Conic sectionA conic section, conic or a quadratic curve is a curve obtained from a cone's surface intersecting a plane. The three types of conic section are the hyperbola, the parabola, and the ellipse; the circle is a special case of the ellipse, though it was sometimes called as a fourth type. The ancient Greek mathematicians studied conic sections, culminating around 200 BC with Apollonius of Perga's systematic work on their properties. The conic sections in the Euclidean plane have various distinguishing properties, many of which can be used as alternative definitions.
Linear programming relaxationIn mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable. For example, in a 0–1 integer program, all constraints are of the form The relaxation of the original integer program instead uses a collection of linear constraints The resulting relaxation is a linear program, hence the name.
Real projective spaceIn mathematics, real projective space, denoted \mathbb{RP}^n or \mathbb{P}_n(\R), is the topological space of lines passing through the origin 0 in the real space \R^{n+1}. It is a compact, smooth manifold of dimension n, and is a special case \mathbf{Gr}(1, \R^{n+1}) of a Grassmannian space. As with all projective spaces, RPn is formed by taking the quotient of Rn+1 ∖ under the equivalence relation x ∼ λx for all real numbers λ ≠ 0. For all x in Rn+1 ∖ one can always find a λ such that λx has norm 1.
Confocal conic sectionsIn geometry, two conic sections are called confocal if they have the same foci. Because ellipses and hyperbolas have two foci, there are confocal ellipses, confocal hyperbolas and confocal mixtures of ellipses and hyperbolas. In the mixture of confocal ellipses and hyperbolas, any ellipse intersects any hyperbola orthogonally (at right angles). Parabolas have only one focus, so, by convention, confocal parabolas have the same focus and the same axis of symmetry.
