Solution Sets of Convex Programs Related to Chemical Equilibrium Problems

K. O. Kortanek, W. O. Rom and A. L. Soyster
Additional contact information
K. O. Kortanek: Carnegie-Mellon University, Pittsburgh, Pennsylvania
W. O. Rom: University of Illinois, Urbana, Illinois
A. L. Soyster: The Pennsylvania State University, University Park, Pennsylvania

Operations Research, 1973, vol. 21, issue 1, 240-246

Abstract: We consider the program (I) inf F ( x ), subject to x ∈ H and Ax = b , where H is any convex set in the positive orthant, A is any m × n matrix, b is any m -vector, and F is convex and continuous on H . A subsidiary program is used to study the nature of the constraint set and optimal solution set of program (I). The method used involves classifying duality states of the program with respect to duality states of its subsidiary program. Extensions are thereby obtained of Bigelow-DeHaven-Shapiro results [ SIAM J. Appl. Math. 18, 768–775 (1970)] on the set of solutions to chemical equilibrium problems. An example of Bigelow and Shapiro is given illustrating the states by means of a simple, ideal, one-phase chemical-equilibrium problem in two dimensions.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.240 (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:oropre:v:21:y:1973:i:1:p:240-246

Access Statistics for this article

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