Pages that link to "Item:Q1367730"
From MaRDI portal
The following pages link to Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730):
Displayed 11 items.
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm (Q932709) (← links)
- A convex analysis approach for convex multiplicative programming (Q934807) (← links)
- Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
- On computational solution of vector maximum problem (Q2570699) (← links)
- Level set algorithm for solving convex multiplicative programming problems (Q2570801) (← links)
- Duality for linear multiplicative programs (Q4673140) (← links)
- Global optimization of nonlinear sums of ratios (Q5955588) (← links)
