Live briefing
Everything about Dual linear program
Mathematical optimization concept
The dual of a given linear program (LP) is another LP that is derived from the original LP in the following schematic way:Each variable in the primal LP becomes a constraint in the dual LP; Each constraint in the primal LP becomes a variable in the dual LP; The objective direction is inversed – maximum in the primal becomes minimum in the dual and vice versa. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Dual linear programA 5-minute orientation
- Skim a recent paper: New Solutions to Delsarte’s Dual Linear ProgramsInfluential work since 2022
- Pick up a classic book: Introduction to operations researchThe most-reprinted book on the subject
- Read the landmark paper: Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling ProblemCited 202 times
- Go sideways: Basic feasible solutionA closely related topic
- Go sideways: Simplex algorithmA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem
Constrained Markov decision processes with total cost criteria: Lagrangian approach and dual linear program
Generalized Linear Programming Solves the Dual
Simultaneous Primal-Dual Right-Hand-Side Sensitivity Analysis from a Strictly Complementary Solution of a Linear Program
The dual of a fractional linear program
On abstract dual linear programs
Optima of dual integer linear programs
Dual of the sum of a linear and linear fractional program
🆕 Influential since 2022
đź“š Books worth reading
Introduction to operations researchFrederick S. Hillier · 1967
Linear programmingRobert J. Vanderbei · 1996
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Fundamentals of Error Correcting CodesW. Cary Huffman, Vera Pless · 2003
Convex AnalysisRalph Tyrrell Rockafellar · 1970
Abstract algebraDavid S. Dummit · 1991
Graph theory with applications to engineering and computer scienceNarsingh Deo, Narsingh Deo · 1974
Mathematical programming at Oberwolfach IIB. H. Korte, M. L. Balinski · 1984
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Basic feasible solution In the theory of linear programming, a basic feasible solution (BFS) is a solution with a minimal set of non-zero variables. Geometrically, each BFS corresponds…
- Simplex algorithm In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived…
- Benders decomposition Benders decomposition (or Benders' decomposition) is a technique in mathematical optimization that allows the solution of very large linear programming…
- Dynamic substructuring Dynamic substructuring (DS) is an engineering tool used to model and analyse the dynamics of mechanical systems by means of its components or substructures…
- Total least squares In applied statistics, total least squares is a type of errors-in-variables regression, a least squares data modeling technique in which observational…
- Karush–Kuhn–Tucker conditions In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes…
- Complex normal distribution In probability theory, the family of complex normal distributions, denoted C N {\displaystyle {\mathcal {CN}}} or N C {\displaystyle {\mathcal {N}}_{\mathcal…
- Linear-fractional programming In mathematical optimization, linear-fractional programming (LFP) is a generalization of linear programming (LP). Whereas the objective function in a linear…