Pages that link to "Item:Q2277368"

The following pages link to Generalized linear multiplicative and fractional programming (Q2277368):

Displaying 33 items.

• Global minimization of a generalized linear multiplicative programming (Q450102) (← links)
• A class of nonsmooth fractional multiobjective optimization problems (Q512939) (← links)
• Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type (Q685859) (← links)
• An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
• Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) (← links)
• An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
• A sequential method for a class of pseudoconcave fractional problems (Q940830) (← links)
• An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
• A new global optimization approach for convex multiplicative programming (Q972168) (← links)
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915) (← links)
• Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
• Polyhedral annexation, dualization and dimension reduction technique in global optimization (Q1200635) (← links)
• A parametric successive underestimation method for convex multiplicative programming problems (Q1200637) (← links)
• Linear multiplicative programming (Q1207311) (← links)
• Global minimization of a generalized convex multiplicative function (Q1315440) (← links)
• Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
• Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
• Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
• Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
• A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
• Conical partition algorithm for maximizing the sum of dc ratios (Q1781967) (← links)
• Finite algorithm for generalized linear multiplicative programming (Q1906745) (← links)
• A branch-and-reduce approach to global optimization (Q1924068) (← links)
• Sparse minimax portfolio and Sharpe ratio models (Q2165774) (← links)
• An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• A global optimization approach to fractional optimal control (Q2515268) (← links)
• \(NP\)-hardness of linear multiplicative programming and related problems (Q2564608) (← links)
• Fractional programming approach to a cost minimization problem in electricity market (Q3388407) (← links)
• A fifth bibliography of fractional programming^* (Q4265528) (← links)
• (Q5038031) (← links)