By Topic

Fabrication and assembly operations, Part IV: Linear programming in production planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

By a Dantzig and Wolfe decomposition, followed by an application of a column generating technique, a problem originally calling for simplex computations on an (I + 5KT)(I + 5KT) matrix (and for the investigation of scalar products with columns as numerous as schedules) is reduced to a problem calling for simplex computations on a (5KT + 1)(5KT + I) matrix and for a string of I associated dynamic programming calculations.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Systems Journal  (Volume:4 ,  Issue: 2 )