Tricks prof. . Meh ehdi i TOLOO, Ph.D .D. Department of Systems - - PowerPoint PPT Presentation

β–Ά
tricks
SMART_READER_LITE
LIVE PREVIEW

Tricks prof. . Meh ehdi i TOLOO, Ph.D .D. Department of Systems - - PowerPoint PPT Presentation

Integer Linear Programming Tricks prof. . Meh ehdi i TOLOO, Ph.D .D. Department of Systems Engineering, Faculty of Economics, VB - Technical University of Ostrava, Czech Republic Email: mehdi.toloo@vsb.cz URL:


slide-1
SLIDE 1

Integer Linear Programming Tricks

prof. . Meh ehdi i TOLOO, Ph.D .D.

Department of Systems Engineering, Faculty of Economics, VΕ B- Technical University of Ostrava, Czech Republic Email: mehdi.toloo@vsb.cz URL: http://homel.vsb.cz/~tol0013/

slide-2
SLIDE 2

Contents

2

  • 1. A variable taking discontinuous values
  • 2. Fixed costs
  • 3. Either-or constraints
  • 4. Conditional constraints
  • 5. Elimination of products of variables

5.1 Two binary variables 5.2 One binary and one continuous variable 5.3 Two continuous variables

  • 6. Applications
slide-3
SLIDE 3
  • 1. A variable taking

discontinuous values

3

Indicator variable method 𝑦 = 0 𝑝𝑠 π‘š ≀ 𝑦 ≀ 𝑣

slide-4
SLIDE 4

4

π‘§π‘š ≀ 𝑦 ≀ 𝑧𝑣; 𝑧 ∈ {0,1}

Validation?

  • 1. A variable taking

discontinuous values

slide-5
SLIDE 5

Validation

5

π’š constraints 𝒛 0 ≀ 𝑣𝑧 0 β‰₯ π‘šπ‘§ 𝑧 ∈ {0,1} l ≀ 𝑦 ≀ 𝑣 𝑦 ≀ 𝑣𝑧 𝑦 β‰₯ π‘šπ‘§ 𝑧 ∈ {0,1} 1

slide-6
SLIDE 6
  • 2. Fixed cost

6

slide-7
SLIDE 7
  • 2. Fixed cost

(illustration)

7

slide-8
SLIDE 8

Modelling Fixed cost

8

Let 𝑦 ≀ 𝑣. Consider the following indicator variable y: If 𝑦 > 0 and 𝑦 ≀ 𝑣𝑧, then 𝑧 = 1. If 𝑦 = 0, how we have 𝑧 = 0?

1. 𝐷(𝑦, 𝑧) = 𝑙𝑧 + 𝑑𝑦 2. 𝑦 ≀ 𝑣𝑧

slide-9
SLIDE 9

The equivalent MBLP model

9

slide-10
SLIDE 10
  • 3. Either-or constraints

10

slide-11
SLIDE 11

Modeling either-or constraints

slide-12
SLIDE 12

Equivalent MBLP model

slide-13
SLIDE 13

Other forms

13

  • π‘˜βˆˆπΎ 𝑏1π‘˜π‘¦π‘˜ ≀ 𝑐1
  • r

π‘˜βˆˆπΎ 𝑏2π‘˜π‘¦π‘˜ β‰₯ 𝑐2 then π‘˜βˆˆπΎ 𝑏1π‘˜π‘¦π‘˜ ≀ 𝑐1 + 𝑁𝑧 π‘˜βˆˆπΎ 𝑏2π‘˜π‘¦π‘˜ β‰₯ 𝑐2 βˆ’ 𝑁(1 βˆ’ 𝑧)

  • π‘˜βˆˆπΎ 𝑏1π‘˜π‘¦π‘˜ ≀ 𝑐1
  • r

π‘˜βˆˆπΎ 𝑏2π‘˜π‘¦π‘˜ = 𝑐2 then π‘˜βˆˆπΎ 𝑏1π‘˜π‘¦π‘˜ ≀ 𝑐1

  • r

π‘˜βˆˆπΎ 𝑏2π‘˜π‘¦π‘˜ ≀ 𝑐2 and π‘˜βˆˆπΎ 𝑏2π‘˜π‘¦π‘˜ β‰₯ 𝑐2 hence π‘˜βˆˆπΎ 𝑏1π‘˜π‘¦π‘˜ ≀ 𝑐1 + 𝑁𝑧 π‘˜βˆˆπΎ 𝑏2π‘˜π‘¦π‘˜ ≀ 𝑐2 + 𝑁(1 βˆ’ 𝑧) π‘˜βˆˆπΎ 𝑏2π‘˜π‘¦π‘˜ β‰₯ 𝑐2 βˆ’ 𝑁(1 βˆ’ 𝑧)

slide-14
SLIDE 14
  • 4. Conditional constraints

14

slide-15
SLIDE 15
  • 4. Conditional constraints

15

Indicator variable

slide-16
SLIDE 16
  • 5. Elimination of

products of variables

5.1 Two binary variables 5.2 One binary and one continuous variable 5.3 Two continuous variables

slide-17
SLIDE 17

5.1 Two binary variables

Let 𝑐1, 𝑐2 ∈ {0,1} and 𝑨 = 𝑐1. 𝑐2 𝑨 = 𝑐1. 𝑐2 ⟺ 𝑧 ≀ 𝑐1 𝑧 ≀ 𝑐2 𝑧 β‰₯ 𝑐1 + 𝑐2 βˆ’ 1 𝑧 ∈ {0,1} Validation?

slide-18
SLIDE 18

Two binary variables (Validation)

π’„πŸ π’„πŸ‘ π’œ = π’„πŸπ’„πŸ‘ constraints 𝒛 𝑧 ≀ 0 𝑧 ≀ 0 𝑧 β‰₯ βˆ’1 1 𝑧 ≀ 0 𝑧 ≀ 1 𝑧 β‰₯ 0 1 𝑧 ≀ 1 𝑧 ≀ 0 𝑧 β‰₯ 0 1 1 1 𝑧 ≀ 1 𝑧 ≀ 1 𝑧 β‰₯ 1 1

slide-19
SLIDE 19

5.2 One binary and one continuous variable

Let 𝑐 ∈ 0,1 , 0 ≀ 𝑦 ≀ 𝑉, and 𝑨 = 𝑐𝑦 𝑨 = 𝑐𝑦 ⟺ 𝑧 ≀ 𝑉𝑐 𝑧 ≀ 𝑦 𝑧 β‰₯ 𝑦 βˆ’ 𝑉(1 βˆ’ 𝑐) 𝑧 β‰₯ 0 Validation?

slide-20
SLIDE 20

Validation

𝒄 π’š π’œ = π’„π’š constraints 𝒛 0 ≀ 𝑦 ≀ 𝑉 𝑧 ≀ 0 𝑧 ≀ 𝑦 𝑧 β‰₯ 𝑦 βˆ’ 𝑉 𝑧 β‰₯ 0 1 0 ≀ 𝑦 ≀ 𝑉 0 ≀ 𝑨(= 𝑦) ≀ 𝑉 𝑧 ≀ 𝑉 𝑧 ≀ 𝑦 𝑧 β‰₯ 𝑦 𝑧 β‰₯ 0 0 ≀ 𝑧(= 𝑦) ≀ 𝑉

slide-21
SLIDE 21

5.3 Two continuous variables

Let 𝑦1, 𝑦2 ∈ ℝ and 𝑨 = 𝑦1𝑦2 Step 1. 𝑧1 =

1 2 𝑦1 + 𝑦2 , 𝑧1 ∈ ℝ

𝑧2 =

1 2 𝑦1 βˆ’ 𝑦2 , 𝑧2 ∈ ℝ

Step 2. 𝑨 = 𝑦1𝑦2 = 𝑧1

2 βˆ’ 𝑧2 2

Step 3. solve the non-linear problem via separable programming (see Taha 2005)

slide-22
SLIDE 22

Bounds on 𝑦1 and 𝑦2

If L1 ≀ 𝑦1 ≀ 𝑉1, 𝑀2 ≀ 𝑦2 ≀ 𝑉2 Then 1 2 𝑀1 + 𝑀2 ≀ 𝑧1 ≀ 1 2 𝑁1 + 𝑁2 1 2 𝑀1 βˆ’ 𝑁2 ≀ 𝑧2 ≀ 1 2 𝑁1 βˆ’ 𝑀2

slide-23
SLIDE 23

5.3 Two continuous variables (Special case)

The product 𝑦1𝑦2 can be replaced by a single variable y whenever:

  • 1. The lower bounds 𝑀1 and 𝑀2 are nonnegative
  • 2. One of the variables, say 𝑦1, is not referenced in

any other term except in products of the above form. Then substituting for 𝑧 and adding the following constraint 𝑀1𝑦2 ≀ 𝑧 ≀ 𝑉1𝑦2

slide-24
SLIDE 24

Applications in DEA

  • Flexible measures
  • Selective measures
  • Best efficient unit
slide-25
SLIDE 25

DMU1 x11 y11 xm1 ys1 DMUn x1n y1n xmn ysn

25

Multiplier form of the CCR model

slide-26
SLIDE 26

Inputs and Outputs in DEA

  • Smaller input amounts are preferable.
  • Larger output amounts are preferable.
  • I/O should reflect an analyst's or a manager's

interest in the components that will enter into the relative efficiency evaluations of the DMUs.

