Pages that link to "Item:Q2360402"
From MaRDI portal
The following pages link to Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402):
Displaying 15 items.
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
- An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- A new efficient approach to tackle multi objective linear fractional problem with flexible constraints (Q2691377) (← links)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
- (Q5038031) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- A linearization to the multi-objective linear plus linear fractional program (Q6063798) (← links)
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem (Q6098133) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)
- A criterion space algorithm for solving linear multiplicative programming problems (Q6582405) (← links)
