Efficient solutions of interval programming problems with inexact parameters and second order cone constraints
From MaRDI portal
Publication:1634750
DOI10.3390/math6110270zbMath1404.90137OpenAlexW2901763330MaRDI QIDQ1634750
Mansour Saraj, Nezam Mahdavi-Amiri, Ali Sadeghi
Publication date: 18 December 2018
Published in: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/math6110270
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new procedure for solving linear fractional programming problems
- Applications of second-order cone programming
- Second-order cone programming
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Efficient solution of interval optimization problem
- On interval-valued nonlinear programming problems
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Programming with linear fractional functionals
- On Nonlinear Fractional Programming
This page was built for publication: Efficient solutions of interval programming problems with inexact parameters and second order cone constraints