Pages that link to "Item:Q622153"

The following pages link to A new linearization method for generalized linear multiplicative programming (Q622153):

Displaying 30 items.

• A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
• Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
• Inexact linear programming with generalized technological matrix sets (Q788633) (← links)
• Linearization method for a class of multiplicative programming with exponent (Q864775) (← links)
• An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
• An improved general Phase-I method in linear programming (Q1107440) (← links)
• On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
• Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
• A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
• Finite algorithm for generalized linear multiplicative programming (Q1906745) (← links)
• Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← 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)
• New class of multiplicative algorithms for solving of entropy-linear programs (Q2503213) (← links)
• Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
• An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems (Q2942454) (← links)
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
• (Q3367118) (← links)
• A new method for solving a class of multiplicative programming (Q3463093) (← links)
• (Q4435041) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
• An efficient polynomial time algorithm for a class of generalized linear multiplicative programs with positive exponents (Q6484150) (← links)
• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)
• Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
• A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)