Pages that link to "Item:Q2564162"

The following pages link to Use of \(P_ \tau\)-nets for the approximation of the Edgeworth-Pareto set in multicriteria optimization (Q2564162):

Displaying 10 items.

• Definition of the feasible solution set in multicriteria optimization problems with continuous, discrete, and mixed design variables (Q419719) (← links)
• Management of constraints in optimization problems (Q419858) (← links)
• Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization (Q557143) (← links)
• Multicriteria analysis of real-life engineering optimization problems: statement and solution (Q999581) (← links)
• Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems (Q1005689) (← links)
• Weighted optimization for multiobjective full-information control problems (Q1391041) (← links)
• Balance set and Pareto solutions in linear space with application to ongoing optimal resource allocation, investment planning, production, and control problems with multiple objectives (Q1764960) (← links)
• Multicriteria engineering optimization problems: statement, solution and applications (Q1935297) (← links)
• Multicriteria analysis tools in real-life problems (Q2426003) (← links)
• Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization (Q2475812) (← links)