Global optimization of multiplicative programs
From MaRDI portal
Publication:1404396
DOI10.1023/A:1024700901538zbMath1052.90091MaRDI QIDQ1404396
Nikolaos V. Sahinidis, Hong Seo Ryoo
Publication date: 21 August 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Theoretical and computational results about optimality-based domain reductions, A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, A review of recent advances in global optimization, A method of acceleration for a class of multiplicative programming problems with exponent, Global optimization of a rank-two nonconvex program, A FPTAS for a class of linear multiplicative problems, An outcome-space finite algorithm for solving linear multiplicative programming, Data separation via a finite number of discriminant functions: a global optimization approach, Solving generalized polynomial problem by using new affine relaxed technique, A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints, An efficient algorithm for computing a class of multiplicative optimization problem, Linearization method for a class of multiplicative programming with exponent, Global optimization of generalized linear fractional programming with nonlinear constraints, Strong valid inequalities for Boolean logical pattern generation, An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems, Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization, Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience, Two-level linear relaxation method for generalized linear fractional programming, Solving linear multiplicative programs via branch-and-bound: a computational experience, A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach, A new linearization method for generalized linear multiplicative programming, A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs, An accelerating outer space algorithm for globally solving generalized linear multiplicative problems, A branch-and-reduce approach for solving generalized linear multiplicative programming, An efficient algorithm for globally solving generalized linear multiplicative programming, A new bound-and-reduce approach of nonconvex quadratic programming problems, A mini review on UAV mission planning, A practicable branch-and-bound algorithm for globally solving linear multiplicative programming, Global minimization for generalized polynomial fractional program, A new accelerating method for globally solving a class of nonconvex programming problems, A global optimization approach for solving generalized nonlinear multiplicative programming problem, A convex analysis approach for convex multiplicative programming, Unnamed Item, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems, An outcome space approach for generalized convex multiplicative programs, Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems, Outer approximation algorithms for canonical DC problems, Outer space branch and bound algorithm for solving linear multiplicative programming problems, Underestimation functions for a rank-two partitioning method, Nonlinear separation of data via mixed 0-1 integer and linear programming, Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes, Decomposition for adjustable robust linear optimization subject to uncertainty polytope, Global optimization algorithm for a generalized linear multiplicative programming, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, An out space accelerating algorithm for generalized affine multiplicative programs problem, A branch and reduce approach for solving a class of low rank d.c. programs, A branch and bound algorithm for globally solving a class of nonconvex programming problems, A nonisolated optimal solution of general linear multiplicative programming problems, MILP approach to pattern generation in logical analysis of data, Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems, A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, Approximating a linear multiplicative objective in watershed management optimization, A global optimization method, QBB, for twice-differentiable nonconvex optimization problem, Global optimization method for linear multiplicative programming
