schliessen

Filtern

 

Bibliotheken

Cover Image

Generalized Column Generation for Linear Programming

Column generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information is generated at each iteration of the simplex algorithm. This paper shows tha... Full description

Journal Title: Management Science 2002, Vol.48 (3), p.444-452
Main Author: Ogtildeuz, Osman
Format: Electronic Article Electronic Article
Language: English
Subjects:
Algorithms
Coefficients
Column generation
Experimentation
Integer programming
Linear programming
Management
Management science
Mathematical models
Mathematical vectors
Methods
Objective functions
Optimization
Simplex algorithm
Simplex method
Small scale optimization
Studies
Variable coefficients
Variables
Zero vectors
Quelle: Alma/SFX Local Collection
Publisher: Linthicum: INFORMS
ID: ISSN: 0025-1909
Link: http://econpapers.repec.org/article/inmormnsc/v_3a48_3ay_3a2002_3ai_3a3_3ap_3a444-452.htm
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: cdi_repec_primary_inmormnsc_v_3a48_3ay_3a2002_3ai_3a3_3ap_3a444_452_htm
title: Generalized Column Generation for Linear Programming
format: Article
creator:
  • Ogtildeuz, Osman
subjects:
  • Algorithms
  • Coefficients
  • Column generation
  • Experimentation
  • Integer programming
  • Linear programming
  • Management
  • Management science
  • Mathematical models
  • Mathematical vectors
  • Methods
  • Objective functions
  • Optimization
  • Simplex algorithm
  • Simplex method
  • Small scale optimization
  • Studies
  • Variable coefficients
  • Variables
  • Zero vectors
ispartof: Management Science, 2002, Vol.48 (3), p.444-452
description: Column generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information is generated at each iteration of the simplex algorithm. This paper shows that, even if the number of variables is low enough for explicit inclusion in the model with the available technology, it may still be more efficient to resort to column generation for some class of problems.
language: eng
source: Alma/SFX Local Collection
identifier: ISSN: 0025-1909
fulltext: fulltext
issn:
  • 0025-1909
  • 1526-5501
url: Link


