Simplex-like sequential methods for a class of generalized fractional programs
DOI10.1007/S00186-016-0556-YzbMATH Open1359.90070OpenAlexW2483791672MaRDI QIDQ522095FDOQ522095
Authors: Riccardo Cambini, Laura Carosi, Laura Martein, 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
Recommendations
Linear programming (90C05) Fractional programming (90C32) Sensitivity, stability, parametric optimization (90C31) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- A sixth bibliography of fractional programming
- Title not available (Why is that?)
- Fractional Programming
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- Generalized convexity and optimization. Theory and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- The optimal level solutions method
- Global optimization of a rank-two nonconvex program
- Title not available (Why is that?)
- A sequential method for a class of pseudoconcave fractional problems
Cited In (7)
- Title not available (Why is that?)
- A sequential method for a class of pseudoconcave fractional problems
- Rank-two programs involving linear fractional functions
- A simplex algorithm for piecewise-linear fractional programming problems
- Title not available (Why is that?)
- Simplex-type algorithm for optimizing a pseudolinear quadratic fractional function over a polytope
- Generating the efficient frontier of a class of bicriteria generalized fractional programming
This page was built for publication: Simplex-like sequential methods for a class of generalized fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522095)
