Pages that link to "Item:Q1197675"
From MaRDI portal
The following pages link to Multiple-objective programming with polynomial objectives and constraints (Q1197675):
Displaying 10 items.
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems (Q380592) (← links)
- Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
- Linear complementarity problems and multiple objective programming (Q689137) (← links)
- Vector optimization and generalized Lagrangian duality (Q1339225) (← links)
- Multiple-objective approximation of feasible but unsolvable linear complementarity problems (Q1905039) (← links)
- Retrieval and use of the balance set in multiobjective global optimization (Q1962989) (← links)
- On the use of polynomial models in multiobjective directional direct search (Q2023694) (← links)
- Two methods for the maximization of homogeneous polynomials over the simplex (Q2231046) (← links)
- (Q3059324) (← links)
- Generalized polarity and weakest constraint qualifications in multiobjective optimization (Q6050156) (← links)