Linear Programming

Related Fields

Parent Topic:

Computer Science, Mathematics, Mathematical optimization

Child Topic:

Linear-fractional programming, Bellman equation, Minimum-cost flow problem, Blossom algorithm, Multi-objective optimization, 3-dimensional matching, Flux balance analysis, Unimodular matrix, Fletcher's checksum, Perturbation function, Knapsack problem, Optimization problem, Goal programming, Exponential time hypothesis, Transportation theory, Branch and cut, Edmonds–Karp algorithm, Discontinuity layout optimization, Constraint programming, Duality, Ellipsoid method, Geometric combinatorics, Loop optimization, Retiming, Reduced cost, Basic solution, Slater's condition, Barrier function, Euclidean shortest path, Planted motif search, Shortest common supersequence, Constraint satisfaction, Bounding sphere, Stochastic programming, Generalized assignment problem, Linear programming relaxation, Linear complementarity problem, Gomory–Hu tree, Circulation problem, Multi-commodity flow problem, Submodular set function, Lagrange multiplier, Lemke's algorithm, Kantorovich inequality, 1-center problem, Lattice reduction, Polyhedral combinatorics, Feasible region, Equivalent impedance transforms, Linear inequality, h-vector, Pascal matrix, Karmarkar's algorithm, Fenchel's duality theorem, Branch and bound, Successive over-relaxation, Oriented matroid, AMPL, Covering problems, Flow network, Equal-cost multi-path routing, Kravchuk polynomials, Longest common subsequence problem, Big M method, Trapezoid graph, Golden section search, Benders' decomposition, Dantzig–Wolfe decomposition, Bland's rule, Set packing, Matrix splitting, Convex analysis, Epigraph, Revised simplex method, Max-flow min-cut theorem, Assignment problem, Dinic's algorithm, Polytope model, Constraint, Branch and price, Overlapping subproblems, Dynamic programming, Weak duality, LP-type problem, Bregman divergence, Maximum flow problem, Subgradient method, Constraint satisfaction problem, P-complete, Star-shaped polygon, Polytope, Finite element limit analysis, Facility location problem, Least-squares spectral analysis, Metric dimension, Jacobi method, Quasiconvex function, Column generation, Shadow price, Special ordered set, Simplex algorithm, Weapon target assignment problem, Cutting stock problem, Average-case complexity, Engineering analysis, Foster's reactance theorem, Tree sort, Metric k-center, Horn-satisfiability, Strong duality, Unit cube, Power system simulation, Gilbert–Johnson–Keerthi distance algorithm, Convex function, Interior point method, Pentahedron, Interval scheduling, Combinatorial auction, LPBoost, Balanced matrix, Karush–Kuhn–Tucker conditions, Multilevel feedback queue, Gauss–Seidel method, Klee–Minty cube, Algebraic modeling language, Set partitioning in hierarchical trees, Duality gap, Data envelopment analysis, Maximum coverage problem, Worst-case complexity, Shellsort, Cutting-plane method, Hungarian algorithm

Top Authors

Paper Recommendation

1963 Linear Programming and Extensions

1976 A Complexity Measure

1974 Linear Optimal Control Systems

1982 Combinatorial Optimization: Algorithms and Complexity

1986 Theory of Linear and integer Programming

1996 Robust and Optimal Control

1973 Introduction To Linear and Nonlinear Programming

1984 A New Polynomial-time Algorithm For Linear Programming

1998 Atomic Decomposition By Basis Pursuit

1975 Closest-point Problems

1961 A Linear Programming Approach To The Cutting-Stock Problem

2000 Energy Conserving Routing in Wireless Ad-hoc Networks

1960 Decomposition Principle For Linear Programs

1960 On The Shortest Route Through A Network

1977 Design of Optimal Water Distribution Systems

1990 Knapsack Problems: Algorithms and Computer Implementations

1956 The Optimization of A Quadratic Function Subject To Linear Constraints

1989 Introduction To Grey System Theory

1957 Management Models and industrial Applications of Linear Programming