Outcome-space outer approximation algorithm for linear multiplicative programming

MaRDI QIDQ5503469zbMATH OpenFDO

Authors Nguyen Thi Bach Kim, Nguyen T. le Trang, Tang T. Ha Yen

Publication date 15 January 2009

zbMATH Keywords

finiteglobally solving

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Recommendations

• An outcome-space finite algorithm for solving linear multiplicative programming
• Global optimization method for linear multiplicative programming
• An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Outer space branch and bound algorithm for solving linear multiplicative programming problems

Cited in

(13)

• Convergent outer approximation algorithms for solving unary programs
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• An out space accelerating algorithm for generalized affine multiplicative programs problem
• Outer space branch and bound algorithm for solving linear multiplicative programming problems
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
• Approximating a linear multiplicative objective in watershed management optimization
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
• An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
• Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
• An outer space branch-reduction-bound algorithm using second-order cone relaxation with regional reduction strategy for solving equivalent generalized linear multiplicative programming
• Convex relaxation technique-based output space branch-reduction-bound algorithm for minimizing generalized linear fractional multiplicative programs
• An outcome-space finite algorithm for solving linear multiplicative programming

This page was built for publication: Outcome-space outer approximation algorithm for linear multiplicative programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503469)