Pages that link to "Item:Q1567067"
From MaRDI portal
The following pages link to An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming (Q1567067):
Displaying 24 items.
- 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)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← 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)
- A convex analysis approach for convex multiplicative programming (Q934807) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- A new global optimization approach for convex multiplicative programming (Q972168) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- An integrated approach to redundancy allocation and test planning for reliability growth (Q1651603) (← 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)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection (Q2097485) (← links)
- An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- Fractional programming with convex quadratic forms and functions (Q2496064) (← links)
- Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
- Global Optimization of Linear Multiplicative Programming Using Univariate Search (Q4982140) (← links)
- Global optimization of nonlinear sums of ratios (Q5955588) (← links)
- Global optimization algorithm for the nonlinear sum of ratios problem (Q5959898) (← links)
