Pages that link to "Item:Q597210"
From MaRDI portal
The following pages link to Finding a minimal efficient solution of a convex multiobjective program (Q597210):
Displaying 7 items.
- Homotopy interior-point method for a general multiobjective programming problem (Q442940) (← links)
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767) (← links)
- A constraint shifting homotopy method for convex multi-objective programming (Q651890) (← links)
- Homotopy method for a general multiobjective programming problem (Q937132) (← links)
- Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition (Q1925395) (← links)
- A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming (Q2943839) (← links)
- A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming (Q4632694) (← links)
