Solving generalized convex multiobjective programming problems by a normal direction method
From MaRDI portal
Publication:2836102
DOI10.1080/02331934.2016.1217859zbMath1351.90146OpenAlexW2513146623MaRDI QIDQ2836102
Tran Ngoc Thang, Nguyen Thi Bach Kim, Dinh The Luc
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
Related Items (1)
Cites Work
- Primal and dual approximation algorithms for convex vector optimization problems
- An approximation algorithm for convex multi-objective programming problems
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Generating the weakly efficient set of nonconvex multiobjective problems
- A convex analysis approach for convex multiplicative programming
- On-line and off-line vertex enumeration by adjacency lists
- Linear multiplicative programming
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Generalized convex multiplicative programming via quasiconcave minimization
- Multiplicative programming problems: Analysis and efficient point search heuristic
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Unbiased approximation in multicriteria optimization
- An objective space cut and bound algorithm for convex multiplicative programmes
- A new duality approach to solving concave vector maximization problems
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- \(NP\)-hardness of linear multiplicative programming and related problems
- Approximation methods in multiobjective programming
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- Finding Efficient Solutions by Free Disposal Outer Approximation
- An algorithm for bicriteria optimization based on the sensitivity function
- A characterization of quasiconvex vector-valued functions
- Characterization of scalar quasiconvexity and convexity of locally lipschitz vector-valued maps
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
- A finite branch-and-bound algorithm for linear multiplicative programming
This page was built for publication: Solving generalized convex multiobjective programming problems by a normal direction method
