We introduce a new method for solving systems of linear inequalities over the rationals—the conflict resolution method. The method successively refines an initial assignment with the help of newly derived constraints until either the assignment becomes a solution of the system or a trivially unsatisfiable constraint is derived. We show that this method is correct and terminating. Our experiment...

Through the establishment of general equilibrium models with different development stages modern agriculture, this paper examines impact subsidy on land rent in agriculture wage inequality between skilled labor and unskilled a dual agricultural economy. Moreover, we also take financing constraint into consideration, source comes from taxes. The main conclusions are: at preliminary stage enforce...

This paper discusses the rigorous enclosure of an ellipsoid by a rectangular box, its interval hull, providing a convenient preprocessing step for constrained optimization problems. A quadratic inequality constraint with a positive definite Hessian defines an ellipsoid. The Cholesky factorization can be used to transform a strictly convex quadratic constraint into a norm inequality, for which t...

Abstract: Recently, nonlinear H∞ control theory has been paid attention for the powerful design method for a robust stabilization. The solvable condition of nonlinear H∞ control problem is given by the Hamilton Jacobi Inequality (HJI). The HJI is the partial differential inequality which is quite difficult to solve, so some numerical approaches have been researched. The approach to solve the HJ...

Extended clauses are the basic formulas of the 0-1 constraint solver for the constraint logic programming language CLP(PB). We present a method for transforming an arbitrary linear 0-1 inequality into a set of extended clauses, such that the solution space remains invariant. After applying well-known linearization techniques on non-linear 0-1 constraints followed by the presented transformation...

In recent years, interval constraint-based solvers have shown their ability to ef£ciently solve challenging non-linear real constraint problems. However, most of the working systems limit themselves to delivering point-wise solutions with an arbitrary accuracy. This works well for equalities, or for inequalities stated for specifying tolerances, but less well when the inequalities express a set...

Support vector ordinal regression (SVOR) is a popular method to tackle ordinal regression problems. However, until now there were no effective algorithms proposed to address incremental SVOR learning due to the complicated formulations of SVOR. Recently, an interesting accurate on-line algorithm was proposed for training ν-support vector classification (ν-SVC), which can handle a quadratic form...

In this paper, we present a new method to handle inequality constraints and apply it in NOVEL (Nonlinear Optimization via External Lead), a system we have developed for solving constrained continuous nonlinear optimization problems. In general, in applying Lagrange-multiplier methods to solve these problems, inequality constraints are rst converted into equivalent equality constraints. One such...

Based on the rst part of this paper 17 , a numerical method is developed for the real-time computation of neighboring optimal feedback controls for constrained optimal control problems. Using the idea of multiple shooting, a numerical method is developed which has the following properties: 1. The method is applicable to optimal control problems with constraints (diierential equations, boundary ...

Lifted inference rules exploit symmetries for fast reasoning in statistical relational models. Computational complexity of these rules is highly dependent on the choice of the constraint language they operate on and therefore coming up with the right kind of representation is critical to the success of lifted inference. In this paper, we propose a new constraint language, called setineq, which ...