Minimizing the sum of a convex function and the product of two affine functions over a convex set

DOI10.1080/02331939208843779zbMath0817.90113OpenAlexW1984851257MaRDI QIDQ4327904

Bui The Tam, Le Dung Muu

Publication date: 1 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843779

zbMATH Keywords

global optimizationbranch-and-boundnumerical efficiencysum of a convex function and the product of two affine functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (5)

Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ Minimizing the sum of a convex function and a specially structured nonconvex function ⋮ Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions ⋮ Outcome-space cutting-plane algorithm for linear multiplicative programming

Cites Work

• A collection of test problems for constrained global optimization algorithms
• Solving Bicriterion Mathematical Programs

This page was built for publication: Minimizing the sum of a convex function and the product of two affine functions over a convex set