Uneingeschränkter Zugang

Using Linear Programming with Interval Coefficients in Optimization of a Military Action

  
24. Juni 2025

Zitieren
COVER HERUNTERLADEN

Figure no. 1:

LINDO best optimum(Source: Author's compilation)
LINDO best optimum(Source: Author's compilation)

Figure no. 2:

LINDO solution for best optimum(Source: Author's compilation)
LINDO solution for best optimum(Source: Author's compilation)

Figure no. 3:

LINDO worst optimum(Source: Author's compilation)
LINDO worst optimum(Source: Author's compilation)

Figure no. 4:

LINDO solution for worst optimum(Source: Author's compilation)
LINDO solution for worst optimum(Source: Author's compilation)

Problem data

O1 O2 O3 O4 O5 O6 O7
M1 [10,12] [8,10] [6,8] [7,9] [9,11] [7,9] [8,10] [690,720]
M1 [3,5] [2,4] [4,6] [3,5] [4,6] [5,7] [5,7] [360,380]
M3 [6,8] [3,6] [5,7] [8,10] [7,9] [4,6] [7,9] [520,540]
M4 [1,3] [1,2] [3,5] [2,4] [1,2] [2,4] [4,6] [200,220]
M5 [0,2] [0,1] [1,2] [1,3] [0,1] [1,2] [3,5] [80,100]
Loss [0.5%, 1%] [0.25%, 0.5%] [1.25%, 1.5%] [1.75%, 2.5%] [0.5%, 0.75%] [0.75%, 1.25%] [2.5%, 3%] -
No.objectives 12 15 8 7 13 6 7 -