Pages that link to "Item:Q622153"
From MaRDI portal
The following pages link to A new linearization method for generalized linear multiplicative programming (Q622153):
Displaying 16 items.
- A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
- Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← 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)
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems (Q2942454) (← links)
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
- A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)
