Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apm.2012.01.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069540826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fuzzy approach to the multiobjective transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two storage inventory problem with dynamic demand and interval valued lead-time over finite time horizon under inflation and time-value of money / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all maximal efficient faces in multiobjective linear programming / 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
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: A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further analysis of an outcome set-based algorithm for multiple-objective linear programming / 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: Constructing efficient solutions structure of multiobjective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivoting in an outcome polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039055 / 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: Q3818808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method for determining the set of all efficient solutions to a linear vectormaximum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector maximization at a degenerate vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of the efficient set in multiobjective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining maximal efficient faces in multiobjective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified method for constructing efficient solutions structure of MOLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual simplex method for multiobjective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outcome space partition of the weight set in multiobjective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the efficient outcome set in multiple objective linear programs: The bicriteria case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new pivoting rule for solving various degeneracy problems / rank
 
Normal rank

Latest revision as of 01:33, 13 July 2024

scientific article
Language Label Description Also known as
English
Adjacency based method for generating maximal efficient faces in multiobjective linear programming
scientific article

    Statements

    Adjacency based method for generating maximal efficient faces in multiobjective linear programming (English)
    0 references
    2 December 2016
    0 references
    multiobjective linear programming
    0 references
    adjacency
    0 references
    efficient set
    0 references
    efficient faces
    0 references
    outcome set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers