Modern Method for Solving Pure Integer Programming Models
In this paper, all variables are supposed to be integer
and positive. In this modern method, objective function is assumed to
be maximized or minimized but constraints are always explained like
less or equal to. In this method, choosing a dual combination of ideal
nonequivalent and omitting one of variables. With continuing this
act, finally, having one nonequivalent with (n-m+1) unknown
quantities in which final nonequivalent, m is counter for constraints,
n is counter for variables of decision.
[1] A. Schrijver, "Theory of Liner and Integer Programming," John Wily &
Sons, 1998, ISBN 0-471-98232-6.
[2] F. S. Hillier and G. Y. Lieberman," Introduction to Operations
Research," 8th edition, Mc Graw - Hill, ISBN 0-07-123828-X.
[3] G. B. Dantzig., B. C. Eaves, Fourier and Motzkin, "Elimination and its
dual," Journal of Combinatorial Theory (A), 1973, pp.288-297.
[4] H.A. Taha," Operations Research: An Introduction," 8th ed., Prentice
Hall, 2007, ISBN 0-13-188923-0.
[1] A. Schrijver, "Theory of Liner and Integer Programming," John Wily &
Sons, 1998, ISBN 0-471-98232-6.
[2] F. S. Hillier and G. Y. Lieberman," Introduction to Operations
Research," 8th edition, Mc Graw - Hill, ISBN 0-07-123828-X.
[3] G. B. Dantzig., B. C. Eaves, Fourier and Motzkin, "Elimination and its
dual," Journal of Combinatorial Theory (A), 1973, pp.288-297.
[4] H.A. Taha," Operations Research: An Introduction," 8th ed., Prentice
Hall, 2007, ISBN 0-13-188923-0.
@article{"International Journal of Information, Control and Computer Sciences:53350", author = "G. Shojatalab", title = "Modern Method for Solving Pure Integer Programming Models", abstract = "In this paper, all variables are supposed to be integer
and positive. In this modern method, objective function is assumed to
be maximized or minimized but constraints are always explained like
less or equal to. In this method, choosing a dual combination of ideal
nonequivalent and omitting one of variables. With continuing this
act, finally, having one nonequivalent with (n-m+1) unknown
quantities in which final nonequivalent, m is counter for constraints,
n is counter for variables of decision.", keywords = "Integer, Programming, Operation Research,
Variables of decision.", volume = "3", number = "3", pages = "595-5", }