Pages that link to "Item:Q849749"

The following pages link to An outcome-space finite algorithm for solving linear multiplicative programming (Q849749):

Displaying 27 items.

• A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
• A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
• A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
• Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) (← links)
• An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
• A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
• A new global optimization approach for convex multiplicative programming (Q972168) (← links)
• A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← 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)
• 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)
• Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← 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)
• Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
• Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
• HYBRID CODING PSO-ACO CO-EVOLUTIONARY ALGORITHM FOR SOLVING MIXED-INTEGER PROGRAMMING PROBLEMS (Q2846480) (← links)
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
• Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)