A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX...
-
Upload
santino-staggers -
Category
Documents
-
view
220 -
download
2
Transcript of A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX...
![Page 1: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/1.jpg)
A HYBRID CONSTRAINT PROGRAMMING-OPTIMIZATION BASED INFEASIBILITY
DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS
Yash Puranik
Advisor: Nick Sahinidis
The authors would like to thank Air Liquide for providing partial financial support and motivation for this work
![Page 2: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/2.jpg)
2
MODEL SUBMISSION STATISTICS VIA NEOS SERVER FOR BARON
7% of 18095 problems submitted were infeasible
0
200
400
600
800
1000
1200
1400
1600
1800
2000
FeasibleInfeasible
Month
Nu
mb
er
of
mo
de
ls s
ub
mit
ted
![Page 3: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/3.jpg)
IIS ISOLATION
3
• Identification of Irreducible Inconsistent Sets (IIS) (van Loon, 1980) can help speed up the diagnosis process
• IIS is an infeasible set with any proper subset feasible
• IIS provides a set of inconsistencies that must be eliminated from the model
Infeasiblea
b
c
![Page 4: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/4.jpg)
IIS ISOLATION
4
• Identification of Irreducible Inconsistent Sets (IIS) (van Loon, 1980) can help speed up the diagnosis process
• IIS is an infeasible set with any proper subset feasible
• IIS provides a set of inconsistencies that must be eliminated from the model
Infeasiblea
✓
a
b
✓
b
✓
cc
![Page 5: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/5.jpg)
ISOLATING INFEASIBILITY
5
IIS
![Page 6: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/6.jpg)
6
EXAMPLE(Himmelblau, 1972; Chinneck, 1995)
![Page 7: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/7.jpg)
INFEASIBILITY DIAGNOSIS FOR LPs
7
• Irreducible Infeasible Sets (IIS) for linear programs (Chinneck and Dravnieks 1991, Chinneck 1996)
• Deletion filter – Delete one constraint from candidate set and test for feasibility– If infeasible, eliminate constraint permanently– If feasible, retain the constraint – Loops through all the constraints exactly once– On completion, obtains exactly one IIS
![Page 8: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/8.jpg)
8
MODEL STATUS: INFEASIBLE
![Page 9: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/9.jpg)
9
![Page 10: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/10.jpg)
10
MODEL STATUS: FEASIBLE
![Page 11: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/11.jpg)
11
![Page 12: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/12.jpg)
12
MODEL STATUS: INFEASIBLE
![Page 13: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/13.jpg)
13
IIS OBTAINED
![Page 14: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/14.jpg)
RELATED WORK
14
• Multiple filtering algorithms proposed: algorithms rely on solving several feasibility problems
• The feasibility subproblems either eliminate constraints not part of an IIS or identify members of an IIS
• Some of the proposed algorithms include:– Elastic filter (Chinneck and Dravnieks, 1991)– Addition filter (Tamiz et al., 1994)– Adddition-deletion filter, dynamic reordering additive
method (Guieu and Chinneck, 1999)– Depth first binary search filter, generalized binary search
filter (Atlihan and Schrage, 2008)
![Page 15: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/15.jpg)
CHALLENGES FOR NLPs
15
• Methods established for linear programs are part of commercial codes CPLEX (1993), XPRESS (1997)
• Similar framework for nonlinear programs (Chinneck 1995). However, the following challenges exist:– choice of initial point– “hot start” for NLPs is more challenging
• Global search necessary for nonconvex NLPs to prove infeasibility by exhaustively searching the domain
![Page 16: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/16.jpg)
MOTIVATION FOR PROPOSED APPROACH FOR MINLPs
• Experience with industrial model suggested basic causes of infeasibilities– Transcription errors– Incorrect bounds– Inferred bounds from constraints in conflict with specified
bounds
• Presolve techniques can efficiently identify conflicting bounds
• Proposed methodology– Use presolve techniques to identify a candidate set of
constraints– Apply filtering algorithm on this test set to identify IIS
16
![Page 17: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/17.jpg)
• Brearley et al. (1975), Fourer and Gay (1994), Sahinidis (2003), …
• Crossing of bounds implies infeasible model
• A quick and computationally inexpensive test of infeasibility
PRESOLVE: FEASIBILITY-BASED DOMAIN REDUCTION
17
![Page 18: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/18.jpg)
PROPOSED INFEASIBILITY DIAGNOSIS FRAMEWORK
18
• Preprocessing: Identify a reduced test set of constraints– Drop one constraint and presolve the model– If model proved infeasible, drop the constraint permanently– Loop through all constraints to identify a candidate set of
constraints
• Filtering: Filter this reduced candidate set to obtain IIS
• BARON is ideal for filtering– Implements presolve techniques– Capability to terminate with first feasible solution– Exhaustive search of domain through branch and bound –
rigorous proof of infeasibility
![Page 19: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/19.jpg)
19
ILLUSTRATIVE EXAMPLE–Revisited
![Page 20: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/20.jpg)
20
PRESOLVE STATUS: INFEASIBLE
![Page 21: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/21.jpg)
21
REDUCED SET
![Page 22: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/22.jpg)
BENEFITS OF THE FRAMEWORK
22
• Leverage presolve to potentially eliminate large number of problem constraints
• Presolve is computationally inexpensive. This elimination can be achieved rapidly
• Filtering will have to solve fewer feasibility problems for IIS isolation
• Preprocessing stage may be sufficient to isolate the IIS for many problems
![Page 23: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/23.jpg)
COMPUTATIONAL EXPERIMENTS
23
• A test set of 983 infeasible problems submitted to BARON via NEOS server
• Implemented proposed framework with following algorithms:– Deletion filter – Addition filter – Addition-deletion filter – Depth first binary search filter
• Results presented here compare deletion filtering with preprocessing v/s pure deletion filtering
Model type Number of problems
LP 24
MIP 115
NLP 235
MINLP 609
![Page 24: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/24.jpg)
SELECTED COMPUTATIONAL TIMES
24
Model NameTime to return infeasibility [s]
Time to find an IIS with deletion filtering [s]
inf_mip_71 0.8 >500
Inf_mip_18 0.8 >500
Inf_nlp_29 0.65 >500
Inf_nlp_186 5.51 >500
inf_minlp_6 0.68 >500
Inf_minlp_220 0.1 >500
inf_rminlp_14 0.68 106
inf_mip_104 0.66 >500
inf_minlp_562 1.94 212
Deletion filter on an average takes 325 times more time
![Page 25: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/25.jpg)
AVERAGE COMPUTATIONAL TIMES
25
LP MIP NLP MINLP0
10
20
30
40
50
60
70
80
90
100
Time taken to prove infea-sibility
Time taken to find IIS by dele-tion filter with preprocessing
Problem type
%C
om
pu
tati
on
al t
ime
![Page 26: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/26.jpg)
SELECTED IIS CARDINALITIES
26
ModelOriginal model size (rows + columns)
IIS size (rows + columns)
inf_mip_71 13322 1*
Inf_mip_18 13322 1*
Inf_nlp_29 10174 28
Inf_nlp_186 30327 70
inf_minlp_6 10874 3
inf_minlp_220 2768 4
inf_rminlp_14 11750 4
inf_mip_104 13322 1*
inf_minlp_562 782 7
*Binaries were enforced for MIPs and MINLPs for IIS isolation
![Page 27: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/27.jpg)
27
IIS contains 10% of original rows and 20% of original columns on average.For over 272 models, less than 1% of model rows and columns in an IIS
IIS CARDINALITIES (%)
0 5000 10000 15000 20000 25000 30000 35000 400000
2
4
6
8
10
12
14
16
18
20
Problem Size
IIS %
![Page 28: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/28.jpg)
PREPROCESSING IMPACT ON SOME PROBLEMS
28
ModelOriginal model
size (rows + columns)
Reduced model after
preprocessing (rows + columns)
IIS size (rows + columns)
inf_mip_71 13322 2447 1*
Inf_mip_18 13322 378 1*
Inf_nlp_29 10174 28 28
Inf_nlp_186 30327 70 70
inf_minlp_6 10874 6 3
Inf_minlp_220 2768 14 4
inf_rminlp_14 11750 8 4
inf_mip_104 13322 378 1*
inf_minlp_562 782 7 7
*Binaries were enforced for MIPs and MINLPs for IIS isolation
![Page 29: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/29.jpg)
PREPROCESSING EFFICIENCY
29
Preprocessing eliminates 68% rows and 72% columns not in IIS on averageFor 284 problems, preprocessing reduces the model to an IIS
0 5000 10000 15000 20000 25000 30000 35000 400000
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Problem size
Pre
pro
ce
ss
ing
e
ffic
ien
cy
![Page 30: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/30.jpg)
SPEEDUPS DUE TO PREPROCESSING
30
Model Deletion filter [s]Deletion filter with preprocessing [s]
inf_mip_71 >500 24
Inf_mip_18 >500 27
Inf_nlp_29 >500 8
inf_nlp_186 >500 145
inf_minlp_6 >500 2
inf_minlp_220 >500 62
inf_rminlp_14 106 0.76
inf_mip_104 >500 26
Inf_minlp_562 212 0.27
Deletion filter is 13 times faster on average with preprocessing
![Page 31: A HYBRID CONSTRAINT PROGRAMMING- OPTIMIZATION BASED INFEASIBILITY DIAGNOSIS FRAMEWORK FOR NONCONVEX NLPS AND MINLPS Yash Puranik Advisor: Nick Sahinidis.](https://reader036.fdocuments.in/reader036/viewer/2022062620/551a8033550346e0158b496e/html5/thumbnails/31.jpg)
CONCLUSIONS
31
• Proposed an IIS identification approach for nonconvex NLPs and MINLPs
• On our test set, finding an IIS takes about 25 times the CPU time to prove infeasibility
• Preprocessing speeds up deletion filtering by 13 times on average
• Preprocessing reduces the problem to an IIS for most problems in our test set
• Infeasibility library will be made available at http://archimedes.cheme.cmu.edu