Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2016.1217859 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2513146623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for convex multi-objective programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation methods in multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the weakly efficient set of nonconvex multiobjective problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Efficient Solutions by Free Disposal Outer Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new duality approach to solving concave vector maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for bicriteria optimization based on the sensitivity function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbiased approximation in multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal and dual approximation algorithms for convex vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of quasiconvex vector-valued functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of scalar quasiconvexity and convexity of locally lipschitz vector-valued maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and off-line vertex enumeration by adjacency lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized convex multiplicative programming via quasiconcave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative programming problems: Analysis and efficient point search heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(NP\)-hardness of linear multiplicative programming and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation method for minimizing the product of several convex functions on a convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex analysis approach for convex multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An objective space cut and bound algorithm for convex multiplicative programmes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:20, 13 July 2024

scientific article
Language Label Description Also known as
English
Solving generalized convex multiobjective programming problems by a normal direction method
scientific article

    Statements

    Solving generalized convex multiobjective programming problems by a normal direction method (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2016
    0 references
    multiobjective programming
    0 references
    weakly efficient set
    0 references
    outer approximation
    0 references
    normal direction
    0 references

    Identifiers