Talk:Dual linear program

Strange sentence

The weak duality theorem states that the optimum of the dual LP at any feasible solution is always a bound on the optimum of the primal LP at any feasible solution

What is optimum of ANY solution? Optimum exists for problem, for function, but for solution... Strange thing. Do you mean '... the value of the dual LP at any feasible solution is always a bound on the value of the primal LP at any feasible solution? Jumpow (talk) 16:51, 20 April 2019 (UTC)

Another strange statement

$y_{L}+F_{2}\cdot y_{F}+P_{2}\cdot y_{P}\geq S_{2}$

(the farmer must receive no less than S₂ for his barley)

On the right = cost of product

On the left side - spends (cost of used resource * amount of resource).

So unequality says: spends > cost

But what means statement must receive no less than, if it is spends?

Jumpow (talk) 19:27, 20 April 2019 (UTC)

Theoretic application

If we are going to use the word application, the heading should specify what it is an application to.

Theoretical application in complexity theory — Preceding unsigned comment added by 2A01:CB0C:CD:D800:4DE8:372D:3152:B1BD (talk) 10:57, 6 February 2020 (UTC)

Theoretical implications

The section states that the weak duality theorem implies that finding a single feasible solution is as hard as finding an optimal feasible solution. However, it seems to me that the argument "If the combined LP has no feasible solution, then the primal LP has no feasible solution either." requires the strong duality theorem. — Preceding unsigned comment added by Hkoehlernz (talk • contribs) 01:38, 7 April 2022 (UTC)

Standard form

Near the end of the article the term "standard form" is introduced. The articel should explain what "standard form" is or at least add a link to its definition. — Preceding unsigned comment added by 46.147.36.113 (talk) 20:19, 26 June 2022 (UTC)