×
Chadha, S. S.

A dual non-linear program. (English) Zbl 0583.90096

Acta Math. Appl. Sin., Engl. Ser. 1, 163-167 (1984).
A dual to a quadratic/linear fractional programming problem is formulated and three duality theorems are proved.
Reviewer: R.Lepp

Cited in 1 Document

MSC:

90C32 Fractional programming
49N15 Duality theory (optimization)
90C11 Mixed integer programming

Keywords:

duality; quadratic/linear fractional programming; duality theorems
Cite Review PDF
Full Text: DOI

References:

[1] Aggarwal, S. P., and Omparkash, Duality in General Linear Fractional Programming, Cahiers Du Centre D’études De Recherche Opérationnelle,25 (1978), 75–81.
[2] Dorn, W. S., Duality in Quadratic Programming,Quarterly of Applied Mathematics,18 (1960), 155–162. · Zbl 0101.37003
[3] Kaska, J., Duality in Linear Fractional Programming,Ekonomicko Mathematicky, Obzor.5 (1969), 442–453.
[4] Martos, B., Direct Power of Adjacent Vertex Programming Methods,Management Science,12 (1965), 241–252. · Zbl 0142.17002 · doi:10.1287/mnsc.12.3.241
[5] Rutledge, R. W., A Simplex Method for Zero-One Mixed Integer Linear Programs.Journal of Mathematical Analysis and Applications,18 (1967), 377–390. · Zbl 0211.52103 · doi:10.1016/0022-247X(67)90065-0
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.