LINEAR PROGRAMMING APPLIED TO A CONVEX PROGRAMMING TYPE
In the present’s paper studying a strategy for a typo of convex problem, we treat a linear programming problem whose coefficient of decision variables in the objective function has a nonlinear behavior. When the coefficients are constant the Simplex Method solves these problems without much difficul...
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Espanhol |
| Baskı/Yayın Bilgisi: |
Universidad Nacional Mayor de San Marcos
2014-09-01
|
| Seri Bilgileri: | Pesquimat |
| Konular: | |
| Online Erişim: | http://revistasinvestigacion.unmsm.edu.pe/index.php/matema/article/view/9611 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|
