Category:Definitions/Linear Programming

From ProofWiki

Jump to navigation Jump to search

This category contains definitions related to Linear Programming.
Related results can be found in Category:Linear Programming.

Linear programming is the branch of mathematical programming which finds optimal solutions of mathematical models whose requirements are represented by linear relationships.

Such optimal solutions may be maximizations or minimizations.

Subcategories

This category has the following 8 subcategories, out of 8 total.

F

Definitions/Feasible Regions‎ (1 C, 2 P)
Definitions/Feasible Solutions‎ (1 P)

G

Definitions/Game Theory‎ (12 C, 72 P)

K

Definitions/Karmarkar's Algorithm‎ (1 P)

O

Definitions/Optimum Solutions‎ (4 P)

S

Definitions/Simplex Method‎ (2 C, 3 P)
Definitions/Slack Variables‎ (1 P)

T

Definitions/Tableaux (Linear Programming)‎ (1 P)

Pages in category "Definitions/Linear Programming"

The following 9 pages are in this category, out of 9 total.

F

G

Definition:Game Theory

K

Definition:Karmarkar's Algorithm

L

Definition:Linear Programming

O

Definition:Optimum Solution

S

T

Definition:Tableau (Linear Programming)

Retrieved from "https://proofwiki.org/w/index.php?title=Category:Definitions/Linear_Programming&oldid=696153"