Advertisement
Published in:
1986 | OriginalPaper | Chapter
Zero-One Linear Programming
Author : Dr. H. T. Lau
Published in: Combinatorial Heuristic Algorithms with FORTRAN
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Consider the zero-one linear programming problem $$ {\text{maximize}}\;Z = \sum\limits_{{j = 1}}^{n} {{{c}_{j}}{{x}_{j}}} $$$$ subject{\mkern 1mu} to\;\sum\limits_{{j = 1}}^{n} {{{a}_{{ij}}}{{x}_{j}}{{b}_{i}}\left( {i = 1,2, \ldots ,m} \right)} $$$$ {{x}_{j}} = 0{\mkern 1mu} ,1\;\left( {j = 1,2, \ldots ,n} \right) $$ such that all the data aij, bi cj are nonnegative.