Eintrag weiter verarbeiten
Parametric Solution of Bicriterion Linear Fractional Programs
Gespeichert in:
| Zeitschriftentitel: | Operations Research |
|---|---|
| Personen und Körperschaften: | |
| In: | Operations Research, 33, 1985, 1, S. 74-84 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Institute for Operations Research and the Management Sciences (INFORMS)
|
| Schlagwörter: |
| author_facet |
Warburton, A. R. Warburton, A. R. |
|---|---|
| author |
Warburton, A. R. |
| spellingShingle |
Warburton, A. R. Operations Research Parametric Solution of Bicriterion Linear Fractional Programs Management Science and Operations Research Computer Science Applications |
| author_sort |
warburton, a. r. |
| spelling |
Warburton, A. R. 0030-364X 1526-5463 Institute for Operations Research and the Management Sciences (INFORMS) Management Science and Operations Research Computer Science Applications http://dx.doi.org/10.1287/opre.33.1.74 <jats:p> We show how certain bicriterion fractional programs can be reduced to a one parameter linear program and a series of one-dimensional maximizations. The resulting algorithm is easily implemented using the PARAROW option of MPSX, and has readily solved problems having up to 300 variables and 150 constraints. As an illustration, we present a simple finite procedure for maximizing the sum of two linear fractional functions subject to linear constraints. </jats:p> Parametric Solution of Bicriterion Linear Fractional Programs Operations Research |
| doi_str_mv |
10.1287/opre.33.1.74 |
| facet_avail |
Online |
| finc_class_facet |
Wirtschaftswissenschaften Informatik |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTI4Ny9vcHJlLjMzLjEuNzQ |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTI4Ny9vcHJlLjMzLjEuNzQ |
| institution |
DE-Brt1 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Pl11 DE-Rs1 DE-105 DE-14 DE-Ch1 DE-L229 DE-D275 DE-Bn3 |
| imprint |
Institute for Operations Research and the Management Sciences (INFORMS), 1985 |
| imprint_str_mv |
Institute for Operations Research and the Management Sciences (INFORMS), 1985 |
| issn |
0030-364X 1526-5463 |
| issn_str_mv |
0030-364X 1526-5463 |
| language |
English |
| mega_collection |
Institute for Operations Research and the Management Sciences (INFORMS) (CrossRef) |
| match_str |
warburton1985parametricsolutionofbicriterionlinearfractionalprograms |
| publishDateSort |
1985 |
| publisher |
Institute for Operations Research and the Management Sciences (INFORMS) |
| recordtype |
ai |
| record_format |
ai |
| series |
Operations Research |
| source_id |
49 |
| title |
Parametric Solution of Bicriterion Linear Fractional Programs |
| title_unstemmed |
Parametric Solution of Bicriterion Linear Fractional Programs |
| title_full |
Parametric Solution of Bicriterion Linear Fractional Programs |
| title_fullStr |
Parametric Solution of Bicriterion Linear Fractional Programs |
| title_full_unstemmed |
Parametric Solution of Bicriterion Linear Fractional Programs |
| title_short |
Parametric Solution of Bicriterion Linear Fractional Programs |
| title_sort |
parametric solution of bicriterion linear fractional programs |
| topic |
Management Science and Operations Research Computer Science Applications |
| url |
http://dx.doi.org/10.1287/opre.33.1.74 |
| publishDate |
1985 |
| physical |
74-84 |
| description |
<jats:p> We show how certain bicriterion fractional programs can be reduced to a one parameter linear program and a series of one-dimensional maximizations. The resulting algorithm is easily implemented using the PARAROW option of MPSX, and has readily solved problems having up to 300 variables and 150 constraints. As an illustration, we present a simple finite procedure for maximizing the sum of two linear fractional functions subject to linear constraints. </jats:p> |
| container_issue |
1 |
| container_start_page |
74 |
| container_title |
Operations Research |
| container_volume |
33 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792330071392911362 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T13:18:38.996Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Parametric+Solution+of+Bicriterion+Linear+Fractional+Programs&rft.date=1985-02-01&genre=article&issn=1526-5463&volume=33&issue=1&spage=74&epage=84&pages=74-84&jtitle=Operations+Research&atitle=Parametric+Solution+of+Bicriterion+Linear+Fractional+Programs&aulast=Warburton&aufirst=A.+R.&rft_id=info%3Adoi%2F10.1287%2Fopre.33.1.74&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792330071392911362 |
| author | Warburton, A. R. |
| author_facet | Warburton, A. R., Warburton, A. R. |
| author_sort | warburton, a. r. |
| container_issue | 1 |
| container_start_page | 74 |
| container_title | Operations Research |
| container_volume | 33 |
| description | <jats:p> We show how certain bicriterion fractional programs can be reduced to a one parameter linear program and a series of one-dimensional maximizations. The resulting algorithm is easily implemented using the PARAROW option of MPSX, and has readily solved problems having up to 300 variables and 150 constraints. As an illustration, we present a simple finite procedure for maximizing the sum of two linear fractional functions subject to linear constraints. </jats:p> |
| doi_str_mv | 10.1287/opre.33.1.74 |
| facet_avail | Online |
| finc_class_facet | Wirtschaftswissenschaften, Informatik |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTI4Ny9vcHJlLjMzLjEuNzQ |
| imprint | Institute for Operations Research and the Management Sciences (INFORMS), 1985 |
| imprint_str_mv | Institute for Operations Research and the Management Sciences (INFORMS), 1985 |
| institution | DE-Brt1, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Pl11, DE-Rs1, DE-105, DE-14, DE-Ch1, DE-L229, DE-D275, DE-Bn3 |
| issn | 0030-364X, 1526-5463 |
| issn_str_mv | 0030-364X, 1526-5463 |
| language | English |
| last_indexed | 2024-03-01T13:18:38.996Z |
| match_str | warburton1985parametricsolutionofbicriterionlinearfractionalprograms |
| mega_collection | Institute for Operations Research and the Management Sciences (INFORMS) (CrossRef) |
| physical | 74-84 |
| publishDate | 1985 |
| publishDateSort | 1985 |
| publisher | Institute for Operations Research and the Management Sciences (INFORMS) |
| record_format | ai |
| recordtype | ai |
| series | Operations Research |
| source_id | 49 |
| spelling | Warburton, A. R. 0030-364X 1526-5463 Institute for Operations Research and the Management Sciences (INFORMS) Management Science and Operations Research Computer Science Applications http://dx.doi.org/10.1287/opre.33.1.74 <jats:p> We show how certain bicriterion fractional programs can be reduced to a one parameter linear program and a series of one-dimensional maximizations. The resulting algorithm is easily implemented using the PARAROW option of MPSX, and has readily solved problems having up to 300 variables and 150 constraints. As an illustration, we present a simple finite procedure for maximizing the sum of two linear fractional functions subject to linear constraints. </jats:p> Parametric Solution of Bicriterion Linear Fractional Programs Operations Research |
| spellingShingle | Warburton, A. R., Operations Research, Parametric Solution of Bicriterion Linear Fractional Programs, Management Science and Operations Research, Computer Science Applications |
| title | Parametric Solution of Bicriterion Linear Fractional Programs |
| title_full | Parametric Solution of Bicriterion Linear Fractional Programs |
| title_fullStr | Parametric Solution of Bicriterion Linear Fractional Programs |
| title_full_unstemmed | Parametric Solution of Bicriterion Linear Fractional Programs |
| title_short | Parametric Solution of Bicriterion Linear Fractional Programs |
| title_sort | parametric solution of bicriterion linear fractional programs |
| title_unstemmed | Parametric Solution of Bicriterion Linear Fractional Programs |
| topic | Management Science and Operations Research, Computer Science Applications |
| url | http://dx.doi.org/10.1287/opre.33.1.74 |