A new method for determining all maximal efficient faces in multiple objective linear programming (Q514052): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding all maximal efficient faces in multiobjective linear programming / 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: Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all maximal efficient faces for multiple objective linear programs / 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: Efficient solution generation for multiple objective linear programming based on extreme ray generation method / 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: Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all vertices of a polyhedron is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces of a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867375 / 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: Degeneracy degrees of constraint collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization over the efficient set of a parametric multiple objective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A common formula to compute the efficient sets of a class of multiple objective linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal descriptor index set for a face of a convex polyhedral set and some applications / rank
 
Normal rank

Revision as of 12:24, 13 July 2024

scientific article
Language Label Description Also known as
English
A new method for determining all maximal efficient faces in multiple objective linear programming
scientific article

    Statements

    A new method for determining all maximal efficient faces in multiple objective linear programming (English)
    0 references
    0 references
    8 March 2017
    0 references
    multiple objective programming
    0 references
    maximal efficient face
    0 references
    maximal descriptor index set for a face
    0 references
    0 references
    0 references

    Identifiers