Access the full text.
Sign up today, get DeepDyve free for 14 days.
Silvia Tomasi (2014)
Optimization Modulo Theories with Linear Rational CostsACM Transactions on Computational Logic (TOCL), 16
Yongji Wang, David Lane (2000)
Solving a generalized constrained optimization problem with both logic AND and OR relationships by a mathematical transformation and its application to robot motion planningIEEE Trans. Syst. Man Cybern. Part C, 30
S. Fotopoulos (2007)
All of Nonparametric StatisticsTechnometrics, 49
L Moura, N Bjrner (2011)
Satisfiability modulo theories: introduction and applicationsCommun. ACM, 54
M. Turkay, I. Grossmann (1996)
Logic-based MINLP algorithms for the optimal synthesis of process networksComputers & Chemical Engineering, 20
Yongji Wang, Liu Han, Mingshu Li, Qing Wang, Jinhui Zhou, M. Cartmell (2004)
A real-time path planning approach without the computation of Cspace obstaclesRobotica, 22
N. Bjørner, Anh-Dung Phan (2014)
νZ - Maximal Satisfaction with Z3
E. Balas (1985)
Disjunctive programming and a hierarchy of relaxations for discrete optimization problemsSiam Journal on Algebraic and Discrete Methods, 6
Enrico Bini, G. Buttazzo (2002)
The space of rate monotonic schedulability23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002.
T. Jenkyns, Ben Stephenson (2018)
Fundamentals of Discrete Math for Computer Science
M. Balinski (1965)
Integer Programming: Methods, Uses, ComputationsManagement Science, 12
P. Boggs, J. Tolle (1995)
Sequential Quadratic ProgrammingActa Numerica, 4
(1984)
Modeling with integer variables
Ramon Moore, R. Kearfott, M. Cloud (2009)
Introduction to Interval Analysis
Greg Nelson, D. Oppen (1979)
Simplification by Cooperating Decision ProceduresACM Trans. Program. Lang. Syst., 1
(2006)
Study of optimization problems with logic or relationships and its application to real-time system design
R. Nieuwenhuis, Albert Oliveras, C. Tinelli (2006)
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)J. ACM, 53
C. Kirjner-Neto, E. Polak (1998)
On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization ProblemsSIAM J. Optim., 8
A. Ghodousian, E. Khorram (2008)
Fuzzy linear optimization in the presence of the fuzzy relation inequality constraints with max-min compositionInf. Sci., 178
N. Bjørner, Anh-Dung Phan, Lars Fleckenstein (2015)
νZ - An Optimizing SMT Solver
Nicolas Sawaya, I. Grossmann (2012)
A hierarchy of relaxations for linear generalized disjunctive programmingEur. J. Oper. Res., 216
R. Sebastiani, Silvia Tomasi (2012)
Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost FunctionsArXiv, abs/1202.1409
G Nelson, DC Oppen (1979)
Simplification by cooperating decision proceduresACM TOPLAS, 1
L. Moura, N. Bjørner (2008)
Z3: An Efficient SMT Solver
(2015)
Rate-monotonic optimal design based on tree-like linear prgoramming search
Hsiao-Fan Wang, C. Wang (1998)
A fixed-charge model with fuzzy inequality constraints composed by max-product operatorComputers & Mathematics With Applications, 36
L. Moura, N. Bjørner (2011)
Satisfiability modulo theoriesCommunications of the ACM, 54
Nicolas Sawaya, I. Grossmann (2005)
A cutting plane method for solving linear generalized disjunctive programming problemsComput. Chem. Eng., 29
Sebastián Ceria, J. Soares (1999)
Convex programming for disjunctive convex optimizationMathematical Programming, 86
A. Vecchietti, I. Grossmann (2004)
COMPUTATIONAL EXPERIENCE WITH LOGMIP SOLVING LINEAR AND NONLINEAR DISJUNCTIVE PROGRAMMING PROBLEMS
P. Gill, Elizabeth Wong (2012)
Sequential Quadratic Programming Methods
B. Dutertre, L. Moura (2006)
A Fast Linear-Arithmetic Solver for DPLL(T)
A. Forsgren, P. Gill, M. Wright (2002)
Interior Methods for Nonlinear OptimizationSIAM Rev., 44
H. Sherali, C. Shetty (1980)
Optimization with disjunctive constraints
IU C.L.L, J. Layland (1989)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJ. ACM, 20
C. Blair (1980)
Facial disjunctive programs and sequence of cutting-planesDiscret. Appl. Math., 2
H. Williams (1989)
Logic-Based Decision Support: Mixed Integer Model FormulationJournal of the Operational Research Society, 41
(1999)
Abranch - and - cutmethod for 0 – 1 mixed convexprogramming
A. Bagirov, J. Ugon, Dean Webb, B. Karasözen (2011)
Classification through incremental max–min separabilityPattern Analysis and Applications, 14
P. Nicola (2000)
Linear Programming and Extensions
Sangbum Lee, I. Grossmann (2000)
New algorithms for nonlinear generalized disjunctive programmingComputers & Chemical Engineering, 24
Niklas Sörensson, N. Eén (2005)
MiniSat v1.13 - A SAT Solver with Conflict-Clause Minimization
C. Su, Fangfang Guo (2009)
Solving Interval-Valued Fuzzy Relation Equations with a Linear Objective Function2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, 4
R. Byrd, Jean Gilbert, J. Nocedal (2000)
A trust region method based on interior point techniques for nonlinear programmingMathematical Programming, 89
R. Raman, I. Grossmann (1994)
Modelling and computational techniques for logic based integer programmingComputers & Chemical Engineering, 18
S. Fang, Guangzhi Li (1999)
Solving fuzzy relation equations with a linear objective functionFuzzy Sets Syst., 103
A. Cimatti, A. Griggio, B. Schaafsma, R. Sebastiani (2013)
The MathSAT5 SMT Solver
N. Min-Allah, S. Khan, Yongji Wang (2012)
Optimal task execution times for periodic tasks using nonlinear constrained optimizationThe Journal of Supercomputing, 59
Yi Li, Aws Albarghouthi, Zachary Kincaid, A. Gurfinkel, M. Chechik (2014)
Symbolic optimization with SMT solversProceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Fangfang Guo, Liping Pang, D. Meng, Z. Xia (2013)
An algorithm for solving optimization problems with fuzzy relational inequality constraintsInf. Sci., 252
S. Sheather, M. Jones (1991)
A reliable data-based bandwidth selection method for kernel density estimationJournal of the royal statistical society series b-methodological, 53
H. Miyagi, Ichiko Kinjo, Yiping Fan (1998)
Qualified decision-making using the fuzzy relation inequalitiesSMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), 2
E. Balas, Joseph Tama, J. Tind (1989)
Sequential convexification in reverse convex and disjunctive programmingMathematical Programming, 44
B. Dutertre (2014)
Yices 2.2
Stephen Boyd, L. Vandenberghe (2005)
Convex OptimizationJournal of the American Statistical Association, 100
A. Armando, Silvio Ranise, M. Rusinowitch (2003)
A rewriting approach to satisfiability proceduresInf. Comput., 183
E. Balas (1998)
Disjunctive Programming: Properties of the Convex Hull of Feasible PointsDiscret. Appl. Math., 89
Since Balas extended the classical linear programming problem to the disjunctive programming (DP) problem where the constraints are combinations of both logic AND and OR, many researchers explored this optimization problem under various theoretical or application scenarios such as generalized disjunctive programming (GDP), optimization modulo theories (OMT), robot path planning, real-time systems, etc. However, the possibility of combining these differently-described but form-equivalent problems into a single expression remains overlooked. The contribution of this paper is two folded. First, we convert the linear DP/GDP model, linear-arithmetic OMT problem and related application problems into an equivalent form, referred to as the linear optimization over arithmetic constraint formula (LOACF). Second, a tree-search-based algorithm named RS-LPT is proposed to solve LOACF. RS-LPT exploits the techniques of interval analysis and nonparametric estimation for reducing the search tree and lowering the number of visited nodes. Also, RS-LPT alleviates bad construction of search tree by backtracking and pruning dynamically. We evaluate RS-LPT against two most common DP/GDP methods, three state-of-the-art OMT solvers and the disjunctive transformation based method on optimization benchmarks with different types and scales. Our results favor RS-LPT as compared to existing competing methods, especially for large scale cases.
Journal of Global Optimization – Springer Journals
Published: Feb 8, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.