Pages that link to "Item:Q992571"
From MaRDI portal
The following pages link to A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions (Q992571):
Displaying 14 items.
- A mathematical programming approach to sample coefficient of variation with interval-valued observations (Q286182) (← links)
- A parametric solution algorithm for a class of rank-two nonconvex programs (Q475801) (← links)
- Simplex-like sequential methods for a class of generalized fractional programs (Q522095) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- Pseudoconvexity on a closed convex set: an application to a wide class of generalized fractional functions (Q1693848) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
- Parametric linear fractional programming for an unbounded feasible region (Q2366965) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
- A criterion space algorithm for solving linear multiplicative programming problems (Q6582405) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
