Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique (Q1659228): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Existence of efficient solutions for vector maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with linear fractional functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite criss-cross method for hyperbolic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new procedure for solving linear fractional programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Objective Linear Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The controlled estimation method in the multiobjective linear fractional problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonlinear Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Fractional Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for generalized fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Image space analysis of generalized fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum spanning trees with sums of ratios. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing non-dominated solutions in MOLFP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for maximizing the sum of several linear ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified monotonic approach to generalized linear fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conical partition algorithm for maximizing the sum of dc ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reference point technique to compute nondominated solutions in MOLFP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new iterative method for solving multiobjective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative approach to solve multiobjective linear fractional programming problems / rank
 
Normal rank

Latest revision as of 08:11, 16 July 2024

scientific article
Language Label Description Also known as
English
Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
scientific article

    Statements

    Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique (English)
    0 references
    0 references
    0 references
    15 August 2018
    0 references
    Summary: Multiobjective linear fractional programming (MOLFP) problems are the important problems with special structures in multiobjective optimization. In the MOLFP problems, the objective functions are linear fractional functions and the constraints are linear; that is, the feasible set is a polyhedron. In this paper, we suggest a method to identify the efficiency status of the feasible solutions of an MOLFP problem. By the proposed method, an efficient projection on the efficient space for an inefficient solution is obtained. The proposed problems are constructed in linear programming structures.
    0 references
    polyhedron
    0 references
    efficient projection
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references