About: Basic solution (linear programming)

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

In linear programming, a discipline within applied mathematics, a basic solution is any solution of a linear programming problem satisfying certain specified technical conditions. For a polyhedron and a vector , is a basic solution if: 1. * All the equality constraints defining are active at 2. * Of all the constraints that are active at that vector, at least of them must be linearly independent. Note that this also means that at least constraints must be active at that vector. A constraint is active for a particular solution if it is satisfied at equality for that solution.

Property Value
dbo:abstract
  • In linear programming, a discipline within applied mathematics, a basic solution is any solution of a linear programming problem satisfying certain specified technical conditions. For a polyhedron and a vector , is a basic solution if: 1. * All the equality constraints defining are active at 2. * Of all the constraints that are active at that vector, at least of them must be linearly independent. Note that this also means that at least constraints must be active at that vector. A constraint is active for a particular solution if it is satisfied at equality for that solution. A basic solution that satisfies all the constraints defining (or, in other words, one that lies within ) is called a basic feasible solution. (en)
dbo:wikiPageID
  • 36055197 (xsd:integer)
dbo:wikiPageLength
  • 1329 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1104062631 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In linear programming, a discipline within applied mathematics, a basic solution is any solution of a linear programming problem satisfying certain specified technical conditions. For a polyhedron and a vector , is a basic solution if: 1. * All the equality constraints defining are active at 2. * Of all the constraints that are active at that vector, at least of them must be linearly independent. Note that this also means that at least constraints must be active at that vector. A constraint is active for a particular solution if it is satisfied at equality for that solution. (en)
rdfs:label
  • Basic solution (linear programming) (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
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