Search for "Linear programming" in article titles:

1. Linear programming: The mathematical discipline devoted to the theory and methods of solving problems about extrema of linear functions on sets of an $n$-dimensional vector space specified by systems of linear inequalities and equations; linear programming is one of the branches ... (Mathematics) [100%] 2023-10-17
2. Linear programming: Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of ... (Method to solve some optimization problems) [100%] 2023-08-27 [Linear programming] [Convex optimization]...
3. Linear programming decoding: In information theory and coding theory, linear programming decoding (LP decoding) is a decoding method which uses concepts from linear programming (LP) theory to solve decoding problems. This approach was first used by Jon Feldman et al. (Decoding method) [81%] 2022-09-04 [Linear programming]
4. Linear programming relaxation: In 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 ... [81%] 2023-04-05 [Linear programming] [Combinatorial optimization]...
5. Linear programming decoding: In information theory and coding theory, linear programming decoding (LP decoding) is a decoding method which uses concepts from linear programming (LP) theory to solve decoding problems. This approach was first used by Jon Feldman et al. (Decoding method) [81%] 2022-11-29 [Linear programming]
6. Linear programming relaxation: In 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 ... [81%] 2024-06-25 [Linear programming] [Combinatorial optimization]...
7. Non-linear programming: The branch of mathematical programming concerned with the theory and methods for solving problems of optimization of non-linear functions on sets given by non-linear constraints (equalities and inequalities). The principal difficulty in solving problems in non-linear programming ... (Mathematics) [81%] 2023-10-11
8. Linear-fractional programming: In mathematical optimization, linear-fractional programming (LFP) is a generalization of linear programming (LP). Whereas the objective function in a linear program is a linear function, the objective function in a linear-fractional program is a ratio of two linear ... [81%] 2024-04-22 [Optimization algorithms and methods] [Linear programming]...
9. Linear Programming Language: Linear Programming Language (LPL) ist eine moderne computer-ausführbare, mathematische Modelliersprache, die dazu verwendet werden kann lineare, nicht-lineare und andere mathematische Modelle zu formulieren. Das System ist geeignet, komplexe Modelle mit zahlreichen Variablen und Beschränkungen zu lösen. [81%] 2024-09-11
10. Sequential linear-quadratic programming: Sequential linear-quadratic programming (SLQP) is an iterative method for nonlinear optimization problems where objective function and constraints are twice continuously differentiable. Similarly to sequential quadratic programming (SQP), SLQP proceeds by solving a sequence of optimization subproblems. [70%] 2023-10-19 [Optimization algorithms and methods]
11. GNU Linear Programming Kit: The GNU Linear Programming Kit (GLPK) is a software package intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the ... (Software) [70%] 2023-07-31 [GNU Project software] [Mathematical optimization software]...
12. Basic solution (linear programming): In linear programming, a discipline within applied mathematics, a basic solution is any solution of a linear programming problem satisfying certain specified technical conditions. For a polyhedron \displaystyle{ P }[/math] and a vector \displaystyle{ \mathbf{x}^* \in \mathbb{R}^n ... (Linear programming) [70%] 2023-09-15 [Linear programming]
13. Hilbert basis (linear programming): The Hilbert basis of a convex cone C is a minimal set of integer vectors such that every integer vector in C is a conical combination of the vectors in the Hilbert basis with integer coefficients. Given a lattice \displaystyle ... (Linear programming) [70%] 2023-04-21 [Linear programming] [Discrete geometry]...