Pages that link to "Item:Q1785297"
From MaRDI portal
The following pages link to A new Pareto set generating method for multi-criteria optimization problems (Q1785297):
Displaying 16 items.
- A direction based classical method to obtain complete Pareto set of multi-criteria optimization problems (Q260683) (← links)
- Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions (Q513542) (← links)
- A Newton method for capturing efficient solutions of interval optimization problems (Q522414) (← links)
- Handling the multiplicity of solutions in a MOEA based PDA-THESEUS framework for multi-criteria sorting (Q1692067) (← links)
- A saddle point characterization of efficient solutions for interval optimization problems (Q1786949) (← links)
- A quasi-Newton method with rank-two update to solve interval optimization problems (Q1791787) (← links)
- Generalized-Hukuhara penalty method for optimization problem with interval-valued functions and its application in interval-valued portfolio optimization problems (Q2084044) (← links)
- On identifying fuzzy knees in fuzzy multi-criteria optimization problems (Q2321027) (← links)
- A method for generating a well-distributed Pareto set in multiple objective mixed integer linear programs based on the decision maker's initial aspiration level (Q2821098) (← links)
- A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING (Q3122035) (← links)
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems (Q4210323) (← links)
- A trust-region interior-point technique to solve multi-objective optimization problems and its application to a tuberculosis optimal control problem (Q5052583) (← links)
- Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem (Q6050365) (← links)
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems (Q6164611) (← links)
- A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems (Q6191876) (← links)
- A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem (Q6559157) (← links)