{"title":"具有凸不规则可行集的数学规划问题","authors":"V.N. Nefedov","doi":"10.1016/0041-5553(90)90203-5","DOIUrl":null,"url":null,"abstract":"<div><p>An exact and an approximate method for reducing a mathematical programming problem with a convex irregular feasible set to a mathematical programming problem with a regular feasible set is proposed.</p></div>","PeriodicalId":101271,"journal":{"name":"USSR Computational Mathematics and Mathematical Physics","volume":"30 3","pages":"Pages 145-154"},"PeriodicalIF":0.0000,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0041-5553(90)90203-5","citationCount":"0","resultStr":"{\"title\":\"A mathematical programming problem with a convex irregular feasible set\",\"authors\":\"V.N. Nefedov\",\"doi\":\"10.1016/0041-5553(90)90203-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>An exact and an approximate method for reducing a mathematical programming problem with a convex irregular feasible set to a mathematical programming problem with a regular feasible set is proposed.</p></div>\",\"PeriodicalId\":101271,\"journal\":{\"name\":\"USSR Computational Mathematics and Mathematical Physics\",\"volume\":\"30 3\",\"pages\":\"Pages 145-154\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0041-5553(90)90203-5\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"USSR Computational Mathematics and Mathematical Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0041555390902035\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"USSR Computational Mathematics and Mathematical Physics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0041555390902035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A mathematical programming problem with a convex irregular feasible set
An exact and an approximate method for reducing a mathematical programming problem with a convex irregular feasible set to a mathematical programming problem with a regular feasible set is proposed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
