Solving generalized convex multiobjective programming problems by a normal direction method

DOI10.1080/02331934.2016.1217859MaRDI QIDQ2836102zbMATH OpenOpenAlexFDO

Authors Tran Ngoc Thang, Dinh The Luc, Nguyen Thi Bach Kim

Publication date 7 December 2016

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

multiobjective programmingnormal directionouter approximationweakly efficient set

Mathematics Subject Classification ID

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

Recommendations

• An outcome-space normal cone method for generalized concave multiplicative problems
• An approximation algorithm for convex multi-objective programming problems
• Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
• Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
• scientific article; zbMATH DE number 6612741

Cites work

• \(NP\)-hardness of linear multiplicative programming and related problems
• A characterization of quasiconvex vector-valued functions
• A convex analysis approach for convex multiplicative programming
• A finite branch-and-bound algorithm for linear multiplicative programming
• A new duality approach to solving concave vector maximization problems
• An algorithm for bicriteria optimization based on the sensitivity function
• An approximation algorithm for convex multi-objective programming problems
• An objective space cut and bound algorithm for convex multiplicative programmes
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• An outer approximation method for minimizing the product of several convex functions on a convex set
• Approximation methods in multiobjective programming
• Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
• Characterization of scalar quasiconvexity and convexity of locally lipschitz vector-valued maps
• Finding efficient solutions by free disposal outer approximation
• Generalized convex multiplicative programming via quasiconcave minimization
• Generating the weakly efficient set of nonconvex multiobjective problems
• Linear multiplicative programming
• Multiplicative programming problems: Analysis and efficient point search heuristic
• On-line and off-line vertex enumeration by adjacency lists
• Primal and dual approximation algorithms for convex vector optimization problems
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
• Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
• Unbiased approximation in multicriteria optimization

Cited in

(3)

• A framework for controllable Pareto front learning with completed scalarization functions and its applications
• A reduced Jacobian method with full convergence property
• A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems

This page was built for publication: Solving generalized convex multiobjective programming problems by a normal direction method

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