26

slide-27
SLIDE 27

Flexible & Selective measures

  • Data play an important and critical role in DEA

and selecting input and output measures is an essential issue in this method.

  • The input versus output status of the chosen

performance measures is known.

  • In some situations, certain performance

measures can play either input or output roles, which are called flexible measures.

  • selective measures deal with the rule of thumb.

27

slide-28
SLIDE 28

Mostafa (2009)

28

slide-29
SLIDE 29

Flexible Measures

  • Beasley (1990, 1995) firstly faced with a data

selection issue in DEA. He found that research income measure in the evaluation of research productivity by universities can be considered either as input or

  • utput.
  • Some other such measures are:
  • Uptime measure in evaluating robotics installations (Cook

et al., 1992)

  • Outages measure in the evaluation of power plants (Cook

et al., 1998)

  • Deposits measure in the evaluation of bank efficiency

(Cook and Zhu 2005)

  • medical interns have a similar interpretation in the

evaluation of hospital efficiency.

29

slide-30
SLIDE 30

Flexible measures

30

slide-31
SLIDE 31

31

π‘’π‘š

βˆ— = 0 presents an input status

π‘’π‘š

βˆ— = 1 presents an output status

There are 2𝑀various cases (combinations) for 𝑀 flexible measures.

Flexible Measure Cook & Zhu (2007)

slide-32
SLIDE 32

Charnes & Cooper (1962)’s transformation

slide-33
SLIDE 33

Linearization

π‘’π‘š

βˆ— = 0 β†’ πœ€π‘š βˆ— = 0 β†’ π‘¨π‘š presents an input status

π‘’π‘š

βˆ— = 1 β†’ π‘₯π‘š βˆ— = 0 β†’ π‘¨π‘š presents an output status

slide-34
SLIDE 34
  • verall input v.s. output

status

Let πΎπ‘—π‘œ π‘š = 𝑝: π‘’π‘š

βˆ— = 0 ; 𝐾𝑝𝑣𝑒 π‘š = 𝑝: π‘’π‘š βˆ— = 1

1. If πΎπ‘—π‘œ π‘š > |𝐾𝑝𝑣𝑒 π‘š |, then flexible measure π‘š must be selected as input. 2. If πΎπ‘—π‘œ π‘š < |𝐾𝑝𝑣𝑒 π‘š |, then flexible measure π‘š must be selected as output. 3. πΎπ‘—π‘œ π‘š = |𝐾𝑝𝑣𝑒 π‘š | ?

34

slide-35
SLIDE 35

Aggregated v.s. Individual

35

slide-36
SLIDE 36

36

Toloo (2009, 2014)

slide-37
SLIDE 37

Toloo (2009)

37

slide-38
SLIDE 38

Toloo (2014)

Theorem: 𝑓𝑝

βˆ— = max{𝑓𝑙 βˆ—: 𝑙 = 1, … , 2𝑀}

38

slide-39
SLIDE 39

University evaluation (Beasley1990)

  • 50 universities
  • 2 inputs: General Expenditure (GE) and

Equipment Expenditure (EE)

  • 3 outputs: Under Graduate Students (UGS), Post

Graduate Teaching (PGT), and PG Research (PGR)

  • 1 flexible measure: Research Income (RI)
slide-40
SLIDE 40

Cook and Zhu (2007): 20 out of the 50 universities treat the research income measure as an output, i.e., the majority of 30 treat it as an input.

slide-41
SLIDE 41

41

slide-42
SLIDE 42

Envelopment form of the CCR model

slide-43
SLIDE 43

Flexible measure in envelopment form

π‘˜=1

π‘œ

πœ‡π‘˜π‘¨π‘šπ‘˜ ≀ πœ„π‘¨π‘šπ‘ π‘¨π‘š as input π‘˜=1

π‘œ

πœ‡π‘˜π‘¨π‘šπ‘˜ β‰₯ π‘¨π‘šπ‘ π‘¨π‘š as output π‘˜=1

π‘œ

πœ‡π‘˜π‘¨π‘šπ‘˜ ≀ πœ„π‘¨π‘šπ‘ + 𝑁 π‘’π‘š π‘˜=1

π‘œ

πœ‡π‘˜π‘¨π‘šπ‘˜ β‰₯ π‘¨π‘šπ‘ βˆ’ 𝑁(1 βˆ’ π‘’π‘š)

slide-44
SLIDE 44

Toloo (2012)

44

slide-45
SLIDE 45

Toloo (2012)

slide-46
SLIDE 46

46

Cook & Zhu (2207) Toloo (2012)

slide-47
SLIDE 47

Selective measures

The rule of thumb in DEA: How to meet the rule?

slide-48
SLIDE 48

illustration

  • consider the problem of evaluating 50 branches of a bank

with 25 inputs and 30 outputs.

  • The total number of measures, i.e. 55, and DMUs do not

satisfy the rule of thumb and we subsequently encounter many efficient units.

  • To make the problem easier, suppose that the manager

pre-selected three inputs, e.g. employees, expenses and space, and three outputs, e.g. loans, profits and deposits.

  • With this assumptions, if the manager wants to select 2
  • ut of 22 remaining inputs and 1 out of 27 remaining
  • utputs and also consider all possible combinations of

performance measures, then an optimization problem must be solved at most 196350(= 50 Γ— 22 2 Γ— 27 1 ) times, which is illogical.

slide-49
SLIDE 49

Toloo et al. (2015)

49

slide-50
SLIDE 50

Assumptions

  • Let 𝑑1 and 𝑑2 denote subsets of outputs

corresponding to fixed-output and selective-

  • utput measures, respectively. Similarly, assume

that 𝑛1 and 𝑛2 are the parallel subsets of inputs.

slide-51
SLIDE 51

Toloo et al. (2015)

slide-52
SLIDE 52

Linearization

Theorem: The selecting model meets the rule of thumb

slide-53
SLIDE 53

Special case: (𝑑1 = 𝑛1 = 𝜚)

slide-54
SLIDE 54

Toloo & Tichy(2015)

54

slide-55
SLIDE 55

Envelopment form of selecting model Toloo & Tichy (2015)

slide-56
SLIDE 56

Linearization

  • Let 𝑒𝑗

𝑦 = 𝑒𝑗 𝑦𝑑𝑗 𝑦 for ∈ 𝑛2 .

  • Impose the following restrictions on the model:

0 ≀ 𝑒𝑗

𝑦 ≀ 𝑁𝑒𝑗 𝑦

𝑑𝑗

𝑦 βˆ’ 𝑁 1 βˆ’ 𝑒𝑗 𝑦 ≀ 𝑒𝑗 𝑦 ≀ 𝑑𝑗 𝑦

slide-57
SLIDE 57

Equivalent MBLP model

slide-58
SLIDE 58

Aggregate model

58

slide-59
SLIDE 59
slide-60
SLIDE 60
slide-61
SLIDE 61
  • The DD models obtain the maximum possible movement from

DMU𝑝 = (π’šπ‘, 𝒛𝑝, 𝒄𝑝) for 𝑝 ∈ 𝐾 in the direction (𝒛𝑝, βˆ’π’„π‘)

61

directional distance models

slide-62
SLIDE 62

Multi-valued measures

62

slide-63
SLIDE 63

63

slide-64
SLIDE 64

Envelopment form of selecting model

64

slide-65
SLIDE 65

Multiplier form of selecting model

65

slide-66
SLIDE 66

Application Toloo & Hanclova (2019)

66

slide-67
SLIDE 67

Amin (2009)

67

slide-68
SLIDE 68

Best efficient unit (Amin 2009)

slide-69
SLIDE 69

69

slide-70
SLIDE 70

Linearization: Toloo (2012)

slide-71
SLIDE 71

Dual-role factors Cook & Zhu (2006)

71

slide-72
SLIDE 72

72

slide-73
SLIDE 73

Imprecise Dual-role factors Toloo et al. (2018)

73

slide-74
SLIDE 74

MBNLP model

74

slide-75
SLIDE 75

Linearization

75

slide-76
SLIDE 76

76

slide-77
SLIDE 77

Selected References

  • 1. Amin, G. R. (2009). Comments on finding the most efficient DMUs in DEA:

An improved integrated model. Computers & Industrial Engineering, 56(4), 1701–1702.

  • 2. Cook, W. D., Zhu, J. (2007). Classifying inputs and outputs in data

envelopment analysis. European Journal of Operational Research, 180(2), 692–699.

  • 3. Cook, W. D., Green, R. H., Zhu, J. (2006). Dual-role factors in data

envelopment analysis. IIE Transactions, 38(2), 105–115.

  • 4. Toloo, M. (2009). On classifying inputs and outputs in DEA: A revised model.

European Journal of Operational Research, 198(1), 358–360.

  • 5. Toloo, M. (2014). Notes on classifying inputs and outputs in data

envelopment analysis: a comment. European Journal of Operational Research, 235, 810–812.

  • 6. Toloo, M., Keshavarz, E., Hatami-Marbini, A. (2018). Dual-role factors for

imprecise data envelopment analysis. Omega, 77, 15–31.

  • 7. Toloo, M., HančlovΓ‘, J. (2019). Multi-valued measures in DEA in the presence
  • f undesirable outputs. Omega, (in press).
  • 8. Williams, H. P. (2013). Model building in mathematical programming. Wiley.

77

slide-78
SLIDE 78

Thank you for attention