Pages that link to "Item:Q1584795"

The following pages link to A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems (Q1584795):

Displaying 19 items.

• A linear programming approach to test efficiency in multi-objective linear fractional programming problems (Q611706) (← links)
• Optimization of functions with rank-two variation over a box (Q706945) (← links)
• A reference point technique to compute nondominated solutions in MOLFP (Q844509) (← links)
• Acceptable optimality in linear fractional programming with fuzzy coefficients (Q868523) (← links)
• An exact method for a discrete multiobjective linear fractional optimization (Q952706) (← links)
• Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique (Q1659228) (← links)
• A taxonomy and review of the multi-objective fractional programming (MOFP) problems (Q1791870) (← links)
• Multiobjective integer nonlinear fractional programming problem: a cutting plane approach (Q1937858) (← links)
• An iterative approach to solve multiobjective linear fractional programming problems (Q1991300) (← links)
• A new methodology for solving bi-criterion fractional stochastic programming (Q2062430) (← links)
• A novel methodology for portfolio selection in fuzzy multi criteria environment using risk-benefit analysis and fractional stochastic (Q2167950) (← links)
• An improved method for solving multiobjective integer linear fractional programming problem (Q2260524) (← links)
• Enhancing computations of nondominated solutions in MOLFP via reference points (Q2434626) (← links)
• An approximation to the nondominated set of a multiobjective linear fractional programming problem (Q2817230) (← links)
• Finding a solution for Multi-Objective Linear Fractional Programming problem based on goal programming and Data Envelopment Analysis (Q2969968) (← links)
• A sixth bibliography of fractional programming (Q3426331) (← links)
• (Q4577939) (← links)
• A Branch & Cut Algorithm to Compute Nondominated Solutions in MOLFP via Reference Points (Q5232839) (← links)
• A new scheme for approximating the weakly efficient solution set of vector rational optimization problems (Q6109053) (← links)