This HTML5 document contains 50 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n19https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n18https://github.com/lcsirmaz/
n7http://
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Benson's_algorithm
Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:Benson's_algorithm
Subject Item
dbr:Vector_optimization
dbo:wikiPageWikiLink
dbr:Benson's_algorithm
Subject Item
dbr:Benson's_algorithm
rdf:type
yago:PsychologicalFeature100023100 dbo:Software yago:Procedure101023820 yago:Abstraction100002137 yago:Activity100407535 yago:YagoPermanentlyLocatedEntity yago:Algorithm105847438 owl:Thing yago:Act100030358 yago:Rule105846932 yago:WikicatOptimizationAlgorithmsAndMethods yago:Event100029378
rdfs:label
Benson's algorithm
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.
dcterms:subject
dbc:Optimization_algorithms_and_methods dbc:Linear_programming
dbo:wikiPageID
35170441
dbo:wikiPageRevisionID
881154281
dbo:wikiPageWikiLink
dbr:Go_(game) dbc:Optimization_algorithms_and_methods dbr:Cutting-plane_method dbr:Multiobjective_optimization dbr:Vector_optimization dbc:Linear_programming dbr:Harold_Benson dbr:Benson's_algorithm_(Go) dbr:Extreme_point dbr:Multi-objective_linear_programming
dbo:wikiPageExternalLink
n7:bensolve.org n18:inner
owl:sameAs
freebase:m.0j6759k yago-res:Benson's_algorithm n19:4Y7ro wikidata:Q4890227
dbp:wikiPageUsesTemplate
dbt:Applied-math-stub dbt:Distinguish dbt:Reflist
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.
gold:hypernym
dbr:Method
prov:wasDerivedFrom
wikipedia-en:Benson's_algorithm?oldid=881154281&ns=0
dbo:wikiPageLength
2975
foaf:isPrimaryTopicOf
wikipedia-en:Benson's_algorithm
Subject Item
dbr:Benson's_algorithm_(Go)
dbo:wikiPageWikiLink
dbr:Benson's_algorithm
Subject Item
dbr:Harry_Benson_(disambiguation)
dbo:wikiPageWikiLink
dbr:Benson's_algorithm
Subject Item
dbr:Multi-objective_linear_programming
dbo:wikiPageWikiLink
dbr:Benson's_algorithm
Subject Item
dbr:Multi-objective_optimization
dbo:wikiPageWikiLink
dbr:Benson's_algorithm
Subject Item
wikipedia-en:Benson's_algorithm
foaf:primaryTopic
dbr:Benson's_algorithm