The following pages link to Linear multiplicative programming (Q1207311):
Displaying 50 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)
- Global minimization of a generalized linear multiplicative programming (Q450102) (← links)
- Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities (Q550103) (← links)
- Finding a minimal efficient solution of a convex multiobjective program (Q597210) (← links)
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms (Q607786) (← links)
- A generalized duality and applications (Q686992) (← links)
- An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
- An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← 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 robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
- On the nonlinear multilevel programming problems (Q998684) (← links)
- Special cases of the quadratic assignment problem (Q1129914) (← links)
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915) (← links)
- Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
- The complementary convex structure in global optimization (Q1187368) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Polyhedral annexation, dualization and dimension reduction technique in global optimization (Q1200635) (← links)
- Global minimization of a generalized convex multiplicative function (Q1315440) (← links)
- Image space analysis of generalized fractional programs (Q1315441) (← links)
- The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
- Bilinear separation of two sets in \(n\)-space (Q1315445) (← links)
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098) (← links)
- Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011) (← links)
- Linear programs with an additional rank two reverse convex constraint (Q1327432) (← links)
- Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
- Minimizing a linear multiplicative-type function under network flow constraints (Q1362518) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- On duality for a class of quasiconcave multiplicative programs (Q1411526) (← links)
- Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
- An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints (Q2425955) (← links)
- On linear multiplicative programming. (Q2468549) (← links)
- On the indefinite quadratic bilevel programming problem. (Q2477129) (← links)
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- \(NP\)-hardness of linear multiplicative programming and related problems (Q2564608) (← links)
- Level set algorithm for solving convex multiplicative programming problems (Q2570801) (← links)
- Branch and cut method for solving integer indefinite quadratic bilevel programs (Q2675637) (← links)
- Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem (Q2755397) (← links)
- Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
