Abstract
In the paper a dual of a nonlinear fractional functional programming problem has been formulated. This problem can be used to obtain a solution of the mixed 0–1 integer linear programming problem. Some properties related to the primal and dual have been given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal, S. P., and Omparkash, Duality in General Linear Fractional Programming, Cahiers Du Centre D'études De Recherche Opérationnelle,25 (1978), 75–81.
Dorn, W. S., Duality in Quadratic Programming,Quarterly of Applied Mathematics,18 (1960), 155–162.
Kaska, J., Duality in Linear Fractional Programming,Ekonomicko Mathematicky, Obzor.5 (1969), 442–453.
Martos, B., Direct Power of Adjacent Vertex Programming Methods,Management Science,12 (1965), 241–252.
Rutledge, R. W., A Simplex Method for Zero-One Mixed Integer Linear Programs.Journal of Mathematical Analysis and Applications,18 (1967), 377–390.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chadha, S.S. A dual non-linear program. Acta Mathematicae Applicatae Sinica 1, 163–167 (1984). https://doi.org/10.1007/BF01669677
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01669677