@attributes
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
RANK1.8980219
LOCALfalse
PrimoNMBib
record
control
sourceidgale_repec
recordidTN_cdi_repec_primary_inmormnsc_v_3a48_3ay_3a2002_3ai_3a3_3ap_3a444_452_htm
sourceformatXML
sourcesystemPC
galeidA86064678
jstor_id822576
sourcerecordidA86064678
originalsourceidFETCH-LOGICAL-1689t-c6468cb439fbbf7ea1161a93bcc7109f1331c32bb6bf96950b0e9fee6819b6f73
addsrcrecordideNqNkkuP0zAUhSMEEmXgD8CmYgELlOJX_FiOKhhAFbCAteU4duoqtoOdMBp-PQ6BMiAWKLqx5Pud41znVNVjCHYQcfbSh6x3hO_wjhCyYwyJO9UGNojWTQPg3WoDAGpqKIC4Xz3I-QQAYJzRTUWuTDBJDe6b6bb7OMw-bNetycWwtTFtDy4YlbYfU-yT8t6F_mF1z6ohm0c_14vq8-tXn_Zv6sOHq7f7y0MNKRdTrSmhXLcEC9u2lhkFIYVK4FZrBoGwEGOoMWpb2lpBRQNaYIQ1hnIoWmoZvqjer75xNEG5ZOSYnFfpRkblZBfMJDvTzaO8thIAKBW3XEGsOgGtUB3VrAEdwYAQy5lSvBg-Ww3HFL_MJk_Su6zNMKhg4pwlFoDShi0nP_0LPMU5hTKsRBBDRnmDf0O9Gox0wcYpKb04yktOQZmeLUfW_4DK0xnvdAzGurJ_m39xi2_nXG4_l1d2_XHKvZpz_oNGK61TzDkZe74hCOSSDLkkQxIusSzJkEsyiujdKkpmNPqscMHH9AP_KrFaJOqmFCrRKYsrhUuNS684kQbJ4-SL2ZPV7JSnmM5mHKGG0dKFa3cZPPn8f5_3fNUcy8jXy1__Jfaq0O6M4--9Z-pn
sourcetypeOpen Access Repository
isCDItrue
recordtypearticle
pqid213176853
display
typearticle
titleGeneralized Column Generation for Linear Programming
sourceAlma/SFX Local Collection
creatorOgtildeuz, Osman
creatorcontribOgtildeuz, Osman
descriptionColumn generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information is generated at each iteration of the simplex algorithm. This paper shows that, even if the number of variables is low enough for explicit inclusion in the model with the available technology, it may still be more efficient to resort to column generation for some class of problems.
identifier
0ISSN: 0025-1909
1EISSN: 1526-5501
2DOI: 10.1287/mnsc.48.3.444.7729
3CODEN: MNSCDI
languageeng
publisherLinthicum: INFORMS
subjectAlgorithms ; Coefficients ; Column generation ; Experimentation ; Integer programming ; Linear programming ; Management ; Management science ; Mathematical models ; Mathematical vectors ; Methods ; Objective functions ; Optimization ; Simplex algorithm ; Simplex method ; Small scale optimization ; Studies ; Variable coefficients ; Variables ; Zero vectors
ispartofManagement Science, 2002, Vol.48 (3), p.444-452
rights
0Copyright 2002 INFORMS
1COPYRIGHT 2002 Institute for Operations Research and the Management Sciences
2Copyright Institute for Operations Research and the Management Sciences Mar 2002
lds50peer_reviewed
oafree_for_read
citesFETCH-LOGICAL-1689t-c6468cb439fbbf7ea1161a93bcc7109f1331c32bb6bf96950b0e9fee6819b6f73
links
openurl$$Topenurl_article
openurlfulltext$$Topenurlfull_article
thumbnail$$Usyndetics_thumb_exl
backlink$$Uhttp://econpapers.repec.org/article/inmormnsc/v_3a48_3ay_3a2002_3ai_3a3_3ap_3a444-452.htm$$DView record in RePEc
search
creatorcontribOgtildeuz, Osman
title
0Generalized Column Generation for Linear Programming
1Management Science
descriptionColumn generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information is generated at each iteration of the simplex algorithm. This paper shows that, even if the number of variables is low enough for explicit inclusion in the model with the available technology, it may still be more efficient to resort to column generation for some class of problems.
subject
0Algorithms
1Coefficients
2Column generation
3Experimentation
4Integer programming
5Linear programming
6Management
7Management science
8Mathematical models
9Mathematical vectors
10Methods
11Objective functions
12Optimization
13Simplex algorithm
14Simplex method
15Small scale optimization
16Studies
17Variable coefficients
18Variables
19Zero vectors
issn
00025-1909
11526-5501
fulltexttrue
rsrctypearticle
creationdate2002
recordtypearticle
recordideNqNkkuP0zAUhSMEEmXgD8CmYgELlOJX_FiOKhhAFbCAteU4duoqtoOdMBp-PQ6BMiAWKLqx5Pud41znVNVjCHYQcfbSh6x3hO_wjhCyYwyJO9UGNojWTQPg3WoDAGpqKIC4Xz3I-QQAYJzRTUWuTDBJDe6b6bb7OMw-bNetycWwtTFtDy4YlbYfU-yT8t6F_mF1z6ohm0c_14vq8-tXn_Zv6sOHq7f7y0MNKRdTrSmhXLcEC9u2lhkFIYVK4FZrBoGwEGOoMWpb2lpBRQNaYIQ1hnIoWmoZvqjer75xNEG5ZOSYnFfpRkblZBfMJDvTzaO8thIAKBW3XEGsOgGtUB3VrAEdwYAQy5lSvBg-Ww3HFL_MJk_Su6zNMKhg4pwlFoDShi0nP_0LPMU5hTKsRBBDRnmDf0O9Gox0wcYpKb04yktOQZmeLUfW_4DK0xnvdAzGurJ_m39xi2_nXG4_l1d2_XHKvZpz_oNGK61TzDkZe74hCOSSDLkkQxIusSzJkEsyiujdKkpmNPqscMHH9AP_KrFaJOqmFCrRKYsrhUuNS684kQbJ4-SL2ZPV7JSnmM5mHKGG0dKFa3cZPPn8f5_3fNUcy8jXy1__Jfaq0O6M4--9Z-pn
startdate20020301
enddate20020301
creatorOgtildeuz, Osman
general
0INFORMS
1Institute for Operations Research and the Management Sciences
2Institute for Operations Research and the Management Sciences (INFORMS)
scope
0DKI
1X2L
2AAYXX
3CITATION
40U~
51-H
63V.
77WY
87WZ
97X5
107XB
1187Z
1288C
1388G
148A3
158AO
168BJ
178FI
188FJ
198FK
208FL
21ABUWG
22AZQEC
23BENPR
24BEZIV
25DWQXO
26FQK
27FRNLG
28FYUFA
29F~G
30GHDGH
31GNUQQ
32JBE
33K60
34K6~
35L.-
36L.0
37M0C
38M0T
39M2M
40PQBIZ
41PQBZA
42PQEST
43PQQKQ
44PQUKI
45PRINS
46PYYUZ
47Q9U
48BOBZL
49CLFQK
sort
creationdate20020301
titleGeneralized Column Generation for Linear Programming
authorOgtildeuz, Osman
facets
frbrtype5
frbrgroupidcdi_FETCH-LOGICAL-1689t-c6468cb439fbbf7ea1161a93bcc7109f1331c32bb6bf96950b0e9fee6819b6f73
rsrctypearticles
prefilterarticles
languageeng
creationdate2002
topic
0Algorithms
1Coefficients
2Column generation
3Experimentation
4Integer programming
5Linear programming
6Management
7Management science
8Mathematical models
9Mathematical vectors
10Methods
11Objective functions
12Optimization
13Simplex algorithm
14Simplex method
15Small scale optimization
16Studies
17Variable coefficients
18Variables
19Zero vectors
toplevel
0peer_reviewed
1online_resources
creatorcontribOgtildeuz, Osman
collection
0RePEc IDEAS
1RePEc
2CrossRef
3Global News & ABI/Inform Professional
4Trade PRO
5ProQuest Central (Corporate)
6ABI/INFORM Collection
7ABI/INFORM Global (PDF only)
8Entrepreneurship Database
9ProQuest Central (purchase pre-March 2016)
10ABI/INFORM Global (Alumni Edition)
11Healthcare Administration Database (Alumni)
12Psychology Database (Alumni)
13Entrepreneurship Database (Alumni Edition)
14ProQuest Pharma Collection
15International Bibliography of the Social Sciences (IBSS)
16Hospital Premium Collection
17Hospital Premium Collection (Alumni Edition)
18ProQuest Central (Alumni) (purchase pre-March 2016)
19ABI/INFORM Collection (Alumni Edition)
20ProQuest Central (Alumni Edition)
21ProQuest Central Essentials
22ProQuest Central
23Business Premium Collection
24ProQuest Central Korea
25International Bibliography of the Social Sciences
26Business Premium Collection (Alumni)
27Health Research Premium Collection
28ABI/INFORM Global (Corporate)
29Health Research Premium Collection (Alumni)
30ProQuest Central Student
31International Bibliography of the Social Sciences
32ProQuest Business Collection (Alumni Edition)
33ProQuest Business Collection
34ABI/INFORM Professional Advanced
35ABI/INFORM Professional Standard
36ABI/INFORM Global
37Healthcare Administration Database
38Psychology Database
39ProQuest One Business
40ProQuest One Business (Alumni)
41ProQuest One Academic Eastern Edition
42ProQuest One Academic
43ProQuest One Academic UKI Edition
44ProQuest Central China
45ABI/INFORM Collection China
46ProQuest Central Basic
47OpenAIRE (Open Access)
48OpenAIRE
jtitleManagement Science
delivery
delcategoryRemote Search Resource
fulltextfulltext
addata
auOgtildeuz, Osman
formatjournal
genrearticle
ristypeJOUR
atitleGeneralized Column Generation for Linear Programming
jtitleManagement Science
seriestitleManagement Science
date2002-03-01
risdate2002
volume48
issue3
spage444
epage452
pages444-452
issn0025-1909
eissn1526-5501
codenMNSCDI
abstractColumn generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information is generated at each iteration of the simplex algorithm. This paper shows that, even if the number of variables is low enough for explicit inclusion in the model with the available technology, it may still be more efficient to resort to column generation for some class of problems.
copLinthicum
pubINFORMS
doi10.1287/mnsc.48.3.444.7729
oafree_for_read