SOME DIFFICULTIES AND IMPROVEMENTS IN APPLYING LINEAR PROGRAMMING FORMULATIONS TO THE DISCRIMINANT PROBLEM
In this paper, we discuss some disturbing features of two linear programming (LP) approaches to the discriminant problem. Specifically, we show that both approaches are sensitive to the choice of origin for the data although, intuitively, placement of origin should have no effect on the method of as...
Gespeichert in:
| Veröffentlicht in: | Decision sciences 1985-07, Vol.16 (3), p.237-247 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 247 |
|---|---|
| container_issue | 3 |
| container_start_page | 237 |
| container_title | Decision sciences |
| container_volume | 16 |
| creator | Markowski, Edward P. Markowski, Carol A. |
| description | In this paper, we discuss some disturbing features of two linear programming (LP) approaches to the discriminant problem. Specifically, we show that both approaches are sensitive to the choice of origin for the data although, intuitively, placement of origin should have no effect on the method of assigning cases to groups. In addition, we show that these LP approaches may lead to discriminant functions which assign all cases to the same group. We show that the usual statistical approach to this problem does not share these difficulties, and we make recommendations for implementing these LP approaches which help to alleviate the difficulties. |
| doi_str_mv | 10.1111/j.1540-5915.1985.tb01677.x |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_198080333</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1059264</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3847-759ac22e6d2444450b326ba50713f56942de74b7411ace570ef541bb6d75fdb33</originalsourceid><addsrcrecordid>eNqVkF9PgzAUxRujiXP6HZq9gy2lLfhikHWskT8LMI1PDWwlGU43YYvbtxeyZe_el5vcc87vJgeAEUYm7uaxNjG1kUFdTE3sOtTclQgzzs3DFRhcpGswQAhjgxNMb8Fd29YIIUZtMgB1lkQCjuVkIv15mEuRQS8eQxnN0uRNRCLOMyhj6M1m4YeMAxjKWHgp7NQg9aKoP02SNJqHXi6TOIN5AvNpD8z8VHayF-e9-SUU0T24qYp1qx_OewjmE5H7UyNMAul7obEgjs0NTt1iYVmaLS27G4pKYrGyoIhjUlHm2tZSc7vkNsbFQlOOdEVtXJZsyWm1LAkZgtGJu202P3vd7lS92Tff3UvVVYQcREhvejqZFs2mbRtdqW2z-iqao8JI9dWqWvX9qb6_PkfVuVp16MLPp_Dvaq2P_0iqsfClRXhHME6EVbvThwuhaD4V44RT9R4HymHBq4VYoBj5Awrthlk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>198080333</pqid></control><display><type>article</type><title>SOME DIFFICULTIES AND IMPROVEMENTS IN APPLYING LINEAR PROGRAMMING FORMULATIONS TO THE DISCRIMINANT PROBLEM</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Markowski, Edward P. ; Markowski, Carol A.</creator><creatorcontrib>Markowski, Edward P. ; Markowski, Carol A.</creatorcontrib><description>In this paper, we discuss some disturbing features of two linear programming (LP) approaches to the discriminant problem. Specifically, we show that both approaches are sensitive to the choice of origin for the data although, intuitively, placement of origin should have no effect on the method of assigning cases to groups. In addition, we show that these LP approaches may lead to discriminant functions which assign all cases to the same group. We show that the usual statistical approach to this problem does not share these difficulties, and we make recommendations for implementing these LP approaches which help to alleviate the difficulties.</description><identifier>ISSN: 0011-7315</identifier><identifier>EISSN: 1540-5915</identifier><identifier>DOI: 10.1111/j.1540-5915.1985.tb01677.x</identifier><identifier>CODEN: DESCDQ</identifier><language>eng</language><publisher>Oxford, UK: Blackwell Publishing Ltd</publisher><subject>Discriminant analysis ; Linear Programming ; Statistical methods ; Statistical Techniques</subject><ispartof>Decision sciences, 1985-07, Vol.16 (3), p.237-247</ispartof><rights>Copyright American Institute for Decision Sciences Summer 1985</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3847-759ac22e6d2444450b326ba50713f56942de74b7411ace570ef541bb6d75fdb33</citedby><cites>FETCH-LOGICAL-c3847-759ac22e6d2444450b326ba50713f56942de74b7411ace570ef541bb6d75fdb33</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1111%2Fj.1540-5915.1985.tb01677.x$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1111%2Fj.1540-5915.1985.tb01677.x$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Markowski, Edward P.</creatorcontrib><creatorcontrib>Markowski, Carol A.</creatorcontrib><title>SOME DIFFICULTIES AND IMPROVEMENTS IN APPLYING LINEAR PROGRAMMING FORMULATIONS TO THE DISCRIMINANT PROBLEM</title><title>Decision sciences</title><description>In this paper, we discuss some disturbing features of two linear programming (LP) approaches to the discriminant problem. Specifically, we show that both approaches are sensitive to the choice of origin for the data although, intuitively, placement of origin should have no effect on the method of assigning cases to groups. In addition, we show that these LP approaches may lead to discriminant functions which assign all cases to the same group. We show that the usual statistical approach to this problem does not share these difficulties, and we make recommendations for implementing these LP approaches which help to alleviate the difficulties.</description><subject>Discriminant analysis</subject><subject>Linear Programming</subject><subject>Statistical methods</subject><subject>Statistical Techniques</subject><issn>0011-7315</issn><issn>1540-5915</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1985</creationdate><recordtype>article</recordtype><recordid>eNqVkF9PgzAUxRujiXP6HZq9gy2lLfhikHWskT8LMI1PDWwlGU43YYvbtxeyZe_el5vcc87vJgeAEUYm7uaxNjG1kUFdTE3sOtTclQgzzs3DFRhcpGswQAhjgxNMb8Fd29YIIUZtMgB1lkQCjuVkIv15mEuRQS8eQxnN0uRNRCLOMyhj6M1m4YeMAxjKWHgp7NQg9aKoP02SNJqHXi6TOIN5AvNpD8z8VHayF-e9-SUU0T24qYp1qx_OewjmE5H7UyNMAul7obEgjs0NTt1iYVmaLS27G4pKYrGyoIhjUlHm2tZSc7vkNsbFQlOOdEVtXJZsyWm1LAkZgtGJu202P3vd7lS92Tff3UvVVYQcREhvejqZFs2mbRtdqW2z-iqao8JI9dWqWvX9qb6_PkfVuVp16MLPp_Dvaq2P_0iqsfClRXhHME6EVbvThwuhaD4V44RT9R4HymHBq4VYoBj5Awrthlk</recordid><startdate>198507</startdate><enddate>198507</enddate><creator>Markowski, Edward P.</creator><creator>Markowski, Carol A.</creator><general>Blackwell Publishing Ltd</general><general>American Institute for Decision Sciences</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8BJ</scope><scope>8FD</scope><scope>FQK</scope><scope>FR3</scope><scope>JBE</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>198507</creationdate><title>SOME DIFFICULTIES AND IMPROVEMENTS IN APPLYING LINEAR PROGRAMMING FORMULATIONS TO THE DISCRIMINANT PROBLEM</title><author>Markowski, Edward P. ; Markowski, Carol A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3847-759ac22e6d2444450b326ba50713f56942de74b7411ace570ef541bb6d75fdb33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1985</creationdate><topic>Discriminant analysis</topic><topic>Linear Programming</topic><topic>Statistical methods</topic><topic>Statistical Techniques</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Markowski, Edward P.</creatorcontrib><creatorcontrib>Markowski, Carol A.</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>Technology Research Database</collection><collection>International Bibliography of the Social Sciences</collection><collection>Engineering Research Database</collection><collection>International Bibliography of the Social Sciences</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Decision sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Markowski, Edward P.</au><au>Markowski, Carol A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>SOME DIFFICULTIES AND IMPROVEMENTS IN APPLYING LINEAR PROGRAMMING FORMULATIONS TO THE DISCRIMINANT PROBLEM</atitle><jtitle>Decision sciences</jtitle><date>1985-07</date><risdate>1985</risdate><volume>16</volume><issue>3</issue><spage>237</spage><epage>247</epage><pages>237-247</pages><issn>0011-7315</issn><eissn>1540-5915</eissn><coden>DESCDQ</coden><abstract>In this paper, we discuss some disturbing features of two linear programming (LP) approaches to the discriminant problem. Specifically, we show that both approaches are sensitive to the choice of origin for the data although, intuitively, placement of origin should have no effect on the method of assigning cases to groups. In addition, we show that these LP approaches may lead to discriminant functions which assign all cases to the same group. We show that the usual statistical approach to this problem does not share these difficulties, and we make recommendations for implementing these LP approaches which help to alleviate the difficulties.</abstract><cop>Oxford, UK</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1111/j.1540-5915.1985.tb01677.x</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0011-7315 |
| ispartof | Decision sciences, 1985-07, Vol.16 (3), p.237-247 |
| issn | 0011-7315 1540-5915 |
| language | eng |
| recordid | cdi_proquest_journals_198080333 |
| source | Wiley Online Library Journals Frontfile Complete |
| subjects | Discriminant analysis Linear Programming Statistical methods Statistical Techniques |
| title | SOME DIFFICULTIES AND IMPROVEMENTS IN APPLYING LINEAR PROGRAMMING FORMULATIONS TO THE DISCRIMINANT PROBLEM |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T01%3A48%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=SOME%20DIFFICULTIES%20AND%20IMPROVEMENTS%20IN%20APPLYING%20LINEAR%20PROGRAMMING%20FORMULATIONS%20TO%20THE%20DISCRIMINANT%20PROBLEM&rft.jtitle=Decision%20sciences&rft.au=Markowski,%20Edward%20P.&rft.date=1985-07&rft.volume=16&rft.issue=3&rft.spage=237&rft.epage=247&rft.pages=237-247&rft.issn=0011-7315&rft.eissn=1540-5915&rft.coden=DESCDQ&rft_id=info:doi/10.1111/j.1540-5915.1985.tb01677.x&rft_dat=%3Cproquest_cross%3E1059264%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=198080333&rft_id=info:pmid/&rfr_iscdi=true |