Solving linear optimization over arithmetic constraint formula
type: Item
instance of: scholarly article
title: Solving linear optimization over arithmetic constraint formula
zbMATH Open document ID: 1408.90171
author: Li Chen
author: Yinrun Lyu
author: Chong Wang
author: Jingzheng Wu
author: Changyou Zhang
author: Nasro Min-Allah
author: Jamal Alhiyafi
author: Yongji Wang
published in: Journal of Global Optimization
publication date: 2017-11-02T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6802550
zbMATH Keywords: linear programming
zbMATH Keywords: disjunctive programming
zbMATH Keywords: optimization modulo theories
zbMATH Keywords: search algorithm
describes a project that uses: SYMBA
describes a project that uses: LogMIP
describes a project that uses: vZ
describes a project that uses: Yices
describes a project that uses: z3
describes a project that uses: CVC4
describes a project that uses: MathSAT5
MaRDI profile type: Publication
full work available at URL: s10898-017-0499-8
OpenAlex ID: W2586228778
cites work: A rewriting approach to satisfiability procedures.
cites work: Classification through incremental max-min separability
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
cites work: Sequential convexification in reverse convex and disjunctive programming
cites work: Integer Programming: Methods, Uses, Computations
cites work: An algorithm for solving optimization problems with fuzzy relational inequality constraints
cites work: Optimization Modulo Theories with Linear Rational Costs
cites work: A hierarchy of relaxations for linear generalized disjunctive programming
cites work: Facial disjunctive programs and sequences of cutting-planes
cites work: Q4840764
cites work: Q4821526
cites work: A trust region method based on interior point techniques for nonlinear programming.
cites work: Convex programming for disjunctive convex optimization
cites work: The MathSAT5 SMT Solver
cites work: Q3844775
cites work: On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems
cites work: Solving fuzzy relation equations with a linear objective function
cites work: Interior Methods for Nonlinear Optimization
cites work: Fuzzy linear optimization in the presence of the fuzzy relation inequality constraints with max-min composition
cites work: Sequential Quadratic Programming Methods
cites work: Fundamentals of discrete math for computer science. A problem-solving primer
cites work: Logic-based decision support. Mixed integer model formulation
cites work: Modelling with integer variables
cites work: Symbolic optimization with SMT solvers
cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
cites work: Q5490414
cites work: Introduction to Interval Analysis
cites work: Simplification by Cooperating Decision Procedures
cites work: Solving SAT and SAT Modulo Theories
cites work: Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
cites work: Q4272483
cites work: Optimization with disjunctive constraints
cites work: A branch-and-cut method for 0-1 mixed convex programming
cites work: A fixed-charge model with fuzzy inequality constraints composed by max-product operator
cites work: All of Nonparametric Statistics
DOI: 10.1007/S10898-017-0499-8
Recommended article: Solving linear systems involved in constrained optimization
Recommended article: Solving linear programming problems exactly
Recommended article: Solving linear programming problems via linear minimax problems
Recommended article: Q5580046
Recommended article: Linearly constrained optimization
Recommended article: Q3688112
Recommended article: Q3577643
Recommended article: Solving Linear Programming with Constraints Unknown
Recommended article: Optimization problems under (max, min)-linear equations and/or inequality constraints
Recommended article: Q4285400
description: scientific article; zbMATH DE number 6802550