Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2607047547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of the bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards finding global representations of the efficient set in multiple objective mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is bilevel programming a special case of a mathematical program with complementarity constraints? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all efficient extreme points for multiple objective linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of ideal and Nadir values and implications for their use in MCDM methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Scalarization Method in Multiobjective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constraint Method in Nonlinear Multi-Objective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quality of discrete representations in multiple objective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating equidistant representations in biobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding representative systems for discrete bicriterion optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5835082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm robust for the bicriteria discrete optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and inexact penalty methods for the generalized bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversity Maximization Approach for Multiobjective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solution of bilevel programs with a nonconvex inner program / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equispaced Pareto front construction for constrained bi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete representation of non-dominated sets in multi-objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of the non-dominated set in biobjective discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent approaches for quadratic bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete linear bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method / rank
 
Normal rank

Latest revision as of 00:03, 16 July 2024

scientific article
Language Label Description Also known as
English
Bilevel programming for generating discrete representations in multiobjective optimization
scientific article

    Statements

    Bilevel programming for generating discrete representations in multiobjective optimization (English)
    0 references
    0 references
    0 references
    25 June 2018
    0 references
    multiobjective optimization
    0 references
    decision maker
    0 references
    representation
    0 references
    nondominated set
    0 references
    coverage error
    0 references
    bilevel programming problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers