Linear multiplicative programming
From MaRDI portal
Publication:1207311
DOI10.1007/BF01580893zbMath0761.90080MaRDI QIDQ1207311
Publication date: 1 April 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Linear programs with an additional rank two reverse convex constraint, Convex programs with an additional constraint on the product of several convex functions, Theoretical and computational results about optimality-based domain reductions, On jet-convex functions and their tensor products, A FPTAS for a class of linear multiplicative problems, An outcome-space finite algorithm for solving linear multiplicative programming, Minimizing a linear multiplicative-type function under network flow constraints, Multiplicative programming problems: Analysis and efficient point search heuristic, Finding a minimal efficient solution of a convex multiobjective program, The Rank-One Quadratic Assignment Problem, An FPTAS for optimizing a class of low-rank functions over a polytope, Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms, A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming, Special cases of the quadratic assignment problem, Branch and cut method for solving integer indefinite quadratic bilevel programs, Solving linear multiplicative programs via branch-and-bound: a computational experience, A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints, An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint, Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound, On duality for a class of quasiconcave multiplicative programs, Global minimization of a generalized linear multiplicative programming, Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, A convex analysis approach for convex multiplicative programming, A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming, Mathematical programs with a two-dimensional reverse convex constraint, The complementary convex structure in global optimization, Reduction of indefinite quadratic programs to bilinear programs, A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints, On linear multiplicative programming., A generalized duality and applications, An outer approximation method for minimizing the product of several convex functions on a convex set, Polyhedral annexation, dualization and dimension reduction technique in global optimization, An objective space cut and bound algorithm for convex multiplicative programmes, On the indefinite quadratic bilevel programming problem., An algorithm for solving convex programs with an additional convex- concave constraint, Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem, A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Unnamed Item, Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities, The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm, Duality for linear multiplicative programs, Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs, Global optimization algorithm for a generalized linear multiplicative programming, On the nonlinear multilevel programming problems, Solving generalized convex multiobjective programming problems by a normal direction method, A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems, \(NP\)-hardness of linear multiplicative programming and related problems, Outcome-space cutting-plane algorithm for linear multiplicative programming, Level set algorithm for solving convex multiplicative programming problems, Approximating a linear multiplicative objective in watershed management optimization, Global minimization of a generalized convex multiplicative function, Image space analysis of generalized fractional programs, The simplex method as a global optimizer: A \(C\)-programming perspective, Bilinear separation of two sets in \(n\)-space, Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set, Strongly polynomial time algorithms for certain concave minimization problems on networks, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- On a class of quadratic programs
- Constrained global optimization: algorithms and applications
- Outer approximation by polyhedral convex sets
- Minimum concave cost production system: A further generalization of multi-echelon model
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- A parametric successive underestimation method for convex multiplicative programming problems
- Quasi-concave minimization subject to linear constraints
- Generalized linear multiplicative and fractional programming
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
- Convergent Algorithms for Minimizing a Concave Function
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Variations on a cutting plane method for solving concave minimization problems with linear constraints
- A cutting plane algorithm for solving bilinear programs
- Maximization of A convex quadratic function under linear constraints
- A Successive Underestimation Method for Concave Minimization Problems
- A method for solving maximum-problems with a nonconcave quadratic objective function
- An Algorithm for Separable Nonconvex Programming Problems
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Solving Bicriterion Mathematical Programs
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Solving the Fixed Charge Problem by Ranking the Extreme Points
