Generalized linear multiplicative and fractional programming
From MaRDI portal
Publication:2277368
DOI10.1007/BF02283691zbMath0725.90082OpenAlexW2058469120MaRDI QIDQ2277368
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02283691
global optimizationparametric programmingproduct of two linear functionssequence of convex programming problems
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Convex programs with an additional constraint on the product of several convex functions, A fifth bibliography of fractional programming*, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, An outcome-space finite algorithm for solving linear multiplicative programming, Finite algorithm for generalized linear multiplicative programming, Multiplicative programming problems: Analysis and efficient point search heuristic, Sparse minimax portfolio and Sharpe ratio models, A branch-and-reduce approach to global optimization, Global minimization of a generalized linear multiplicative programming, Range division and linearization algorithm for a class of linear ratios optimization problems, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, Unnamed Item, A sequential method for a class of pseudoconcave fractional problems, Mathematical programs with a two-dimensional reverse convex constraint, A class of nonsmooth fractional multiobjective optimization problems, Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type, An outer approximation method for minimizing the product of several convex functions on a convex set, Polyhedral annexation, dualization and dimension reduction technique in global optimization, A parametric successive underestimation method for convex multiplicative programming problems, An objective space cut and bound algorithm for convex multiplicative programmes, Linear multiplicative programming, An outcome space approach for generalized convex multiplicative programs, Maximizing a linear fractional function on a Pareto efficient frontier, A new global optimization approach for convex multiplicative programming, A new two-level linear relaxed bound method for geometric programming problems, Conical partition algorithm for maximizing the sum of dc ratios, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, A global optimization approach to fractional optimal control, Fractional programming approach to a cost minimization problem in electricity market, \(NP\)-hardness of linear multiplicative programming and related problems, Outcome-space cutting-plane algorithm for linear multiplicative programming, Global minimization of a generalized convex multiplicative function, Global optimization method for linear multiplicative programming
Cites Work
