A Note on Duality Theorem for a Nonlinear Programming Problem

Davinder Bhatia
Additional contact information
Davinder Bhatia: University of Delhi, India

Management Science, 1970, vol. 16, issue 9, 604-606

Abstract: S. M. Sinha has formulated a stochastic linear programming problem as a deterministic non linear program, and has shown how to solve this program by solving its dual [1]. Our note extends Sinha's result, by dropping the restriction that the primal constraint set be bounded, and simplifies some of his proofs.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.9.604 (application/pdf)

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:inm:ormnsc:v:16:y:1970:i:9:p:604-606

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().