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

DOI10.1007/BF01933719zbMath0683.65048OpenAlexW1984257762MaRDI QIDQ1824995

Panos M. Pardalos

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933719

zbMATH Keywords

algorithmglobal optimizationvertex rankingquasiconcave nonlinear fractional programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

A mathematical programming approach to sample coefficient of variation with interval-valued observations, On the use of optimization models for portfolio selection: A review and some computational results, Enumerative techniques for solving some nonconvex global optimization problems, A global optimization algorithm for solving the minimum multiple ratio spanning tree problem, A Fourth bibliography of fractional programming, A DEA ranking method based on cross-efficiency intervals and signal-to-noise ratio, On some basic notions of fuzzy parametric nonsmooth multiobjective nonlinear fractional programming problems, Global optimization of fractional programs, Global optimization for a class of 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