2012/             8   4 

        

Formulation and Solving Integer Programming Models by Using
Microsoft Excel
     .
Instructor .Mushtaq .T. Hussain
&  /  #!  $ !  % /! 
'%

      ! .           
*+, + -  .     "!  #! $ %& '!&    $ &   (&)  
 *  0, &    # 1#  '*  !   & &  0   , . /!
0+ /+ ! . #  /&!    & )   #    #& $! 0  & )
+    '*&        '*&  ,&    #   '*    2# - 
  ! *  3*  #   4$     '*& &  4$     '*&  # 
5 +  +!   0$ !  6  7  '*&  8 ) &   '*  '*&   )
1#  *& 97  :  ;   ( &&  solver (  0    !  $ 
.(  <*

Abstract
Integer programming can be applied in numerous business situations.
however, integer programming problems are generally more complex and time
consuming to solve than linear programming problems.
The aim of this research focuses upon the importance using spreadsheet software
package in solving the different models of integer linear programming, this
spreadsheet is simplifying in defeating the difficulty opposite to researchers and
graduate students who have competence and interest in operations research scopes. In
this research we identification four basis of integer programming :pure integer
programming model, mixed integer programming model, binary integer programming
model and mixed binary integer programming model. After that we take case study
for each model and formulate the mathematical model for each case study and so find
the optimal integer solution for each case study by using (solver tool) in excel
program by presenting different solver windows.

Keywords: LinearProgramming, Integer Programming, Microsoft Excel.

347
 2012/             8   4 

Introduction  ) (1
( & +!  &+ #   7     / ! 7  =&# ,     
+7  =&#       & Program    ,  =&# *& (    ! 
&+  + 04:+ + & (    !  ( & !  & (  &    1#  ;   
; + >: 3*& (  - , >!  ;  <*, 7    0$ &  <*, 2# 7&1 
/+! % # # ( !   ?   %:   )  Linearity     .*,& " 7  
+ 1 .-     04:& ( !&  ,   ?    5   %:
+& (@+    ! & ( & !   )% &  6 )  $   *       
&+ & + 4& !   &   4 ) & &  A (&)  (  $ 
0 E+ 2)% > ! 3*  F& (@1   2)% >! 5*  (C... . & %
 )+ + + + 0     2#      0  ) & 1# 2 
. <*, "&     ':    &     .
1
:           *+
 ( !    ( !   ? % &  )$ &   & !

8 )  # 3,  &   3*    .(... & &     
.    
&(Maximize)0 +G  H&+ &      <*,& - ,  '*& # & 

.(Minimize)   
.<: ,* 0   '*&   

 !& / !  &  = &     5 Homogenous A

 +   & &      A 4  ? :$  &  A %
...( 0?08)&  A   !&  ! A
<*+,  (divisibility) ?) F. 2 #  H& &   ?

 + + (4+     $   I     8 !
'*&+  2 +      '*&   ! <*, $  )   
(Andrew J.Mason2007).       
The research problem - %  2(1
& (&) $J   &  ?   $ G  "& &   0!  
*  2#   =&#  /! (&7 =# 5*   0 #  *       
= + +!         * . #  #  (  "&  !  
# @ >#  *, =   *  2# &     #  /&! $ !  # 
* +  ?   &    8 )      '*  0  2# .  /!

348
 2012/             8   4 

<*+, &+ & (  0 % *    I & ! !)   0 % * & 7  & ! !)   0 %

0  *        '*   &  1 &  A " *,&  4$ 0 % *  ? 
. 5        '*&  
The importance of research -  + 3(1
+& &#  %   # &#!   =&!        #  & 
E)  =! 6)  =!) 2# !      <*,   2   5*     
<*+, >+  :+  # - &    <*,   =&!    )   ?  
Solver (  0 +  1  2# -   /!  , @ / ! .1#  ))     
( +  ;  . / !       5  !     ;   ( && 
+  #    #& $!# !7& (&) 0  /! 0    7  '* #      
.     8 )  1  2#  #  /&!    & 6)  5&*

The aim of research - . +4(1

+ # +1#  '*+  !  & &  0   , . 2 /! *, - 
& + 0,+ /+ ! +   # '*&   ) &    ! :     
+ " .    $  5  !    /! "&  & )  $  *   &
    & &  ?     &      '*  $  !   2#    ( 

Integer Linear Programming (ILP)      ( 2

+ 0     *     ?  E   *        
+  & 7    ?   &    '*   $ 3,  .#  &  (  &
 ) !  4  )$     '*&  -  *,& ! !)   0  ( !
.(C... 1 G& 0) )  = *# 1G&  &  )   4 
(John A. Lawrence & others 1998:163)
Types of Integer Programming Models     0  (1.2
+ ?     & : total integer programming models       '*  •
.! !)   &#! * 
I+  +  & : mixed integer programming models #      '*  •
.! !)   0 % *   ?
: pure binary (zero- one) integer programming models + 4$     '*  •
.(0-1) 4$ H&   ?     &

349
 2012/             8   4 

: mixed binary integer programming models +#  + 4$     '*  •

(  0 % & ! !)   0 %   ,  ?   & (binary)  4$   ? I    &
(Joern 2009)
Integer Linear Programming With 1       (3
Microsoft Excel
&  <*, .    '*  $  !         & & 
&.+  ;  .  &    #     7 ( && &     #   $
!  1     -& &    # 1#  '*  ! 2#    (Solver) ! ( 
.'*&   )   ! : '*&  
 )     (1)     •
, $ ! 4  & F : 3*& &  '  &   & ( 
+ . -&+ A   F   % & (  ( lathe   4 & press A 4 )
+. $150  +  + &  9 .    F     $ 100    &  9
(1) 0%  & . I ! & &#     .  ( ! ,J &    4 
+ .    # * 4  H&  #  I ! & 4  H&  F   
+  '*&+  F :=&#  (ft2200).& I ! & ($40000) .& &#   
.   2# # E   <&  5*& 4   4   ! <: # #    
(Taylor 2006).
      '*&  (1)    !   (1) & 
machine Required space ft2 Purchase price
Press 15 8000
Lathe 30 4000

(Bernard W. Taylor” Introduction to management science”, Ninth Edition Virginia  )+ 

Polytechnic Institute and State University.publisher:Prentice Hall 2006).
: &      #     7  ? )  0&    
n
Maximize or Minimize Z= ∑j=1
cjx j

Subject to:
n
i=1, 2,….., m
∑
j= 1
a ij x j ≤ ,= ,≥ b i

xj ≥ 0 & integer j=1,2,…..,n

: ) 3  4 . 

