A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
From MaRDI portal
Publication:992571
DOI10.1016/J.EJOR.2010.03.047zbMATH Open1205.90277OpenAlexW2068030353MaRDI QIDQ992571FDOQ992571
Authors: Riccardo Cambini, Claudio Sodini 
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.047
Recommendations
- A unifying approach to solve a class of rank-three programs involving linear and quadratic functions
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- scientific article; zbMATH DE number 1664572
- A finite algorithm for a class of nonlinear multiplicative programs
- Linear multiplicative programming
Cites Work
- Fractional Programming
- Generalized convexity and optimization. Theory and applications
- A finite algorithm for a class of nonlinear multiplicative programs
- Finite algorithm for generalized linear multiplicative programming
- A unifying approach to solve a class of parametrically-convexifiable problems
- Title not available (Why is that?)
- The optimal level solutions method
- Title not available (Why is that?)
Cited In (14)
- A criterion space algorithm for solving linear multiplicative programming problems
- Global optimization algorithm for solving linear multiplicative programming problems
- A mathematical programming approach to sample coefficient of variation with interval-valued observations
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
- Global algorithm for solving linear multiplicative programming problems
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- A parametric solution algorithm for a class of rank-two nonconvex programs
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Pseudoconvexity on a closed convex set: an application to a wide class of generalized fractional functions
- Parametric linear fractional programming for an unbounded feasible region
- Simplex-like sequential methods for a class of generalized fractional programs
This page was built for publication: A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992571)
