Solving a class of multiplicative programs with 0-1 knapsack constraints

DOI10.1023/A:1021725517203zbMath0945.90028OpenAlexW1523445389MaRDI QIDQ1969464

Takahito Kuno

Publication date: 16 March 2000

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021725517203

zbMATH Keywords

concave minimizationLagrangian relaxationbranch-and-bound algorithmsmultiplicative programming\(0-1\) knapsack problems

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Boolean programming (90C09)

Related Items (5)

A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming ⋮ An outcome-space finite algorithm for solving linear multiplicative programming ⋮ A practicable branch-and-bound algorithm for globally solving linear multiplicative programming ⋮ A nonisolated optimal solution of general linear multiplicative programming problems ⋮ Global optimization method for linear multiplicative programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polyhedral annexation, dualization and dimension reduction technique in global optimization
• Vector maximization with two objective functions
• Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
• Optimization on low rank nonconvex structures
• Multiplicative programming problems: Analysis and efficient point search heuristic
• \(NP\)-hardness of linear multiplicative programming and related problems
• An Algorithm for Large Zero-One Knapsack Problems
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• An Algorithm for Separable Nonconvex Programming Problems
• Solving Bicriterion Mathematical Programs

This page was built for publication: Solving a class of multiplicative programs with 0-1 knapsack constraints