Statements (61)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Mathematical Object
|
| gptkbp:field |
Non-negative_Integer
|
| gptkbp:hasSpecialty |
Convexity
|
| https://www.w3.org/2000/01/rdf-schema#label |
Polyhedral Cone
|
| gptkbp:isA |
Subset_of_a_Vector_Space
|
| gptkbp:isAccessibleBy |
Basis Vectors
Linear_Equations |
| gptkbp:isAvenueFor |
Economics
|
| gptkbp:isCharacterizedBy |
Extreme Points
Support Functions Boundary Properties Convex Combinations Face Structure Interior Points Projection Properties Linear_Functionals Vertices_and_Edges |
| gptkbp:isCitedBy |
Non-negative Constraints
A set of vectors in a vector space that can be expressed as non-negative linear combinations of a finite set of generators. Generators_and_Rays |
| gptkbp:isCitedIn |
Real Vector Spaces
|
| gptkbp:isConnectedTo |
Dual Cone
|
| gptkbp:isCounteredBy |
Graphical Representation
Matrix Representation Convex Polytope Intersection of Half-Spaces Polyhedral Representation |
| gptkbp:isLocatedIn |
Non-negative_Linear_Combinations
|
| gptkbp:isMemberOf |
Finite Set of Points
|
| gptkbp:isPartOf |
Convex Analysis
Convex Geometry Geometric Analysis Linear_Algebra |
| gptkbp:isRelatedTo |
Data Analysis
Optimization Theory Convex Hull Convex Sets Feasibility Problems Linear Inequalities Convex Polyhedron Multi-dimensional Analysis Mathematical_Optimization Linear_Programming_Theory Polyhedral_Theory |
| gptkbp:isStudiedIn |
Mathematics
|
| gptkbp:isUsedFor |
Inequality Constraints
3D Shapes Model Constraints Generating_Rays Geometric_Shape_in_Euclidean_Space Polyhedral_Shapes |
| gptkbp:isUsedIn |
gptkb:Linear_Programming
Game Theory Machine Learning Statistical Analysis Control Theory Operations Research Optimization Problems Computational Geometry Network Flow Problems Resource Allocation Problems |