An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literatu...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Chaiblaine, Yacine [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2021 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Optimization letters - Springer Berlin Heidelberg, 2007, 16(2021), 3 vom: 14. Juni, Seite 1035-1049 |
|---|---|
| Übergeordnetes Werk: |
volume:16 ; year:2021 ; number:3 ; day:14 ; month:06 ; pages:1035-1049 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11590-021-01758-5 |
|---|
| Katalog-ID: |
OLC2078307300 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2078307300 | ||
| 003 | DE-627 | ||
| 005 | 20230506001700.0 | ||
| 007 | tu | ||
| 008 | 221220s2021 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11590-021-01758-5 |2 doi | |
| 035 | |a (DE-627)OLC2078307300 | ||
| 035 | |a (DE-He213)s11590-021-01758-5-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 082 | 0 | 4 | |a 510 |q VZ |
| 100 | 1 | |a Chaiblaine, Yacine |e verfasserin |0 (orcid)0000-0002-8935-1020 |4 aut | |
| 245 | 1 | 0 | |a An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 | ||
| 520 | |a Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method. | ||
| 650 | 4 | |a Multiobjective programming | |
| 650 | 4 | |a Fractional programming | |
| 650 | 4 | |a Integer programming | |
| 650 | 4 | |a Nonlinear programming | |
| 700 | 1 | |a Moulaï, Mustapha |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Optimization letters |d Springer Berlin Heidelberg, 2007 |g 16(2021), 3 vom: 14. Juni, Seite 1035-1049 |w (DE-627)527562920 |w (DE-600)2274663-8 |w (DE-576)272713724 |x 1862-4472 |7 nnns |
| 773 | 1 | 8 | |g volume:16 |g year:2021 |g number:3 |g day:14 |g month:06 |g pages:1035-1049 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11590-021-01758-5 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 951 | |a AR | ||
| 952 | |d 16 |j 2021 |e 3 |b 14 |c 06 |h 1035-1049 | ||
| author_variant |
y c yc m m mm |
|---|---|
| matchkey_str |
article:18624472:2021----::nxcmtofrpiiigqartcucinvrhefceteomlibetvi |
| hierarchy_sort_str |
2021 |
| publishDate |
2021 |
| allfields |
10.1007/s11590-021-01758-5 doi (DE-627)OLC2078307300 (DE-He213)s11590-021-01758-5-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Chaiblaine, Yacine verfasserin (orcid)0000-0002-8935-1020 aut An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method. Multiobjective programming Fractional programming Integer programming Nonlinear programming Moulaï, Mustapha aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2021), 3 vom: 14. Juni, Seite 1035-1049 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2021 number:3 day:14 month:06 pages:1035-1049 https://doi.org/10.1007/s11590-021-01758-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2021 3 14 06 1035-1049 |
| spelling |
10.1007/s11590-021-01758-5 doi (DE-627)OLC2078307300 (DE-He213)s11590-021-01758-5-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Chaiblaine, Yacine verfasserin (orcid)0000-0002-8935-1020 aut An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method. Multiobjective programming Fractional programming Integer programming Nonlinear programming Moulaï, Mustapha aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2021), 3 vom: 14. Juni, Seite 1035-1049 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2021 number:3 day:14 month:06 pages:1035-1049 https://doi.org/10.1007/s11590-021-01758-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2021 3 14 06 1035-1049 |
| allfields_unstemmed |
10.1007/s11590-021-01758-5 doi (DE-627)OLC2078307300 (DE-He213)s11590-021-01758-5-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Chaiblaine, Yacine verfasserin (orcid)0000-0002-8935-1020 aut An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method. Multiobjective programming Fractional programming Integer programming Nonlinear programming Moulaï, Mustapha aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2021), 3 vom: 14. Juni, Seite 1035-1049 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2021 number:3 day:14 month:06 pages:1035-1049 https://doi.org/10.1007/s11590-021-01758-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2021 3 14 06 1035-1049 |
| allfieldsGer |
10.1007/s11590-021-01758-5 doi (DE-627)OLC2078307300 (DE-He213)s11590-021-01758-5-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Chaiblaine, Yacine verfasserin (orcid)0000-0002-8935-1020 aut An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method. Multiobjective programming Fractional programming Integer programming Nonlinear programming Moulaï, Mustapha aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2021), 3 vom: 14. Juni, Seite 1035-1049 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2021 number:3 day:14 month:06 pages:1035-1049 https://doi.org/10.1007/s11590-021-01758-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2021 3 14 06 1035-1049 |
| allfieldsSound |
10.1007/s11590-021-01758-5 doi (DE-627)OLC2078307300 (DE-He213)s11590-021-01758-5-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ Chaiblaine, Yacine verfasserin (orcid)0000-0002-8935-1020 aut An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method. Multiobjective programming Fractional programming Integer programming Nonlinear programming Moulaï, Mustapha aut Enthalten in Optimization letters Springer Berlin Heidelberg, 2007 16(2021), 3 vom: 14. Juni, Seite 1035-1049 (DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 1862-4472 nnns volume:16 year:2021 number:3 day:14 month:06 pages:1035-1049 https://doi.org/10.1007/s11590-021-01758-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 AR 16 2021 3 14 06 1035-1049 |
| language |
English |
| source |
Enthalten in Optimization letters 16(2021), 3 vom: 14. Juni, Seite 1035-1049 volume:16 year:2021 number:3 day:14 month:06 pages:1035-1049 |
| sourceStr |
Enthalten in Optimization letters 16(2021), 3 vom: 14. Juni, Seite 1035-1049 volume:16 year:2021 number:3 day:14 month:06 pages:1035-1049 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Multiobjective programming Fractional programming Integer programming Nonlinear programming |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Optimization letters |
| authorswithroles_txt_mv |
Chaiblaine, Yacine @@aut@@ Moulaï, Mustapha @@aut@@ |
| publishDateDaySort_date |
2021-06-14T00:00:00Z |
| hierarchy_top_id |
527562920 |
| dewey-sort |
3510 |
| id |
OLC2078307300 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2078307300</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506001700.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11590-021-01758-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2078307300</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11590-021-01758-5-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chaiblaine, Yacine</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-8935-1020</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiobjective programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fractional programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Nonlinear programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moulaï, Mustapha</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Optimization letters</subfield><subfield code="d">Springer Berlin Heidelberg, 2007</subfield><subfield code="g">16(2021), 3 vom: 14. Juni, Seite 1035-1049</subfield><subfield code="w">(DE-627)527562920</subfield><subfield code="w">(DE-600)2274663-8</subfield><subfield code="w">(DE-576)272713724</subfield><subfield code="x">1862-4472</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:3</subfield><subfield code="g">day:14</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:1035-1049</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11590-021-01758-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2021</subfield><subfield code="e">3</subfield><subfield code="b">14</subfield><subfield code="c">06</subfield><subfield code="h">1035-1049</subfield></datafield></record></collection>
|
| author |
Chaiblaine, Yacine |
| spellingShingle |
Chaiblaine, Yacine ddc 510 misc Multiobjective programming misc Fractional programming misc Integer programming misc Nonlinear programming An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program |
| authorStr |
Chaiblaine, Yacine |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)527562920 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1862-4472 |
| topic_title |
510 VZ An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program Multiobjective programming Fractional programming Integer programming Nonlinear programming |
| topic |
ddc 510 misc Multiobjective programming misc Fractional programming misc Integer programming misc Nonlinear programming |
| topic_unstemmed |
ddc 510 misc Multiobjective programming misc Fractional programming misc Integer programming misc Nonlinear programming |
| topic_browse |
ddc 510 misc Multiobjective programming misc Fractional programming misc Integer programming misc Nonlinear programming |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Optimization letters |
| hierarchy_parent_id |
527562920 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Optimization letters |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)527562920 (DE-600)2274663-8 (DE-576)272713724 |
| title |
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program |
| ctrlnum |
(DE-627)OLC2078307300 (DE-He213)s11590-021-01758-5-p |
| title_full |
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program |
| author_sort |
Chaiblaine, Yacine |
| journal |
Optimization letters |
| journalStr |
Optimization letters |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2021 |
| contenttype_str_mv |
txt |
| container_start_page |
1035 |
| author_browse |
Chaiblaine, Yacine Moulaï, Mustapha |
| container_volume |
16 |
| class |
510 VZ |
| format_se |
Aufsätze |
| author-letter |
Chaiblaine, Yacine |
| doi_str_mv |
10.1007/s11590-021-01758-5 |
| normlink |
(ORCID)0000-0002-8935-1020 |
| normlink_prefix_str_mv |
(orcid)0000-0002-8935-1020 |
| dewey-full |
510 |
| title_sort |
an exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program |
| title_auth |
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program |
| abstract |
Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
| abstractGer |
Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
| abstract_unstemmed |
Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW GBV_ILN_267 GBV_ILN_2018 |
| container_issue |
3 |
| title_short |
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program |
| url |
https://doi.org/10.1007/s11590-021-01758-5 |
| remote_bool |
false |
| author2 |
Moulaï, Mustapha |
| author2Str |
Moulaï, Mustapha |
| ppnlink |
527562920 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11590-021-01758-5 |
| up_date |
2024-07-03T19:48:44.130Z |
| _version_ |
1803588598896787456 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2078307300</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506001700.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11590-021-01758-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2078307300</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11590-021-01758-5-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chaiblaine, Yacine</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-8935-1020</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Optimizing a function over the efficient set of a multiojective problem plays an important role in many fields of application. This problem arises whenever the decision maker wants to select the efficient solution that optimizes his utility function. Several methods are proposed in literature to deal with the problem of optimizing a linear function over the efficient set of a multiobjective integer linear program MOILFP. However, in many real-world problems, the objective functions or the utility function are nonlinear. In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP. The proposed method solves a sequence of quadratic integer problems. Where, at each iteration, the search domain is reduced s6uccessively, by introducing cuts, to eliminate dominated solutions. We conducted a computational experiment, by solving randomly generated instances, to analyze the performance of the proposed method.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiobjective programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fractional programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Nonlinear programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moulaï, Mustapha</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Optimization letters</subfield><subfield code="d">Springer Berlin Heidelberg, 2007</subfield><subfield code="g">16(2021), 3 vom: 14. Juni, Seite 1035-1049</subfield><subfield code="w">(DE-627)527562920</subfield><subfield code="w">(DE-600)2274663-8</subfield><subfield code="w">(DE-576)272713724</subfield><subfield code="x">1862-4472</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:3</subfield><subfield code="g">day:14</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:1035-1049</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11590-021-01758-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2021</subfield><subfield code="e">3</subfield><subfield code="b">14</subfield><subfield code="c">06</subfield><subfield code="h">1035-1049</subfield></datafield></record></collection>
|
| score |
7.3984184 |