Eintrag weiter verarbeiten
A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem”
Gespeichert in:
| Zeitschriftentitel: | Decision Sciences |
|---|---|
| Personen und Körperschaften: | |
| In: | Decision Sciences, 23, 1992, 4, S. 1023-1025 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Wiley
|
| Schlagwörter: |
| author_facet |
Rajagopalan, S. Rajagopalan, S. |
|---|---|
| author |
Rajagopalan, S. |
| spellingShingle |
Rajagopalan, S. Decision Sciences A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” Management of Technology and Innovation Information Systems and Management Strategy and Management General Business, Management and Accounting |
| author_sort |
rajagopalan, s. |
| spelling |
Rajagopalan, S. 0011-7315 1540-5915 Wiley Management of Technology and Innovation Information Systems and Management Strategy and Management General Business, Management and Accounting http://dx.doi.org/10.1111/j.1540-5915.1992.tb00433.x <jats:title>ABSTRACT</jats:title><jats:p>In a recent paper, McKnew, Saydam, and Coleman [3] presented a novel zero‐one integer programming formulation of the multilevel dynamic, deterministic lot‐sizing problem in assembly systems. They stated that “the relaxed linear programming solution to this formulation will always be integer’ [3, p. 280] since the constraint matrix is totally unimodular. In this note, we point out that the constraint matrix is not totally unimodular and therefore the authors’claim that a linear relaxation of the zero‐one integer formulation always yields an integer solution is not true.</jats:p> A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” Decision Sciences |
| doi_str_mv |
10.1111/j.1540-5915.1992.tb00433.x |
| facet_avail |
Online |
| finc_class_facet |
Wirtschaftswissenschaften Informatik |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9qLjE1NDAtNTkxNS4xOTkyLnRiMDA0MzMueA |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9qLjE1NDAtNTkxNS4xOTkyLnRiMDA0MzMueA |
| institution |
DE-15 DE-Pl11 DE-Rs1 DE-105 DE-14 DE-Ch1 DE-L229 DE-D275 DE-Bn3 DE-Brt1 DE-D161 DE-Gla1 DE-Zi4 |
| imprint |
Wiley, 1992 |
| imprint_str_mv |
Wiley, 1992 |
| issn |
0011-7315 1540-5915 |
| issn_str_mv |
0011-7315 1540-5915 |
| language |
English |
| mega_collection |
Wiley (CrossRef) |
| match_str |
rajagopalan1992anoteonanefficientzerooneformulationofthemultilevellotsizingproblem |
| publishDateSort |
1992 |
| publisher |
Wiley |
| recordtype |
ai |
| record_format |
ai |
| series |
Decision Sciences |
| source_id |
49 |
| title |
A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_unstemmed |
A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_full |
A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_fullStr |
A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_full_unstemmed |
A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_short |
A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_sort |
a note on “an efficient zero‐one formulation of the multilevel lot‐sizing problem” |
| topic |
Management of Technology and Innovation Information Systems and Management Strategy and Management General Business, Management and Accounting |
| url |
http://dx.doi.org/10.1111/j.1540-5915.1992.tb00433.x |
| publishDate |
1992 |
| physical |
1023-1025 |
| description |
<jats:title>ABSTRACT</jats:title><jats:p>In a recent paper, McKnew, Saydam, and Coleman [3] presented a novel zero‐one integer programming formulation of the multilevel dynamic, deterministic lot‐sizing problem in assembly systems. They stated that “the relaxed linear programming solution to this formulation will always be integer’ [3, p. 280] since the constraint matrix is totally unimodular. In this note, we point out that the constraint matrix is not totally unimodular and therefore the authors’claim that a linear relaxation of the zero‐one integer formulation always yields an integer solution is not true.</jats:p> |
| container_issue |
4 |
| container_start_page |
1023 |
| container_title |
Decision Sciences |
| container_volume |
23 |
| 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_ |
1792336743362461699 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T15:05:04.001Z |
| 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=A+Note+on+%E2%80%9CAn+Efficient+Zero%E2%80%90One+Formulation+of+the+Multilevel+Lot%E2%80%90Sizing+Problem%E2%80%9D&rft.date=1992-07-01&genre=article&issn=1540-5915&volume=23&issue=4&spage=1023&epage=1025&pages=1023-1025&jtitle=Decision+Sciences&atitle=A+Note+on+%E2%80%9CAn+Efficient+Zero%E2%80%90One+Formulation+of+the+Multilevel+Lot%E2%80%90Sizing+Problem%E2%80%9D&aulast=Rajagopalan&aufirst=S.&rft_id=info%3Adoi%2F10.1111%2Fj.1540-5915.1992.tb00433.x&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792336743362461699 |
| author | Rajagopalan, S. |
| author_facet | Rajagopalan, S., Rajagopalan, S. |
| author_sort | rajagopalan, s. |
| container_issue | 4 |
| container_start_page | 1023 |
| container_title | Decision Sciences |
| container_volume | 23 |
| description | <jats:title>ABSTRACT</jats:title><jats:p>In a recent paper, McKnew, Saydam, and Coleman [3] presented a novel zero‐one integer programming formulation of the multilevel dynamic, deterministic lot‐sizing problem in assembly systems. They stated that “the relaxed linear programming solution to this formulation will always be integer’ [3, p. 280] since the constraint matrix is totally unimodular. In this note, we point out that the constraint matrix is not totally unimodular and therefore the authors’claim that a linear relaxation of the zero‐one integer formulation always yields an integer solution is not true.</jats:p> |
| doi_str_mv | 10.1111/j.1540-5915.1992.tb00433.x |
| 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-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9qLjE1NDAtNTkxNS4xOTkyLnRiMDA0MzMueA |
| imprint | Wiley, 1992 |
| imprint_str_mv | Wiley, 1992 |
| institution | DE-15, DE-Pl11, DE-Rs1, DE-105, DE-14, DE-Ch1, DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-D161, DE-Gla1, DE-Zi4 |
| issn | 0011-7315, 1540-5915 |
| issn_str_mv | 0011-7315, 1540-5915 |
| language | English |
| last_indexed | 2024-03-01T15:05:04.001Z |
| match_str | rajagopalan1992anoteonanefficientzerooneformulationofthemultilevellotsizingproblem |
| mega_collection | Wiley (CrossRef) |
| physical | 1023-1025 |
| publishDate | 1992 |
| publishDateSort | 1992 |
| publisher | Wiley |
| record_format | ai |
| recordtype | ai |
| series | Decision Sciences |
| source_id | 49 |
| spelling | Rajagopalan, S. 0011-7315 1540-5915 Wiley Management of Technology and Innovation Information Systems and Management Strategy and Management General Business, Management and Accounting http://dx.doi.org/10.1111/j.1540-5915.1992.tb00433.x <jats:title>ABSTRACT</jats:title><jats:p>In a recent paper, McKnew, Saydam, and Coleman [3] presented a novel zero‐one integer programming formulation of the multilevel dynamic, deterministic lot‐sizing problem in assembly systems. They stated that “the relaxed linear programming solution to this formulation will always be integer’ [3, p. 280] since the constraint matrix is totally unimodular. In this note, we point out that the constraint matrix is not totally unimodular and therefore the authors’claim that a linear relaxation of the zero‐one integer formulation always yields an integer solution is not true.</jats:p> A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” Decision Sciences |
| spellingShingle | Rajagopalan, S., Decision Sciences, A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem”, Management of Technology and Innovation, Information Systems and Management, Strategy and Management, General Business, Management and Accounting |
| title | A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_full | A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_fullStr | A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_full_unstemmed | A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_short | A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| title_sort | a note on “an efficient zero‐one formulation of the multilevel lot‐sizing problem” |
| title_unstemmed | A Note on “An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem” |
| topic | Management of Technology and Innovation, Information Systems and Management, Strategy and Management, General Business, Management and Accounting |
| url | http://dx.doi.org/10.1111/j.1540-5915.1992.tb00433.x |