Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
From MaRDI portal
Publication:5940038
DOI10.1016/S0167-6377(01)00052-9zbMath0977.90048MaRDI QIDQ5940038
Le Dung Muu, Hoang Quang Tuyen
Publication date: 23 October 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items
Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Conjugate duality and optimization over weakly efficient set ⋮ An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem ⋮ Iterative identification of block-oriented nonlinear systems based on biconvex optimization ⋮ Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program ⋮ Biconvex sets and optimization with biconvex functions: a survey and extensions ⋮ Solving Optimization Problems over the Weakly Efficient Set ⋮ A sixth bibliography of fractional programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for optimizing over the weakly-efficient set
- Bicriteria linear fractional programming
- Fractional programming: Applications and algorithms
- Primal-relaxed dual global optimization approach
- Lagrange duality and partitioning techniques in nonconvex global optimization
- An inner approximation method for optimization over the weakly efficient set
- Optimality conditions for minimization over the (weakly or properly) efficient set
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Connectedness in Multiple Linear Fractional Programming
- Jointly Constrained Biconvex Programming
- An algorithm for nonconvex programming problems
- Pénalisation dans l'optimisation sur l'ensemble faiblement efficient
