Simplex-like sequential methods for a class of generalized fractional programs

DOI10.1007/s00186-016-0556-yzbMath1359.90070OpenAlexW2483791672MaRDI QIDQ522095

Laura Carosi, Laura Martein, Riccardo Cambini, Ezat Valipour

Publication date: 13 April 2017

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11568/800828

zbMATH Keywords

global optimizationsequential methodsgeneralized fractional programmingpseudoconcavity

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Linear programming (90C05) Convexity of real functions of several variables, generalizations (26B25)

Related Items (2)

Generating the efficient frontier of a class of bicriteria generalized fractional programming ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized convexity and optimization. Theory and applications
• A sequential method for a class of pseudoconcave fractional problems
• A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
• Global optimization of a rank-two nonconvex program
• A sixth bibliography of fractional programming
• The optimal level solutions method
• Fractional Programming

This page was built for publication: Simplex-like sequential methods for a class of generalized fractional programs