A new approach to optimization under monotonic constraint

DOI10.1023/A:1008321216723zbMath0971.90067MaRDI QIDQ5927651

Hoang Tuy, Le Tu Luc

Publication date: 6 November 2001

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

branch-and bound algorithmcomputational experimentsmonotonic constraintnonconvex programmingPascal

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (8)

A partial enumeration algorithm for pure nonlinear integer programming ⋮ Reverse convex problems: an approach based on optimality conditions ⋮ On convexification for a class of global optimization problems ⋮ Convexification of nonsmooth monotone functions ⋮ A branch-and-bound based method for solving monotone optimization problems ⋮ Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint ⋮ Branch-and-reduce algorithm for convex programs with additional multiplicative constraints ⋮ Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems

This page was built for publication: A new approach to optimization under monotonic constraint