Pages that link to "Item:Q1743539"
From MaRDI portal
The following pages link to Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539):
Displaying 10 items.
- Optimality and duality in nonsmooth composite vector optimization and applications (Q828870) (← links)
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications (Q2025164) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- Existence of Pareto solutions for vector polynomial optimization problems with constraints (Q2082235) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems (Q6109053) (← links)
- A utopia point method-based robust vector polynomial optimization scheme (Q6154404) (← links)
