About: Benson's algorithm

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Benson's algorithm, named after , is a method for solving multi-objective linear programming problems and vector linear programs. This works by finding the "efficient extreme points in the outcome set". The primary concept in Benson's algorithm is to evaluate the upper image of the vector optimization problem by cutting planes.

Property Value
dbo:abstract
  • Benson's algorithm, named after , is a method for solving multi-objective linear programming problems and vector linear programs. This works by finding the "efficient extreme points in the outcome set". The primary concept in Benson's algorithm is to evaluate the upper image of the vector optimization problem by cutting planes. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 35170441 (xsd:integer)
dbo:wikiPageLength
  • 2975 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 881154281 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • Benson's algorithm, named after , is a method for solving multi-objective linear programming problems and vector linear programs. This works by finding the "efficient extreme points in the outcome set". The primary concept in Benson's algorithm is to evaluate the upper image of the vector optimization problem by cutting planes. (en)
rdfs:label
  • Benson's algorithm (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License