Multiobjective integer nonlinear fractional programming problem: A cutting plane approach

OPSEARCH ◽  
2012 ◽  
Vol 49 (2) ◽  
pp. 133-153 ◽  
Author(s):  
Vikas Sharma
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Cutting Plane ◽  
Fractional Programming Problem ◽  
Nonlinear Fractional Programming

scholarly journals Duality for multiobjective fractional programming problems involving d -type-I n-set functions

2009 ◽  
Vol 19 (1) ◽  
pp. 63-73
Author(s):  
I.M. Stancu-Minasian ◽  
Gheorghe Dogaru ◽  
Mădălina Stancu
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Generalized Convexity ◽  
Type I ◽  
Multiobjective Fractional Programming ◽  
Fractional Programming Problem ◽  
Duality Results ◽  
Set Functions ◽  
Convexity Assumptions ◽  
Nonlinear Fractional Programming

We establish duality results under generalized convexity assumptions for a multiobjective nonlinear fractional programming problem involving d -type-I n -set functions. Our results generalize the results obtained by Preda and Stancu-Minasian [24], [25].

scholarly journals A Proposal to the Solution of Multiobjective Linear Fractional Programming Problem

2013 ◽  
Vol 2013 ◽  
pp. 1-4 ◽  
Author(s):  
Nuran Güzel
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Software Package ◽  
Efficient Solution ◽  
Optimal Solution ◽  
Linear Fractional Programming ◽  
Fractional Programming Problem ◽  
Nonlinear Fractional Programming ◽  
Single Objective ◽  
Linear Fractional Programming Problem

We have proposed a new solution to the Multiobjective Linear Fractional Programming Problem (MOLFPP). The proposed solution is based on a theorem that deals with nonlinear fractional programming with single objective function and studied in the work by Dinkelbach, 1967. As a new contribution, we have proposed that is an efficient solution of MOLFPP if is an optimal solution of problem , where is for all . Hence, MOLFPP is simply reduced to linear programming problem (LPP). Some numerical examples are provided in order to illustrate the applications of the proposed method. The optimization software package, namely, WinQSB (Chang, 2001), has been employed in the computations.

scholarly journals Optimality and duality in continuous-time nonlinear fractional programming

1992 ◽  
Vol 34 (2) ◽  
pp. 229-244 ◽  
Author(s):  
S. Suneja ◽  
C. Singh ◽  
R. N. Kaul
Keyword(s):  
Optimality Conditions ◽  
Programming Problem ◽  
Continuous Time ◽  
Fractional Programming ◽  
Dual Problem ◽  
Fractional Programming Problem ◽  
Duality Results ◽  
Perturbation Functions ◽  
Optimality And Duality ◽  
Nonlinear Fractional Programming

AbstractOptimality conditions via subdifferentiability and generalised Charnes-Cooper transformation are obtained for a continuous-time nonlinear fractional programming problem. Perturbation functions play a key role in the development. A dual problem is presented and certain duality results are obtained.

scholarly journals Nonlinear fractional programming

1975 ◽  
Vol 12 (3) ◽  
pp. 391-397 ◽  
Author(s):  
B. Mond ◽  
B.D. Craven
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Optimal Solution ◽  
Objective Functions ◽  
Fractional Programming Problem ◽  
Special Cases ◽  
Nonlinear Fractional Programming ◽  
Constraint Sets

If an optimal solution exists for a nonlinear fractional programming problem, then this solution is shown to be obtainable by solving two associated programming problems whose objective functions are no longer fractional. A certain restriction is assumed on the constraint sets of the latter problems. This result includes various known theorems as special cases.

Sign in / Sign up

Export Citation Format

Share Document