Nonlinear one‐parametric linear programming and t‐norm transportation problems

Axel Wüstefeld and Uwe Zimmermann

Naval Research Logistics Quarterly, 1980, vol. 27, issue 2, 187-197

Abstract: Previous methods for solving the nonlinear one‐parametric linear programming problem min {c(t)Tx |Ax = b, x ≥ 0} for t ϵ [α,β] were based on the simplex method using a considerably extended tableau. The proposed method avoids such an extension. A finite sequence of feasible bases (Bk | k = 1, 2, …, r) optimal in [tk, tk+1] for k = 1, 2, …,r with α = t1

Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800270203

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:27:y:1980:i:2:p:187-197

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().