Solution Sets of Convex Programs Related to Chemical Equilibrium Problems

1 February 1973

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 21 (1) , 240-246
https://doi.org/10.1287/opre.21.1.240

Abstract

We consider the program (I) infF(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.

Keywords

This publication has 0 references indexed in Scilit: