This paper deals with fuzzy goal programming approach to multi-objective linear plus linear fractional programming problem based on Taylor series approximation. In the model formulation of the problem, we first construct the membership functions by determining individual optimal solutions of the objective functions subject to the system constraints. The membership functions are then transformed...

Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This motivation leads us to study the tropical analogue of the classical linear-fractional programming problem. We construct an associated parametric mean payoff game problem, and show that...

In this paper, we study multi-parametric sensitivity analysis under perturbations in multiple rows or columns of the constraint matrix in programming problems with the piecewise linear fractional objective function using the concept of maximum volume in the tolerance region. The weak maximum volume region is defined for optimal region which can be solved through a maximization problem.A major d...

and Applied Analysis 3 K x { ( s, t, ỹ ) ∈ N × R × R : 1 ≤ s ≤ n 1, t t1, t2, . . . , ts ∈ R

We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems.

whereAn is the n-fold product of the σ-algebraA of subsets of a given set X ,Fi,Gi, i∈ p ≡ {1,2, . . . , p}, and Hj , j ∈ q, are real-valued functions defined on An, and for each i ∈ p, Gi(S) > 0 for all S∈An such that Hj(S) 0, j ∈ q. This paper is essentially a continuation of the investigation that was initiated in the companion paper [6] where some information about multiobjective fractional...

A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.

Abstract: In this paper, we generalize the (V, ρ)-invexity defined for nonsmooth multiobjective fractional programming by Mishra, Rueda and Giorgi (2003) to variational programming problems by defining new classes of vector-valued functions called (V, ρ)B-type I and generalized (V, ρ)-B-type I. Then we use these new classes to derive various sufficient optimality conditions and mixed type duali...

In this paper, we focus on fractional programming problems that minimize the ratio of two indefinite quadratic functions subject to two quadratic constraints. Utilizing the relationship between fractional programming and parametric programming, we transform the original problem into a univariate nonlinear equation. To evaluate the function in the equation, we need to solve a problem of minimizi...