http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-9007961-B2
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_fe5421f53e01d939b22a8e20523c79ee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_3459addd43c490c2f50d982d44c9f751 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L49-101 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-28 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L12-933 |
filingDate | 2011-11-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
grantDate | 2015-04-14-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_7b9562bbf882d5155bb1f6ffb93ad320 |
publicationDate | 2015-04-14-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | US-9007961-B2 |
titleOfInvention | Apparatus and method for using and solving linear programming problem and applications thereof |
abstract | Method and system for analyzing a linear programming problem or any other problem involving inequalities constraints set relating to multiple variables. An initial feasible region is calculated based on a sub-set of the constraints set. The feasible region is updated based on the additional constraints added one at a time. The method checks for feasibly, identifies active constraints, and provides end-points of the feasible region. The method may be applied to a control system or to a crossbar switch handling routing between multiple input and multiple outputs, such as digital data networking switch used to route TDM digital data streams being packet, frame or cell based, in a LAN, WAN, MAN or Internet application. |
isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-10320701-B1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-9471391-B1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-9887930-B1 |
priorityDate | 2010-11-22-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 25.