Linear programming with inequality constraints via entropic perturbation
A dual convex programming approach to solving linear programs with inequality constraints through entropic perturbation is derived. The amount of perturbation required depends on the desired accuracy of the optimum. The dual program contains only non-positivity constraints. An ϵ-optimal solution to...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Wiley
1996-01-01
|
| סדרה: | International Journal of Mathematics and Mathematical Sciences |
| נושאים: | |
| גישה מקוונת: | http://dx.doi.org/10.1155/S0161171296000257 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|