TY - GEN N1 - Mathematical Economics; 2017; Nr 13 (20); s. 59-66 N2 - We provide an alternative proof of the strong duality theorem whose main basis isthe proposition which says that every canonical linear programming minimization problemwhose image under its objective function of the set of feasible solutions is non-empty andbounded below has an optimal solution. Unlike earlier proofs, this proof uses neither thesimplex method nor Farkas’s lemma. We also use this proposition to obtain an independentproof of Farkas’s lemma. L1 - http://dbc.wroc.pl/Content/59093/Lahiri_A_Short_Note_On_Strong_Duality_Without_Sinplex_2017.pdf M3 - artykuł L2 - http://dbc.wroc.pl/Content/59093 PY - 2017 KW - LP problem KW - strong duality KW - Farkas’s lemma C1 - Pewne prawa zastrzeżone na rzecz Autorów i Wydawcy A1 - Lahiri, Somdeb PB - Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu C6 - Dla wszystkich zgodnie z licencją LA - eng CY - Wrocław ID - DOI: 10.15611/me.2017.13.04 T1 - A short note on strong duality : without simplex and withouttheorems of alternatives UR - http://dbc.wroc.pl/dlibra/publication/edition/59093 ER -