scholarly journals Generalized fractional programming duablity: a ratio game approach

1986 ◽  
Vol 28 (2) ◽  
pp. 170-180 ◽  
Author(s):  
S. Chandra ◽  
B. D. Craven ◽  
B. Mond
Keyword(s):  
Objective Function ◽  
Programming Problem ◽  
Fractional Programming ◽  
Generalized Fractional Programming ◽  
Fractional Programming Problem ◽  
Fractional Programs ◽  
Duality Relations

AbstractA ratio game approach to the generalized fractional programming problem is presented and duality relations established. This approach suggests certain solution procedures for solving fractional programs involving several ratios in the objective function.

scholarly journals Higher-order symmetric duality in nondifferentiable multiobjective fractional programming problem over cone contraints

2020 ◽  
Vol 8 (1) ◽  
pp. 187-205 ◽  
Author(s):  
Ramu Dubey ◽  
Deepmala ◽  
Vishnu Narayan Mishra
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Higher Order ◽  
Multiobjective Fractional Programming ◽  
Symmetric Duality ◽  
Numerical Examples ◽  
Fractional Programming Problem ◽  
Multiobjective Fractional Programming Problem ◽  
Duality Relations ◽  
Definition Of

In this paper, we introduce the definition of higher-order K-(C, α, ρ, d)-convexity/pseudoconvexity over cone and discuss a nontrivial numerical examples for existing such type of functions. The purpose of the paper is to study higher order fractional symmetric duality over arbitrary cones for nondifferentiable Mond-Weir type programs under higher- order K-(C, α, ρ, d)-convexity/pseudoconvexity assumptions. Next, we prove appropriate duality relations under aforesaid assumptions.

scholarly journals Additive Algorithm for Solving 0-1 Integer Linear Fractional Programming Problem

2013 ◽  
Vol 61 (2) ◽  
pp. 173-178
Author(s):  
Md Rajib Arefin ◽  
Touhid Hossain ◽  
Md Ainul Islam
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Programming Problem ◽  
Integer Linear Programming ◽  
Fractional Programming ◽  
Feasible Solution ◽  
Linear Fractional Programming ◽  
Fractional Programming Problem ◽  
Linear Fractional Programming Problem

In this paper, we present additive algorithm for solving a class of 0-1 integer linear fractional programming problems (0-1 ILFP) where all the coefficients at the numerator of the objective function are of same sign. The process is analogous to the process of solving 0-1 integer linear programming (0-1 ILP) problem but the condition of fathoming the partial feasible solution is different from that of 0-1 ILP. The procedure has been illustrated by two examples. DOI: http://dx.doi.org/10.3329/dujs.v61i2.17066 Dhaka Univ. J. Sci. 61(2): 173-178, 2013 (July)

scholarly journals Solving Multi-Objective Probabilistic Factional Programming Problem

2019 ◽  
Vol 8 (6S3) ◽  
pp. 897-903
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Programming Problem ◽  
Stochastic Simulation ◽  
Fractional Programming ◽  
Linear Fractional Programming ◽  
Multi Objective ◽  
Fractional Programming Problem ◽  
Simulation Based ◽  
Linear Fractional Programming Problem

This paper presents the solution methodology of a multiobjective probabilistic fractional programming problem. In the proposed model the parameters in the constraints coefficient and the right-hand sides of the constraints follow continuous random variables having known distribution. Since the programming problem consists of random variables, multi-objective function and fractional objective function, it is lengthy, time-consuming and clumsy to solve the proposed programming problem using analytical methods. Stochastic simulation-based genetic algorithm approach is directly applied to solve multi-objective probabilistic non-linear fractional programming problem involving beta distribution and chi-square distribution. In the proposed method, it is not necessary to find the deterministic equivalent of a probabilistic programming problem and applying any traditional methods of fractional programming problem. The stochastic simulation-based genetic algorithm is coded by Code block C++ 16.01 compiler. A set of Pareto optimal solutions are generated for a multi objective probabilistic non-linear fractional programming problem. A numerical example and case study on inventory problem are presented to validate the proposed method.

Sign in / Sign up

Export Citation Format

Share Document