Duality results are established in convex programming with the set-inclusive constraints studied by Soyster. The recently developed duality theory for generalized linear programs by Thuente is further generalized and also brought into the framework of Soyster's theory. Convex programming with set-inclusive constraints is further extended to fractional programming.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Soyster, L. A.,Convex Programming with Set-Inclusive Constraints and Application to Inexact Linear Programming, Operations Research, Vol. 2, pp. 1154–1157, 1973.
Soyster, L. A.,A Duality Theory for Convex Programming with Set-Inclusive Constraints, Operations Research, Vol. 22, pp. 892–898, 1974.
Soyster, L. A.,Erratum, Operations Research, Vol. 22, pp. 1279–1280, 1974.
Falk, E. J.,Exact Solutions of Inexact Linear Programs, Operations Research, Vol. 24, pp. 783–787, 1976.
Thuente, J. D.,Duality Theory for Generalized Linear Programs with Computational Methods, Operations Research, Vol. 28, pp. 1005–1011, 1980.
Dantzig, B. G.,Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963.
Schaible, S.,Duality in Fractional Programming: A Unified Approach, Operations Research, Vol. 24, pp. 452–461, 1976.
Manas, M.,On Transformation of Quasi-Convex Programming Problems Ekonomicko Matematicky Obzor, Vol. 1, pp. 93–99, 1968.
Communicated by G. Leitmann
About this article
Cite this article
Singh, C. Convex programming with set-inclusive constraints and its applications to generalized linear and fractional programming. J Optim Theory Appl 38, 33–42 (1982). https://doi.org/10.1007/BF00934321
- Duality theory
- convex programming
- set-inclusive constraints
- generalized linear programming
- fractional programming