Pages that link to "Item:Q1367730"
From MaRDI portal
The following pages link to Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730):
Displaying 30 items.
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities (Q550103) (← links)
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms (Q607786) (← links)
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767) (← links)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- A FPTAS for a class of linear multiplicative problems (Q849090) (← 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)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- Heuristic methods for linear multiplicative programming (Q1567074) (← links)
- Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
- A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← 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)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- On computational solution of vector maximum problem (Q2570699) (← links)
- Level set algorithm for solving convex multiplicative programming problems (Q2570801) (← links)
- Multiplicative programming and beyond via \(C\)-programming. (Q2776666) (← links)
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
- Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
- Duality for linear multiplicative programs (Q4673140) (← links)
- Global Optimization of Linear Multiplicative Programming Using Univariate Search (Q4982140) (← links)
- Global optimization of nonlinear sums of ratios (Q5955588) (← links)
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
