WASET
	%0 Journal Article
	%A G. Shojatalab
	%D 2009
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 27, 2009
	%T Modern Method for Solving Pure Integer Programming Models
	%U https://publications.waset.org/pdf/4238
	%V 27
	%X 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.
	%P 528 - 532