Solving interval quadratic programming problems by using the numerical method and swarm algorithms
Summary: In this paper, we present a new approach which is based on using numerical solutions and swarm algorithms (SAs) to solve the interval quadratic programming problem (IQPP). We use numerical solutions for SA to improve its performance. Our approach replaced all intervals in IQPP by additional variables. This new form is called the modified quadratic programming problem (MQPP). The Karush-Kuhn-Tucker (KKT) conditions for MQPP are obtained and solved by the numerical method to get solutions. These solutions are functions in the additional variables. Also, they provide the boundaries of the basic variables which are used as a start point for SAs. Chaotic particle swarm optimization (CPSO) and chaotic firefly algorithm (CFA) are presented. In addition, we use the solution of dual MQPP to improve the behavior and as a stopping criterion for SAs. Finally, the comparison and relations between numerical solutions and SAs are shown in some well-known examples.
- A numerical solution method to interval quadratic programming
- Numerical solution method for general interval quadratic programming
- Application of stochastic programming technique to solve interval quadratic programming problem
- Solution of quadratic programming with interval variables using a two-level programming approach
- An algorithm for solving fuzzy quadratic programming problem
- A chaos-based evolutionary algorithm for general nonlinear programming problems
- A new equivalent transformation for interval inequality constraints of interval linear programming
- A new nonlinear interval programming method for uncertain problems with dependent interval variables
- A nonlinear interval number programming method for uncertain optimization problems
- A numerical solution method to interval quadratic programming
- A saddle point characterization of efficient solutions for interval optimization problems
- An interval nonlinear program for the planning of waste management systems with economies-of-scale effects -- a case study for the region of Hamilton, Ontario, Canada
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Efficient solution of interval optimization problem
- Generalized Hukuhara differentiability of interval-valued functions and interval differential equations
- How to determine basis stability in interval linear programming
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- Linear programming with interval coefficients
- Multiobjective programming in optimization of the interval objective function
- Numerical solution method for general interval quadratic programming
- On interval-valued nonlinear programming problems
- On the optimal solution set in interval linear programming
- Optimal value bounds in nonlinear programming with interval data
- Optimal value range in interval linear programming
- Robust optimal solutions in interval linear programming with forall-exists quantifiers
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function
- The optimal solution set of the interval linear programming problems
- Using chaotic artificial neural networks to model memory in the brain
- Weak and strong solvability of interval linear systems of equations and inequalities
This page was built for publication: Solving interval quadratic programming problems by using the numerical method and swarm algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210245)
