Generalized linear multiplicative and fractional programming
global optimizationparametric programmingproduct of two linear functionssequence of convex programming problems
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32)
The nonconvex problem of minimizing the sum of a convex function and the product of two linear functions over a polytope is shown to be solvable by a sequence of convex programming problems, by embedding the original n-dimensional problem into an \((n+1)\)-dimensional master problem and then applying a parametric programming approach.
- Finite algorithm for generalized linear multiplicative programming
- Generalized convex multiplicative programming via quasiconcave minimization
- Global minimization of a generalized convex multiplicative function
- A parametric successive underestimation method for convex multiplicative programming problems
- An outcome space approach for generalized convex multiplicative programs
- A nonisolated optimal solution of general linear multiplicative programming problems
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Mathematical programs with a two-dimensional reverse convex constraint
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- A parametric successive underestimation method for convex multiplicative programming problems
- Linear multiplicative programming
- Global minimization of a generalized convex multiplicative function
- Convex programs with an additional constraint on the product of several convex functions
- Multiplicative programming problems: Analysis and efficient point search heuristic
- A unified monotonic approach to generalized linear fractional programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Range division and linearization algorithm for a class of linear ratios optimization problems
- A new two-level linear relaxed bound method for geometric programming problems
- Conical partition algorithm for maximizing the sum of dc ratios
- Finite algorithm for generalized linear multiplicative programming
- A branch-and-reduce approach to global optimization
- Sparse minimax portfolio and Sharpe ratio models
- An objective space cut and bound algorithm for convex multiplicative programmes
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization method for linear multiplicative programming
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- A global optimization approach to fractional optimal control
- \(NP\)-hardness of linear multiplicative programming and related problems
- A new approach for solving generalized linear fractional programming
- Fractional programming approach to a cost minimization problem in electricity market
- A fifth bibliography of fractional programming*
- Global minimization of a generalized linear multiplicative programming
- An -approximation algorithm for generalized fractional programming problems
- A class of nonsmooth fractional multiobjective optimization problems
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
- A method based on parametric convex programming for solving convex multiplicative programming problem
- 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
- Maximizing a linear fractional function on a Pareto efficient frontier
- An outcome-space finite algorithm for solving linear multiplicative programming
- A sequential method for a class of pseudoconcave fractional problems
- An outcome space approach for generalized convex multiplicative programs
- A new global optimization approach for convex multiplicative programming
This page was built for publication: Generalized linear multiplicative and fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277368)
