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 mathematical programming (also known as mathematical optimization). Linear programs are problems that can be expressed in canonical form as
- Comment
- enLinear 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 mathematical programming (also known as mathematical optimization). Linear programs are problems that can be expressed in canonical form as
- Depiction
- Has abstract
- enLinear 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 mathematical programming (also known as mathematical optimization). 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. Its objective function is a real-valued affine (linear) function defined on this polyhedron. A linear programming algorithm finds a point in the polytope where this function has the smallest (or largest) value if such a point exists. Linear programs are problems that can be expressed in canonical form as Here the components of x are the variables to be determined, c and b are given vectors (with indicating that the coefficients of c are used as a single-row matrix for the purpose of forming the matrix product), and A is a given matrix. The function whose value is to be maximized or minimized ( in this case) is called the objective function. The inequalities Ax ≤ b and x ≥ 0 are the constraints which specify a convex polytope over which the objective function is to be optimized. In this context, two vectors are comparable when they have the same dimensions. If every entry in the first is less-than or equal-to the corresponding entry in the second, then it can be said that the first vector is less-than or equal-to the second vector. Linear programming can be applied to various fields of study. It is widely used in mathematics and, to a lesser extent, in business, economics, and some engineering problems. Industries that use linear programming models include transportation, energy, telecommunications, and manufacturing. It has proven useful in modeling diverse types of problems in planning, routing, scheduling, assignment, and design.
- Is primary topic of
- Linear programming
- Label
- enLinear programming
- Link from a Wikipage to an external page
- plato.asu.edu/bench.html
- books.google.com/books%3Fhl=en&lr=&id=ZpYca36h464C&oi=fnd&pg=PA24&dq=%22Maximization+of+a+linear+function+of+variables+subject+to+linear+inequalities%22&ots=0viWRKQVGk&sig=25NCv3tDYjTLYxCxn9deMWBn8VE
- books.google.com/books%3Fid=oQdBzXhZeUkC&printsec=frontcover%23v=onepage&q&f=false
- books.google.com/books%3Fid=RAUyB8NDHJwC&printsec=frontcover%23v=onepage&q&f=false
- books.google.com/books%3Fid=YJRh0tOes7UC&printsec=frontcover%23v=onepage&q&f=false
- archive.org/details/computationalgeo00berg
- www.cas.mcmaster.ca/~terlaky/files/dut-twi-94-73.ps.gz
- glossary.computing.society.informs.org/
- lpsolve.sourceforge.net/4.0/LinearProgrammingFAQ.htm
- people.brunel.ac.uk/~mastjjb/jeb/or/lp.html
- www.maths.ed.ac.uk/~gondzio/CV/oxford.ps
- www.maths.ed.ac.uk/~gondzio/CV/oxford.ps%7Cid=
- onlinelibrary.wiley.com/doi/abs/10.1002/sapm1941201224
- Link from a Wikipage to another Wikipage
- Abundance of the chemical elements
- Affine function
- AIMMS
- Albert W. Tucker
- Algebraic modeling language
- ALGLIB
- Algorithm
- AMPL
- Analytica (software)
- Apache License
- API
- APMonitor
- Approximation algorithm
- Approximation algorithms
- Artelys Knitro
- Assignment problem
- Automated planning and scheduling
- Benders' decomposition
- Block diagram
- Block matrix
- Branch and bound
- Branch and cut
- Branch and price
- BSD licenses
- Canonical form
- Cassowary constraint solver
- Category:Convex optimization
- Category:Geometric algorithms
- Category:Linear programming
- Category:P-complete problems
- Christos H. Papadimitriou
- COIN-OR CLP
- Combinatorial optimization
- Comparability
- Concave function
- Constraint (mathematics)
- Convex function
- Convex polytope
- Convex programming
- Convex set
- Copyleft
- Covering problem
- CPLEX
- Criss-cross algorithm
- Cutting-plane method
- Dantzig–Wolfe decomposition
- David S. Johnson
- Delayed column generation
- Dominating set problem
- Dual linear program
- Dual problem
- Dynamical system
- Dynamic programming
- Economics
- Economist
- Ellipsoid method
- Feasible region
- FICO Xpress
- File:3dpoly.svg
- File:JohnvonNeumann-LosAlamos.gif
- File:Leonid Kantorovich 1975.jpg
- File:Linear optimization in a 2-dimensional polytope.svg
- File:Linear Programming Feasible Region.svg
- Flow network
- FortMP
- Fourier–Motzkin elimination
- Fractional coloring
- Frank Lauren Hitchcock
- Game theory
- Gekko (optimization software)
- General Algebraic Modeling System
- George B. Dantzig
- George Dantzig
- Global maximum
- Global minimum
- GLOP
- GNU Linear Programming Kit
- GNU MathProg
- Graph (discrete mathematics)
- Graph diameter
- Günter M. Ziegler
- Half-space (geometry)
- Hirsch conjecture
- IMSL Numerical Libraries
- Independent set (graph theory)
- Independent set problem
- Input–output model
- Integer programming
- Interior point method
- Interior-point method
- Intersection (mathematics)
- Iterative method
- Job shop scheduling
- John von Neumann
- Joseph Fourier
- Karp's 21 NP-complete problems
- Klee–Minty cube
- Least absolute deviations
- Least-squares spectral analysis
- Leonid Kantorovich
- Leonid Khachiyan
- LINDO
- Linear
- Linear algebra
- Linear equality
- Linear-fractional programming (LFP)
- Linear function
- Linear functional
- Linear inequality
- Linear production game
- Linear programming relaxation
- Lingo (programming language)
- Local maximum
- Local minimum
- LP-type problem
- Manfred W. Padberg
- Maple (software)
- Mark Overmars
- Matching (graph theory)
- Mathcad
- Mathematica
- Mathematical model
- Mathematical optimization
- Mathematical programming
- Mathematician
- MATLAB
- Matrix (mathematics)
- Matrix multiplication
- Maximum principle
- Michael R. Garey
- Microeconomics
- Microsoft Excel
- MINTO
- MIT License
- Mixed integer programming
- MOSEK
- Multi-commodity flow problem
- NAG Numerical Library
- Narendra Karmarkar
- Naum Z. Shor
- Network flow problem
- Nobel prize in economics
- Nonlinear programming
- NP-hard
- Numerical Algorithms Group
- Objective function
- Observable universe
- Odysseus
- Operations research
- Optimization Toolbox
- OptimJ
- Oriented matroid
- P (complexity)
- Packing problem
- Permissive free software licence
- Polyhedron
- Polynomial time
- Polynomial-time
- Polytope
- Proceedings of the USSR Academy of Sciences
- Profit maximization
- Projective method
- Proprietary software
- Pyomo
- Qoca
- Quadratically constrained quadratic program
- Quadratic programming
- Real number
- Routing
- R-Project
- SAS System
- Scheduling (production processes)
- SCIP (optimization software)
- Semidefinite programming
- Sequential quadratic programming
- Set cover problem
- Set packing
- Shadow price
- Simplex algorithm
- Simplex method
- Slack variable
- Smale's problems
- SOCP
- Soviet Union
- Springer-Verlag
- Stephen Smale
- Stochastic programming
- Strong duality
- SuanShu numerical library
- Submodular
- Time complexity
- Tjalling Koopmans
- TOMLAB
- Total dual integrality
- Totally unimodular
- Totally unimodular matrix
- Traveling salesman problem
- Unit cube
- USSR
- Variable (programming)
- Vector space
- Vertex cover problem
- VisSim
- Weak duality
- What'sBest
- World War II
- Worst-case complexity
- XPRESS
- Yinyu Ye
- SameAs
- 4035816-1
- Doğrusal programlama
- Lineaarprogrammeerimine
- Lineær programmering
- Lineær programmering
- Lineair programmeren
- Lineare Optimierung
- Lineáris optimalizálás
- Lineární programování
- Linearno programiranje
- Linearno programiranje
- Linearno programiranje
- Linear programming
- Lineêre programmering
- Linjärprogrammering
- m.0byrz
- Optimisation linéaire
- Programação linear
- Programació lineal
- Programación lineal
- Programación linear
- Programación llinial
- Programare liniară
- Programazio lineal
- Program linear
- Programmazione lineare
- Programowanie liniowe
- Prugrammazzioni liniàri
- Q202843
- Quy hoạch tuyến tính
- wRtH
- Xətti proqramlaşdırma
- Γραμμικός προγραμματισμός
- Линеарно програмирање
- Линейлĕ программăлани
- Линейное программирование
- Лінейнае праграмаванне
- Лінійне програмування
- Сызықтық бағдарламалау
- Գծային ծրագրավորում
- תכנון ליניארי
- برمجة خطية
- برنامهریزی خطی
- لکیری برمجہ
- پڕۆگرامی ھێڵی
- रैखिक क्रमादेशन
- രേഖീയ ഉത്തമീകരണം
- กำหนดการเชิงเส้น
- 線型計画法
- 线性规划
- 선형 계획법
- SeeAlso
- List of numerical analysis topics
- Subject
- Category:Convex optimization
- Category:Geometric algorithms
- Category:Linear programming
- Category:P-complete problems
- Thumbnail
- WasDerivedFrom
- Linear programming?oldid=1119213709&ns=0
- WikiPageLength
- 58400
- Wikipage page ID
- 43730
- Wikipage revision ID
- 1119213709
- WikiPageUsesTemplate
- packing-problem pairs
- Template:Authority control
- Template:Citation needed
- Template:Cite book
- Template:Cite Gartner Matousek 2006
- Template:Cite journal
- Template:Colbegin
- Template:Colend
- Template:Commonscat
- Template:Div col
- Template:Div col end
- Template:For
- Template:Further
- Template:Isbn
- Template:Library resources box
- Template:Main
- Template:Mathematical programming
- Template:Optimization algorithms
- Template:Reflist
- Template:See also
- Template:Short description
- Template:Slink
- Template:Snd
- Template:Unsolved
