Enumerative technique for an extreme point fractional program

DOI10.1016/0377-2217(80)90040-5zbMath0426.90084OpenAlexW2005991301MaRDI QIDQ1136704

Saroj Shivpuri, S. S. Chadha

Publication date: 1979

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(80)90040-5

zbMATH Keywords

convex polyhedronlinear inequalitiesenumerative techniqueextreme point fractional program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32)

Related Items (1)

Bibliography in fractional programming

Cites Work

• Finding all vertices of a convex polyhedron
• Programming with linear fractional functionals
• Hyperbolic programming
• Letter to the Editor—Linear Fractional Functionals Programming
• Extreme Point Mathematical Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerative technique for an extreme point fractional program