Generating all maximal efficient faces for multiple objective linear programs (Q1252160): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the vector maximization problem / 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: Q4126064 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00935493 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046361522 / rank
 
Normal rank

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Generating all maximal efficient faces for multiple objective linear programs
scientific article

    Statements

    Generating all maximal efficient faces for multiple objective linear programs (English)
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    Algorithm
    0 references
    Maximal Efficient Faces
    0 references
    Multiple Objective Linear Programs
    0 references
    Vector Optimization
    0 references

    Identifiers