{"title":"整数规划","authors":"","doi":"10.1002/9781119454816.ch10","DOIUrl":null,"url":null,"abstract":"A face F is said to be a facet of P if dim(F ) = dim(P )− 1. All facets are necessary (and sufficient) to describe a polyhedron. Facets do not have a unique description. But... Every full-dimensional polyhedron P has a unique (up to scalar multiplication) representation that consists of one inequality representing each facet of P . If dim(P ) = n− k with k > 0, then P is described by a maximal set of linearly independent rows of (A, b), as well as one inequality representing each facet of P .","PeriodicalId":380681,"journal":{"name":"Engineering Optimization Theory and Practice","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Integer Programming\",\"authors\":\"\",\"doi\":\"10.1002/9781119454816.ch10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A face F is said to be a facet of P if dim(F ) = dim(P )− 1. All facets are necessary (and sufficient) to describe a polyhedron. Facets do not have a unique description. But... Every full-dimensional polyhedron P has a unique (up to scalar multiplication) representation that consists of one inequality representing each facet of P . If dim(P ) = n− k with k > 0, then P is described by a maximal set of linearly independent rows of (A, b), as well as one inequality representing each facet of P .\",\"PeriodicalId\":380681,\"journal\":{\"name\":\"Engineering Optimization Theory and Practice\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Optimization Theory and Practice\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/9781119454816.ch10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Optimization Theory and Practice","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/9781119454816.ch10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A face F is said to be a facet of P if dim(F ) = dim(P )− 1. All facets are necessary (and sufficient) to describe a polyhedron. Facets do not have a unique description. But... Every full-dimensional polyhedron P has a unique (up to scalar multiplication) representation that consists of one inequality representing each facet of P . If dim(P ) = n− k with k > 0, then P is described by a maximal set of linearly independent rows of (A, b), as well as one inequality representing each facet of P .
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
