What is linear programming? I asked this question on Stack Overflow but it was closed as "not programming related". So I think this is probably the best place for it...

I read over the wikipedia article, but it seems to be beyond my comprehension. It says it's for optimization, but how is it different than any other method for optimizing things?
An answer that introduces me to linear programming so I can begin diving into some less beginner-accessible material would be most helpful.
 A: BlueRaja's answer is certainly more complete than this one (and gives good references), but here's a rough overview of linear programming.  Suppose that you have a linear function (in high school courses, it's typically a function of two variables) that you want to optimize on a convex "feasible" region bounded by linear equations (again, in high school, the bounds are typically described using linear inequalities in two variables).
Because the function to optimize is linear, the set of points for which the function has a particular value, say c, is a line (and all such lines are parallel) and the value of the function anywhere to one side of the line is greater than c and anywhere to the other side of the line is less than c.  So, you can think about moving through this set of constant-value lines to increase/decrease the value of the target function as appropriate to optimize it.
Since the feasible region is bounded by linear equations, as the constant-value line moves through and out of the feasible region, it last touches the feasible region at a vertex (or possibly at all points on an edge connecting two vertices), so the optimal solution must occur at a vertex of the feasible region.
Given all that, linear programming comes down to evaluating the target function at all the vertices of the feasible region to find the optimal value.
A: I suggest you this article, which talks about Linear Equations, Linear Programming, Integer Programming and P=NP. It's easy to understand and talks about the differences among these things
A: The standard form (and example) sections pretty well describe what it is.

How is it different than any other method for optimizing things?

It's, well, just another method.  However, it is somewhat special in that many other optimization algorithms either use linear programming as part of their solution, or are in reality a specialized solution to a linear programming problem.  In fact, integer linear programming is NP-complete, meaning that any problem in NP can be stated as an (integer) linear programming problem.
(this also means solving your typical integer linear programming problem is much more difficult than if we didn't restrict ourselves to integers..)
