Pages that link to "Item:Q1177915"
From MaRDI portal
The following pages link to Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915):
Displaying 16 items.
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← 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)
- A global optimization algorithm for sum of linear ratios problem (Q364313) (← links)
- An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
- Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) (← links)
- On the global optimization of sums of linear fractional functions over a convex set (Q704748) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
- A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- A deterministic global optimization algorithm (Q870181) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem (Q6098133) (← links)
