The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jmaa.2015.04.011 / rank
Normal rank
 
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.jmaa.2015.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2313869345 / 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: Determination of the efficient set in multiobjective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the objective space 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: Generating all maximal efficient faces for multiple objective linear programs / 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: A revised simplex method for linear multiple objective 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: Degeneracy in interior point methods for linear programming: A survey / 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: Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces of a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the vector maximization problem / 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: 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: Degeneracy degrees of constraint collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal representation of convex polyhedral sets / 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: Constructing efficient solutions structure of 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 / DOI
 
Property / DOI: 10.1016/J.JMAA.2015.04.011 / rank
 
Normal rank

Latest revision as of 02:55, 18 December 2024

scientific article
Language Label Description Also known as
English
The maximal descriptor index set for a face of a convex polyhedral set and some applications
scientific article

    Statements

    The maximal descriptor index set for a face of a convex polyhedral set and some applications (English)
    0 references
    0 references
    22 May 2015
    0 references
    multiple objective programming
    0 references
    faces of a polyhedron
    0 references
    maximal efficient faces
    0 references
    maximal descriptor index set for a face
    0 references
    0 references

    Identifiers