برنامه‌ریزی خطی

${\displaystyle minimize{C}^{T}x}$

${\displaystyle minimize{C}^{T}x}$

${\displaystyle Sup(a_i^{T}x|a_i\in {\epsilon }_i)\le b_i}$

${\displaystyle Sup(a_i^{T}x|a_i\in {\epsilon }_i)}$

${\displaystyle ={\overline{a}}_i^{T}x+{\Vert P_i^{T}x\Vert }_2}$

${\displaystyle minimize{C}^{T}x}$

${\displaystyle minimize{C}^{T}x}$

${\displaystyle a_i\sim N({\overline{a}}_i^T,{\mathrm{\Sigma }}_i)}$

${\displaystyle prob(a_i^{T}x\le b_i)=1-Q(\left(\frac{b_i-a_i^{T}x}{{\Vert {\mathrm{\Sigma }}_i^{1/2}x\Vert }_2}\right)}$

${\displaystyle prob(a_i^{T}x\le b_i)=\varphi (\left(\frac{b_i-a_i^{T}x}{{\Vert {\mathrm{\Sigma }}_i^{1/2}x\Vert }_2}\right)}$

${\displaystyle a_i^{T}x+{\varphi }^{-1}(\eta ){\Vert {\mathrm{\Sigma }}_i^{1/2}x\Vert }_2\le b_i}$

${\displaystyle minimize{C}^{T}x}$

• Guidance on Formulating LP problems
• 0-1 Integer Programming Benchmarks with Hidden Optimum Solutions بایگانی‌شده در ۵ مه ۲۰۰۹ توسط Wayback Machine
• Mathematical Programming Glossary
• A Tutorial on Integer Programming
• The linear programming FAQ
• Linear Programming Survey OR/MS Today
• Linear Programming: Guide to Formulation, Simplex Algorithm, Goal Programming and Excel Solver examples
• George Dantzig