Pages that link to "Item:Q1422886"

The following pages link to A unified monotonic approach to generalized linear fractional programming (Q1422886):

Displaying 50 items.

• Global solutions to fractional programming problem with ratio of nonconvex functions (Q299415) (← links)
• A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
• Outcome space range reduction method for global optimization of sum of affine ratios problem (Q330338) (← links)
• Global optimization algorithm for sum of generalized polynomial ratios problem (Q345766) (← links)
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
• Minimization of isotonic functions composed of Fractions (Q613584) (← links)
• Lifting, tilting and fractional programming revisited (Q614041) (← links)
• A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
• An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
• Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
• Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) (← links)
• Computing non-dominated solutions in MOLFP (Q877640) (← links)
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
• A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
• Solving the sum-of-ratios problems by a harmony search algorithm (Q966084) (← links)
• Global optimization for sum of linear ratios problem using new pruning technique (Q1023182) (← links)
• Solving the sum-of-ratios problem by a stochastic search algorithm (Q1024829) (← links)
• Global optimization for a class of fractional programming problems (Q1037364) (← links)
• A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
• Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique (Q1659228) (← links)
• A linearized relaxing algorithm for the specific nonlinear optimization problem (Q1669202) (← links)
• Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
• Reverse polyblock approximation for generalized multiplicative/fractional programming (Q1762797) (← links)
• An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
• An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
• Optimization of polynomial fractional functions (Q1888159) (← links)
• Optimization of a linear fractional function on a hypersphere of an affine space (Q1893317) (← links)
• An iterative approach to solve multiobjective linear fractional programming problems (Q1991300) (← links)
• Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects (Q2040606) (← links)
• Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
• An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
• The maximax minimax quotient theorem (Q2116624) (← links)
• An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
• The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems (Q2231049) (← links)
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
• An effective branch and bound algorithm for minimax linear fractional programming (Q2336179) (← links)
• Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
• A new branch and bound algorithm for minimax ratios problems (Q2364779) (← links)
• Global optimization for the sum of generalized polynomial fractional functions (Q2460040) (← links)
• Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
• Global optimization for sum of generalized fractional functions (Q2479363) (← 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)
• A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
• An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
• Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
• Minimization of the sum of several linear fractional functions (Q2751321) (← links)
• A new linearization technique for minimax linear fractional programming (Q2935390) (← links)
• A sixth bibliography of fractional programming (Q3426331) (← links)
• An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives (Q3750534) (← links)