An algorithm for a class of nonlinear fractional problems using ranking of the vertices

DOI10.1007/BF01933719zbMath0683.65048MaRDI QIDQ1824995

Panos M. Pardalos

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

algorithm; global optimization; vertex ranking; quasiconcave nonlinear fractional programming

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

A Fourth bibliography of fractional programming, Enumerative techniques for solving some nonconvex global optimization problems, Global optimization of fractional programs, On the use of optimization models for portfolio selection: A review and some computational results, On some basic notions of fuzzy parametric nonsmooth multiobjective nonlinear fractional programming problems

Cites Work

• Ranking of vertices in the linear fractional programming problem
• Fractional programming: Applications and algorithms
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Methods for Global Concave Minimization: A Bibliographic Survey
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
• Solving the Fixed Charge Problem by Ranking the Extreme Points