An outcome-space normal cone method for generalized concave multiplicative problems

MaRDI QIDQ5148362zbMATH OpenFDO

Authors Tran Ngoc Thang, Nguyen Thi Bach Kim, Do Xuan Hung

Publication date 3 February 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/PJO/vol14/pjov14n2p211.pdf

zbMATH Keywords

bound and branch algorithmefficient outcome setgeneralized multiplicative programmingnormal cone methodouter approximation

Mathematics Subject Classification ID

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

Recommendations

• An outcome space approach for generalized convex multiplicative programs
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
• Global maximization of a generalized concave multiplicative function
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• A convex analysis approach for convex multiplicative programming

Cited in

(6)

• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
• Solving generalized convex multiobjective programming problems by a normal direction method
• On the solution of generalized multiplicative extremum problems
• Global maximization of a generalized concave multiplicative function
• An outcome space approach for generalized convex multiplicative programs

This page was built for publication: An outcome-space normal cone method for generalized concave multiplicative problems

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