4   A 4 =X1

350
 2012/             8   4 

4     4  =X2

:& $ #  7  ? )   
MaximizeZ = 100 X 1 + 150 X 2
s .t :
15 X 1 + 30 X 2 ≤ 200
8000 X 1 + 4000 X 2 ≤ 40000
X1 , X2 ≥ 0 & int eger

  56      (4

Solution of integer programming models by using excel program
.     (a
.&#   7  ? )  (b
-   # -   (c
.  ? ! (d
.'*&  & % 7 (e
.'*&    ! (f
( Andrew J.Mason 2007 ) . '*&  ! (g

3   (a)

+  ( !& ( !& E 2# 5&! (C5,B5)  :   G!: (1)  :
(+ ?  + : ) 2 +& + + ?  )  0  2# 5&! (C4,B4)  :   & 2#
target -   # ) 2 & (# E) -    % 2# 5&! D5  #     ( changing cells
+ :  + +  +, &      . !  -    % 2# 5&!   #  ,& ( cell
+ +,  )+ + + (     ( input cells    : ) 2 & (C9:B9,C8:B8)
+ :  ;+ + : 2 +&(D9:D8) :      - & % ;& . (F9:F8) : 
.(output cells) ' 

3   (1) 

- 7 / 

351
 2012/             8   4 

%  8  4   (b
,  D5  #  #$   -  "  % '   7  ? )  -& (&  <*, 
+ +  -7+ X1( !&   (E)  =&7 X1 H& (  4  )  (
+ + ;   0 *,& . X2 ( !&   (E )  &7 X2 H& (  4 
E+7& +  . D5=sumproduct(B4:C4,B5:C5)  5 sumproduct 1? +) 0  :
(2)

=Sumproduct(B4:C4,B5:
C5)

=Sumproduct(B8:C8,$B$4:$C$4)
= Sumproduct(B9:C9,$B$4:$C$4)

 8  4   (2)
- 7 /  . 9  %  (c
 + + #! Solver (  0&+ / !(optimization)  #$   * 1 , (&  <*,
: &   '*& #  
+ J G & Solver parameter (* G . Tools  4 solver (   
:   &  > 3*  .( 3)   E7&   (set target cell)1   
1
. 9   # ) 5   :%7 &  % ;+ <)6 $    %  . 9   %
5 =7 ; 7 0$ I  7  #   :  =7 ? ) <*, 0  sumproduct  *
=7 )! ;    -  "  % '   sumproduct(B4:C4,B5:C5) 
+ % : &  =   <*,  . 2   E7&   C4*C5 =7 ;  B4*B5
+ (LHS  -) 0   &   %   . ((   5& -&1) )  A1
2 +  E7&   ( RHS  -)9  &   % 5& & % &  = & %
>+  $ $  : 0   $C$4,$B$4  :     $  : 2# 5&! &  ? )  G!:
  :  <* $  :  0  ! &  D9  #  2 D8  #  ? ) N !   :  <*,
++ E)++ 5 ! !++) ++ 8 &++ D9 ++ #  2++ D8 ++ #  N++ ++ # 
 : 7&     . ! !)     ? ) <*,& D9 =sumproduct(B5:C5,B9:C9)
Andrew ) 1 . D9=sumproduct($B$4:$C$4,B9:C9):   D9  #  ? ) & $
of J.Mason “ Solving linear programs using Microsoft excel solver” university
(Auckland 2007

352
 2012/             8   4 

set target  #  2 & &! * D5  #  -      G   #  2#  
( 3 )  E7&   cell
& 0 +G   *     '*&  - ,  2#  *,& Min & Max   -     
+ =+# +! +   #  <*,  Enter 91  2# ?7  #  <*,  .&  .   
.#  ! Solver

. 9  %  (3)

- 7 / 
Changing Cell ($ 4  = )  ) 3  4  (d
+ ?  -  X2 4 & X1 4 =& 4   (1)    ! 
& (@+1 0 + . ((+ ?   : ) + 2    (C4:B4)  :   )) &  %
C4:B4  0$ Solver parameter (*  ( &&  (By changing cell)  #   "#  J 
.( 4)   E7&   By changing cell  #  

 : 
 ? )( ? 
‫ار‬IJK‫ا‬

$ 4  =  (4) 

- 7 /    # 68 (e

0 + + % 7 O     # 7  '*&  & %   7 0& (&  <*, 
:  &  : (C4:B4)    #  $ &   > !&  

353
 2012/             8   4 

. Add constraint (* G Add     Solver parameter (* 

(  & ,    :   (Cell Reference )  #   Add constraint (* 
0  <*,   > !  %& A1& ( $C$4:$B$4)   ? 0 % $    #   O 
 +  (+ integer+ # &+G G!: # ( int)  &        2 =,*
. &    7 Add P . 2#  ,  .( 5 )  E7&   constraint
Cell )  +  + +   + .  %& !   #$   '*&  & %   7 
      3*  ($D$9:$D$8 ) Add constraint (* ( &&  ( Reference
+ $F$9:$F$8 + :  > (* A1 ( &&  constraint     &(<=)   
( 6 )  E7&   (   &    2# 5&!

+ )   =
 

   )  

 )  (5)

- 7 / 
Cell )  +  + +   + .  + %& !   #$   '*&  & %   7 
      3*  ($D$9:$D$8 ) Add constraint (* ( &&  ( Reference
+ $F$9:$F$8 + :  > (* A1 ( &&  constraint     &(<=)   
( 6 )  E7&   (   &    2# 5&!

  (6) 

- 7 /  )

354
 2012/             8   4 

Add (*+ + &+&  ok . 2# ?7  (&  #$  & %      #    
( 7 )  E7&   Solver parameter (* G constraint

solver> parameter $6 (7) 

- 7 / 

    f
(&) '*&  >   &     '*&  &, # # 7  '*&    
:& Assume linear model   : '*&    -  ! !)
  Solver option (* G Solver parameter (*  &&  Option . ?7 
(8)   E7&
Assume Non-  & . Assume linear modelP     Solver Option (* 
. ok . ?7 Negative

    (8)
- 7 / 

355
 2012/             8   4 

  (g
+   +  .;4+ 2# &)!& '*&  !    E)   7    #    
<*+, +    ( Solve parameter (* G ok . 2# ?7& Assume linear model
. (9)   E7&   Solver Results (* G &$  7 . Solve . 2# ?7 (*

  (9)

- 7 / 

%&  $  ! G1! -&  Keep Solve Solution &     * ( 9) 
0  2# )!  Restore Original Values     *   .(10)   E7&  . 
. %&  ,#    &
@1 7< X1=1 )9@    A 7 6 (10)  56   ?! &   = 
(1000$)+  % ;+  ) 5% B < (X2=6 9@     

?! &   # (10) 

- 7/  

356
 2012/             8   4 

(Mixed Integer Programming) %     (2)     *

(1)H& :1#   $:$  < $   $250000 <   R# 3#  $
&)+!   $ . #!   F (3)H&  7 F (2)H&    # F
+ + #  1# $ 2# #   &  $:$    <*,  4  2#
$12000 I + acre1  1#  &   0 * $9000 <  4  & $50000
<  4  & $8000 #!   1# ( !& &  "  0 * $1500 <  4  &
+ # 4 + +$ F     $   3* 7. ( !&  &  "  0 * $1000
 (MIP)%     C % .#!  20 & I  15 
(Bernard W. Taylor”  1 .1 D1! :%7 ) & ?=? E    0  7
Introduction to management science”, Ninth Edition Virginia Polytechnic Institute
and State University.publisher:Prentice Hall 2006)
 ;   '*&  *, ! &   # #      '*&  !& 8 )
( +   ? &    ?  !  > 3,   (4) (1     &  A1 ,
. ! &  & Solver ( : 1#  *& 2 ( 1 3*

%       8  4     56

n
Maximize or Minimize Z= ∑j=1
cjx j

Subject to:
n

∑
j=1
a ij x j ≤ ,= ,≥ bi i=1, 2,….., m

xj ≥ 0 & some integer j=1,2,…..,n

# #  7  ? )  

Max Z=9000X1+1500X2+1000X3
S.T:

5000X1+12000X2+8000X3 ≤ 250000
X1 ≤4
X2 ≤ 15
X3 ≤ 20
X1, X3 ≥ 0 and int eger
X2 ≥ 0
2 1
0 4000= 1 !  A % ( !& (acre)

357
 2012/             8   4 

: -
  # F= X1
I  F =X2
#!  F =X3

-    %
E5=sumproduct(B4
:D4,B5:D5)

E7=sumproduct(B7:D7,$B$4:$D$4)(1)@ABCD ECFGHID‫رد ا‬MID‫ ا‬NAI‫آ‬

E8=sumproduct(B8:D8,$B$4:$D$4) (2)@ABCD ECFGHID‫رد ا‬MID‫ ا‬NAI‫آ‬
E9=sumproduct(B9:D9,$B$4:$D$4) (3)@ABCD ECFGHID‫رد ا‬MID‫ ا‬NAI‫آ‬
E10=sumproduct(B10:D10,$B$4:$D$4) (4)@ABCD ECFGHID‫رد ا‬MID‫ ا‬NAI‫آ‬

 )  . 9    8  4   (11)

- 7 / 
& (12 )  E7& &   ? & -   # !

 % 

 = 

 =  . 9  %  (12)
- 7 / 

358
 2012/             8   4 

.+ 2+# ?7 : #  5  '*&  & % 7 O   #  <*, F 
(12 )<:   E7&   Add

‫ن‬TUV ‫ ان‬WXY X1 OPQR

OY‫\[د‬
‫ن‬TUV ‫ ان‬WXY X2 OPQR
‫ة‬IP^_`
‫ن‬TUV ‫ ان‬WXY X3 OP_R

 )  (13) 
- 7 / 

+  '*&   ?    0 & '*&    ! Option   2# ?7 3* 
(14 )  E7&

'*&   

OQaKb_K‫\[م ا‬
‫ات‬IQe^PfK

  7    (14)

- 7 / 

359
 2012/             8   4 

Solver Parameter (*+ G Solver Options (*  &&  Ok . ?7 , 
.(15 )  E7&  

Solve H 48

%

  (15)

- 7 / 

‫ول‬i‫ر ا‬bQjK‫[د ا‬kl

mn opb^qK‫ر ا‬brsi
t_‫ اآ‬OR‫ور‬

 3   $6 (16)

- 7 / 
< 1 3 % 4 C   $  2#  G!: $  #  5  !  5*& (17)
.$64750  % ;+  ) & @ .  % 3  7 C   F!   14.5 C 

?!  # (17)

- 7 / 

360
 2012/             8   4 

Binary Integer Programming  @?     (3)     *

BIP
F+ 9+% 0 0  0 :   F 6&)  % *     ( 
+  +  (  .( 7  =  %& 7 #  A# . ! I&!) 0     
I !+ 2+  +7       A   =& / !   <*, F
     <  &  (   & )+ 1#& ()+
(3)    !#     (2)& 

 3% I%   ) A  E#  ! 

4 35000 300 ! I&!
2 10000 90 A# .
7 25000 400 7 # 
3 9000 150  7  =  %
/ 
(Bernard W. Taylor” Introduction to management science”, Ninth Edition Virginia
Polytechnic Institute and State University.publisher:Prentice Hall 2006)
  # *  (12) , % I ! & $ 120000 ,     . ))   ( 
<J =  !&  5 I F. A1  A . & ! I&!   F  ( 
   "   , =  0    ,   &,   (  - , .
. (BIP) @?     % % 58   C : % .     
(Bernard W. Taylor” Introduction to management science”, Ninth : 111 .
Edition Virginia Polytechnic Institute and State University.publisher:Prentice Hall
2006)
  '*&      7  ? ) = <: #  )   7  ? )  F  %
.  4$  
n
Maximize or Minimize Z= ∑ j=1
cjx j

Subject to:
n

∑ a ij x j ≤ ,= ,≥ bi i=1, 2,….., m
j=1

Xj=0 or 1 j=1,2,…..,n
:   & # #  7  ? )
Max Z=300X1+90X2+400X3+150X4
S.T:
35000X1+10000X2+25000X3+9000X4 ≤ 120000
4X1+ 2X2+ 7X3+ 3X4 ≤ 12

361
 2012/             8   4 

X1+ X2 ≤ 1
X1, X2, X3, X4 =0 or 1
 /!
+% F+ = X4+7 #  F = X3A# . F = X2 !# I&! F= X1
 7  = :
. ;  : # # 4$ 5  !    1  E7&   

-    %
Sumproduct(B5:E5,B6:
E6)

(1) # 3#  &   

sumproduct(B8:E8,$B$5:$E$5)
(2) # 3#  &   
sumproduct(B9:E9,$B$5:$E$5)
(3) # 3#  &   
sumproduct(B10:E10,$B$5:$E$5)

 )  . 9    8  4   (18)

- 7 / 
# !
$F$6 - 

( ?   :  !
$B$5:$E$5

 ?  % !
(1 & 0) 

5& & % &  = &   %

 )  $ 4  =  . 9  %  (19)   !&  6)  & 

- 7 / 

362
2012/             8   4 

 !
'*& 

  0  !
 ? 

3  4%   7     (20)

- 7 / 
 9K! !   
 # 56 ?!

  (21)
- 7 / 

 @?     ?!  # (22)

- 7 / 

363
 2012/             8   4 

 &X1=1 !# I&!  F   (  2# "  5* $  4$ 5  ! %&
.     2# ! 6  700 "  3* ! X3=1 7 #
Fixed Cost ? I% (5
5&7 E) -   #& 9 0 G    ,     '*  -   
'*&  8 ) 7   = -  <*,  3* / !  4 $ -  3,  I
(C... (    ! F    4  )-  $ - 7. # # 7 
(John A. Lawrence & others,1998:182) . ' 0!  # &  -  <*, . &
$ - #  7  8 )  0   4$  ?  #   4$     
. $   E7&  &   '*& #
%  @?     (4)    *
2+ $:$ 0. ;  *, ! &8  &)! ' H. $:$ =!)
+ =+# +% =# .    # * ! -  2  3* ! =# . $
( John A. Lawrence : )  :# #     #  &  ' % .  3*&
& others “ Applied management science “ john wiley & sons,Inc.1998 )
7H  E# &    ?   I%   3  (3)  
3 2 1 0 H
450 390 405 ($1000) & $ 1#
12.8 10.5 11.2 ( 1000)%&  5& )!
( John A. Lawrence & others “ Applied management science “ john wiley &
sons,Inc.1998 )
% H  # 3  (4)  

B A % H 
10 12 ( 1000) =# %

( John A. Lawrence & others “ Applied management science “ john wiley &
sons,Inc.1998 )
% H  : 7H     % ) I% (5) 
B A % H  /0 H
15 18 1
10 13 2
14 16 3
( John A. Lawrence & others “ Applied management science “ john wiley &
sons,Inc.1998 )

364
 2012/             8   4 

:      7  ? ) & ! <*, $ 

i  )     0 0 * 0=Yi
i  )     0 * 1
i=1,2,….,m j =# . 2 i  )  &!    =Xij
j=1,2,…,n
m n m
Min∑ ∑ C ij X ij + ∑ FiYi
i =1 j =1 i =1
m
S .T : ∑ X ij = d j
i =1
n n

∑
j=1
X ij − Yi( ∑ d j ) ≤ 0
j =1

X ij ≥ 0 i = 1,2 ,...., m j = 1,2 ,..., n

Yi = 0or 1

: -
j %&  2 i  )  &   =Xij
i  ) # $ 1# =fi
j %&  2 i  )  ( !& ( !&  1# =Cij
j %& # =# =dj

i=1,2,3 i .     0 * 1  i .     0 0 * 0=Yi

j=A,B, j =# . 2 i .  &!    =Xij

Minimize Z = 18x1A + 15x1B +13x2A + 10x2B + 16x3A +

14x3B + 405Y1 + 390Y2 + 450Y3

Subject to:
  %&   & )! % 5&  = =# .  2 .  &    & %
..
x1A + x1B - 11.2Y1 ≤ 0
x2A + x2B -10.5Y2 ≤ 0
x3A + x3B - 12.8Y3 ≤ 0

=# .  2 H.    &!     & %

365
 2012/             8   4 

x1A + x2A + x3A =12

x1B + x2B + x3B = 10

xij ≥ 0 yi = 0 or 1

Solver ( :   *& : $  5  !  <: # #  7  8 )   

 ! 3   (23) 

- 7 / 

-    %
=SUMPRODUCT(B
2:J2,B3:J3)

=SUMPRODUCT(B5:J5,$B$2:$J$2) (1)[QJfK wfr^_PK‫رد ا‬TPK‫ ا‬OQP‫آ‬

=SUMPRODUCT(B6:J6,$B$2:$J$2)(2) [QJfK wfr^_PK‫رد ا‬TPK‫ ا‬OQP‫آ‬
=SUMPRODUCT(B7:J7,$B$2:$J$2)(3)[QJfK wfr^_PK‫رد ا‬TPK‫ ا‬OQP‫آ‬
=SUMPRODUCT(B8:J8,$B$2:$J$2)(4)[QJfK wfr^_PK‫رد ا‬TPK‫ ا‬OQP‫آ‬
=SUMPRODUCT(B9:J9,$B$2:$J$2) (5)[QJfK wfr^_PK‫رد ا‬TPK‫ ا‬OQP‫آ‬

 )  . 9    8  4   (24)

- 7 / 

366
 2012/             8   4 

OxxxxxxQfy [xxxxxxY[kV
$L$2 ‫[ف‬rK‫ا‬
‫ات‬IxxxxxxQe^` bxxxxxxY{y [xxxxxxY[kV
(‫ة‬IxxxxQe^PK‫ ا‬bxxxxY{jK‫ار)ا‬IxxxJK‫ا‬
$B$2:$J$2

‫ن‬TxxUV ‫ ان‬WxxXY mxx^K‫ار ا‬IxxJK‫ ا‬bxxY{y

I|}K‫وي ا‬b_V ‫ او‬Ia‫ اآ‬OPQR ‫ذات‬

‫ن‬TxxUV ‫ ان‬WxxXY mxx^K‫ار ا‬IxxJK‫ ا‬bxxY{y

(1 ‫ او‬0)OPQR ‫ذات‬

(1،2،3)‫د‬TxxxxQJfK I_xxxxYi‫ف ا‬Ixxxx€K‫ا‬

‫وي‬b_xxxx` ‫ او‬txxxxR‫ن ا‬TxxxxUY ‫ ان‬WxxxxXY
(‚xxPYi‫ف ا‬Ixx€K‫)ا‬I_xxQ^PK‫رد ا‬TxxPfK
 )  $ 4  =  . 9  %  (25) 
. [QR tUK
- 7 / 
‫ ان‬WxXY (5‫و‬4)‫د‬TQJfK I_Yi‫ف ا‬I€K‫ا‬
.brq` tUK IQ_^PK‫رد ا‬TPK‫وي ا‬b_Y

(26)   E7&    & #   0 & '*&    ! *, 

  7     (26)

- 7 / 

. 2# ?7  Solver Parameters (* G (Solver Options) (*  ok   2# ?7
(27)   E7&   $  !    #  F  Solve

367
2012/             8   4 

  (27)

- 7 / 

%  @?     ?!  # (28)

- 7 / 

:   $  ! %&

.A =# . 2  $ .   500 5&   
. B =# . 2  $ .   10000 5&   
.A =# . 2 $$ .   11500 5&   
.Y1=0 2& .  . &  F?
.$ 1130.5= )%  % I%

368
 2012/             8   4 

Conclusions and Recommendations 3   3! (6

Conclusions 3! 1(6
'*+  !   & & #  1& 0  &  G &, /! *,  4 - 
+ Solver (  0 + 3*& '*&  )   !  : 1#     
2# 5&!   7    '*  =         &  <*, .  / !  ; 
&  28 &  216 &  ;     %&  / !  & &   ?   
0+ + & &      &    . 0   =&! (* 0! 2#  *,& % &
+   +  ))   8 2#    E) / ! 6)  =!) 2# ! # 
. 7  '* # !      & 

Recommendations 3  2(6

+ #  /&!    & 6)  5&*  #    #& $! )&
+ (&7 )&    7  '*  !  solver ( &  ;      (&7 2
+&  7     8 )     &    1#      '* 
.  #$  2 &)&

369
 2012/             8   4 

  
Arabic References      -
+# "1 !  1         " ! !  S1
.2006  5   - 
3+#  +  "31 % -1 C 1! 516 3)  E  3  "    . 5 S2
.2005 & 
1986 & # =    "   ( :  #  /&! " & &  . .   S3
.2010 2&    ? (*  ")  9I 3 % -"  !. & S4

- English References

1-Andrew J. Mason "Solving linear programs using Microsoft Excel

solver" University of Auckland 2007
2-Bernard W. Taylor” Introduction to management science”, Virginia Polytechnic
Institute and State University.publisher:Prentice Hall. Ninth Edition 2006
3-Bronson, Richard "schaum's OutLine Series Theory and Applications of
Operations Research" McCraw-Hill Book Company 1982
4- John A. Lawrence & others “ Applied management science “ john wiley &
sons,Inc.1998
5-Meissner,Joern" An introduction to spreadsheet optimization using excel
solver"Lancaster University 2009.
6-Taha,Hamdy A . “Operations Research An Introduction” Prentice-Hall, Inc eighth
edition. 2007.

370