SOME ASPECTS ON SOLVING A LINEAR FRACTIONAL TRANSPORTATION PROBLEM

Similar documents
DUALITY FOR MINIMUM MATRIX NORM PROBLEMS

MULTIOBJECTIVE NONLINEAR FRACTIONAL PROGRAMMING PROBLEMS INVOLVING GENERALIZED d - TYPE-I n -SET FUNCTIONS

-Pareto Optimality for Nondifferentiable Multiobjective Programming via Penalty Function

( ) ( ) ( ( )) ( ) ( ) ( ) ( ) ( ) = ( ) ( ) + ( ) ( ) = ( ( )) ( ) + ( ( )) ( ) Review. Second Derivatives for f : y R. Let A be an m n matrix.

7.0 Equality Contraints: Lagrange Multipliers

Duality for a Control Problem Involving Support Functions

KURODA S METHOD FOR CONSTRUCTING CONSISTENT INPUT-OUTPUT DATA SETS. Peter J. Wilcoxen. Impact Research Centre, University of Melbourne.

An Expansion of the Derivation of the Spline Smoothing Theory Alan Kaylor Cline

Chapter 16 Measurement Error Models

Debabrata Dey and Atanu Lahiri

An Algorithm for Capacitated n-index Transportation Problem

B-spline curves. 1. Properties of the B-spline curve. control of the curve shape as opposed to global control by using a special set of blending

A New Method for Solving Fuzzy Linear. Programming by Solving Linear Programming

Some Different Perspectives on Linear Least Squares

3D Reconstruction from Image Pairs. Reconstruction from Multiple Views. Computing Scene Point from Two Matching Image Points

Isomorphism on Intuitionistic Fuzzy Directed Hypergraphs

Sebastián Martín Ruiz. Applications of Smarandache Function, and Prime and Coprime Functions

The Number of the Two Dimensional Run Length Constrained Arrays

Noncommutative Solitons and Integrable Systems

Unique Common Fixed Point of Sequences of Mappings in G-Metric Space M. Akram *, Nosheen

Non-commutative Solitons and Integrable Equations

On Optimal Termination Rule for Primal-Dual Algorithm for Semi- Definite Programming

A Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming

A Family of Non-Self Maps Satisfying i -Contractive Condition and Having Unique Common Fixed Point in Metrically Convex Spaces *

The theoretical background of

On the local controllability of a discrete-time inhomogeneous multi-input bilinear systems

Odd-elegant Labeling Algorithm of Generalized Ring Core Networks

A PAIR OF HIGHER ORDER SYMMETRIC NONDIFFERENTIABLE MULTIOBJECTIVE MINI-MAXMIXED PROGRAMMING PROBLEMS

Lower and upper bound for parametric Useful R-norm information measure

State Feedback Control Block Diagram

Approximation of Parametric Functions by Bicubic B-spline Functions. Majid Amirfakhrian a, Sahar Didab b.

Chapter 4: Linear Momentum and Collisions

Noncommutative Solitons and Integrable Systems

Coherent Potential Approximation

CS 2750 Machine Learning. Lecture 7. Linear regression. CS 2750 Machine Learning. Linear regression. is a linear combination of input components x

Open and Closed Networks of M/M/m Type Queues (Jackson s Theorem for Open and Closed Networks) Copyright 2015, Sanjay K. Bose 1

A Conventional Approach for the Solution of the Fifth Order Boundary Value Problems Using Sixth Degree Spline Functions

Expanding Super Edge-Magic Graphs

Support vector machines II

Algorithms behind the Correlation Setting Window

An Innovative Algorithmic Approach for Solving Profit Maximization Problems

Theory study about quarter-wave-stack dielectric mirrors

DYNAMICS. Systems of Particles VECTOR MECHANICS FOR ENGINEERS: Seventh Edition CHAPTER. Ferdinand P. Beer E. Russell Johnston, Jr.

A conic cutting surface method for linear-quadraticsemidefinite

CS 1675 Introduction to Machine Learning Lecture 12 Support vector machines

STK3100 and STK4100 Autumn 2018

A Characterization of Jacobson Radical in Γ-Banach Algebras

Numerical Experiments with the Lagrange Multiplier and Conjugate Gradient Methods (ILMCGM)

THE TRUNCATED RANDIĆ-TYPE INDICES

for each of its columns. A quick calculation will verify that: thus m < dim(v). Then a basis of V with respect to which T has the form: A

1D Lagrangian Gas Dynamics. g t

Non-degenerate Perturbation Theory

CS 2750 Machine Learning Lecture 8. Linear regression. Supervised learning. a set of n examples

On the characteristics of partial differential equations

ON A NEUMANN EQUILIBRIUM STATES IN ONE MODEL OF ECONOMIC DYNAMICS

Parallelized methods for solving polynomial equations

STK3100 and STK4100 Autumn 2017

ROOT-LOCUS ANALYSIS. Lecture 11: Root Locus Plot. Consider a general feedback control system with a variable gain K. Y ( s ) ( ) K

ANALYSIS OF POSITIVITY AND STABILITY OF DISCRETE-TIME AND CONTINUOUS-TIME NONLINEAR SYSTEMS

A Remark on the Uniform Convergence of Some Sequences of Functions

Department of Mathematics UNIVERSITY OF OSLO. FORMULAS FOR STK4040 (version 1, September 12th, 2011) A - Vectors and matrices

Processing of Information with Uncertain Boundaries Fuzzy Sets and Vague Sets

ASYMPTOTIC STABILITY OF TIME VARYING DELAY-DIFFERENCE SYSTEM VIA MATRIX INEQUALITIES AND APPLICATION

Some results and conjectures about recurrence relations for certain sequences of binomial sums.

1 Lyapunov Stability Theory

PRACTICAL CONSIDERATIONS IN HUMAN-INDUCED VIBRATION

Consumer theory. A. The preference ordering B. The feasible set C. The consumption decision. A. The preference ordering. Consumption bundle

7. Momentum balances Partly based on Chapter 7 of the De Nevers textbook (sections ).

ELEMENTS OF NUMBER THEORY. In the following we will use mainly integers and positive integers. - the set of integers - the set of positive integers

Solution to Some Open Problems on E-super Vertex Magic Total Labeling of Graphs

Integral Form of Popoviciu Inequality for Convex Function

DISTURBANCE TERMS. is a scalar and x i

1 Introduction. * Rocket Systems Division/ IMI, Israel ** School of Mathematics/Tel-Aviv University.

Meromorphic Solutions of Nonlinear Difference Equations

LOAD-FLOW CALCULATIONS IN MESHED SYSTEMS Node voltage method A system part with the node k and its direct neighbour m

On Hilbert Kunz Functions of Some Hypersurfaces

Change of Variables. f(x, y) da = (1) If the transformation T hasn t already been given, come up with the transformation to use.

NUMERICAL EVALUATION of DYNAMIC RESPONSE

EXPECTATION IDENTITIES OF GENERALIZED RECORD VALUES FROM NEW WEIBULL-PARETO DISTRIBUTION AND ITS CHARACTERIZATION

Journal Of Inequalities And Applications, 2008, v. 2008, p

TOWARDS Non-Commutative (=NC) integrable systems and soliton theories. Masashi HAMANAKA (Nagoya University, Dept. of Math. )

Binary classification: Support Vector Machines

Distributed Fusion Filter for Asynchronous Multi-rate Multi-sensor Non-uniform Sampling Systems

Discrete Adomian Decomposition Method for. Solving Burger s-huxley Equation

+ve 10 N. Note we must be careful about writing If mass is not constant: dt dt dt

The Finite Volume Method for Solving Systems. of Non-linear Initial-Boundary. Value Problems for PDE's

Evolutionary, Iterative Optimum-Optimorum Theory

Symmetry of the Solution of Semidefinite Program by Using Primal-Dual Interior-Point Method

Geometric Analogy and Products of Vectors in n Dimensions

Standard Deviation for PDG Mass Data

We have also learned that, thanks to the Central Limit Theorem and the Law of Large Numbers,

Connective Eccentricity Index of Some Thorny Graphs

ECONOMETRIC THEORY. MODULE VIII Lecture - 26 Heteroskedasticity

Global Optimization for Solving Linear Non-Quadratic Optimal Control Problems

Alternating Direction Implicit Method

2.160 System Identification, Estimation, and Learning Lecture Notes No. 17 April 24, 2006

Partition Optimization for a Random Process Realization to Estimate its Expected Value

Q-analogue of a Linear Transformation Preserving Log-concavity

ON THE NUMERICAL SOLUTION OF FRACTIONAL PARTIAL DIFFERENTIAL EQUATIONS. Solat Karimi Vanani and Azim Aminataei

2/20/2013. Topics. Power Flow Part 1 Text: Power Transmission. Power Transmission. Power Transmission. Power Transmission

Transcription:

Qattate Methods Iqres SOME ASPECTS ON SOLVING A LINEAR FRACTIONAL TRANSPORTATION PROBLEM Dora MOANTA PhD Deartet of Matheatcs Uersty of Ecoocs Bcharest Roaa Ma blshed boos: Three desoal trasort robles Debrdge Press Ne Yor 006; Teore s ractca roblee de trasort Cartea Uerstara Bcharest 006 E-al: dora.oata@yahoo.co Abstract: Ths aer resets the three-desoal trasortato roble a doble s odel hch the obecte fcto s the rato of to oste lear fctos. Ths aer obecte s to reset ho to obta ot th sle ethod. To llstrate the rocedre a ercal eale s ge. Key ords: the three desoal trasortato roble; rograg th fractoal lear obecte fcto; sle ethod Proble Descrto I a roosg o to sole the -desoal trasort roble a doble s odel - th the fractoal lear obecte fcto ad lear costrats: f ( ) a b 0 c a b c > 0 a b c T (7) () () () (4) (5) (6) 4

Qattate Methods Iqres Reqrg the follog secfcatos: the ber of sorces the ber of destatos the ber of eas of coeyace a the aalable qatty each sorce b the ecessary qatty each destato c the qatty th st be trasorted by eas of coeyace 0 Matr X { \ ; ; } hch satsfes costrats () () (4) (5) s called a trasortato la (feasble solto) ad la X s called ot f t satsfes (). Whe the codto (7) s satsfed the resltg forlato s called a balaced trasortato roble. Relato (7) s the ecessary ad sffcet codto for the estece of the solto: the leel of the atr of the costrat syste s shog that a o-degeerated trasortato la of roble (-7) cotas at least - o-ll cooets; The obecte s to establsh a trasortato la th total eeses. The fcto () s elct qas cocae S { X / () () (4) (5) }.e.: If S f( ) f( ) λ (0) ad 0 λ (- λ) the [f( ) f( )] < f( 0 ). For sch fcto local s ot ecessarly a global. Eery dfferetable [] elct qas cocae fcto s sedo cocae as ell. A otalty crtero for local s ge [] I ths aer s ade to geeralze the reslts ge by [][6]. Ths aer obecte s to reset ho to obta ot th the hel of the sle ethod. > 0 Solg the roble The cosderatos cocerg the three-desoal roble are ald. A tal feasble solto ca be obtaed by sg the o ethods fro the three-desoal trasort roble [4][5]. We deote I {() / > 0 X} De to (7) each odegeerate solto ll cota oste cooets. We cosder the dal arables (sle ltlers): defed sch that: for ( ) I ad ( ) ( ) (8) (9) (0) 44

Qattate Methods Iqres ( ) ( ) () Syste (8) (9) ca be soled deedetly. So syste (8) (9) has - eqatos th arables. We ca arbtrarly set 0 0 ad sole for the other ltlers. Hag detered e shall se these ales to detere oly. ad for the o-basc arables. Let X* (* ) be a feasble solto of the roble () (7). To establsh the otal crtero e eress f() ters of the o-basc arables a b c ( ) a b c V By eas of a slar rocedre e ca also rte : V a s b s c s here Vs s () Therefore the fcto f() becoes: f ( ) I I ( ) For f I I e hae V I I V I I V V V The artal derates of the fcto f() ealated at the ot f * V V ( V ) * are: 45

Qattate Methods Iqres Δ V V We ote The dal arables detered t old be easy to calclate The solto X* ca be roed f t ests at least a ale Δ Theore A solto X* (* ) s a local ot f arables. If oe of ths ales s ot oste e choose { Δ Δ 0} Δ < 0 00 0 Δ < 0 for o-basc arables. Δ 0 for all o-basc ad e roe the ale of f() by trodcg 0 0 the set of basc arables. The arable hch leaes the bass ad the ale of the basc arable the bass ca be detered as sal. Eale Cosder the roble th ad a 4 b 40 c 6 a 8 b 9 c a 7 c The atrces of costs: / 5/8 9/ 9/0 5/4 4/0 4/0 8/5 4/0 0/5 /5 /0 /0 7/ /5 7/0 4/0 8/5 /6 A tal feasble solto obtaed as [4][5] s X 0 : 6 8 8 5 for hch the ale of obecte fcto s f 88 549 0 5 Otalty erfcato : e detere the qattes fro systes: 5 8 46

Qattate Methods Iqres We obta 4 0 8 0 5 0 0 0 5 0 0 8 5 6 5 9 6 9 6 4 The atrces: / 0/0 -/-6-7/6-6/- -/- /0 9/6 0/0 0/0-4/- 0/0 7/9 /- 0/0 0/0-8/- 0/0 0/0 For hch V 88 V 549 V 5V Δ V V V ( 5 ) V Δ Ad atr Δ 0 ( for basc cooets). Matr Δ : 0 - -6-45 -45-0 0 0-5 0-65 5 0 0-65 0 0 The solto s ot ot becase there are cooets We roed solto: Δ 6 { Δ Δ < 0} It crtero : Ott crtero: as [4][5]: for basc cooets : z z z 0 z z z Δ < 0. θ ( ) (68) 8 θ 8 47

Qattate Methods Iqres Solto actalzato for basc cooets: θ z 0 8 The e solto X s: 8 8 6 5 9 for hch the ale of obecte fcto s Rese fro otalty erfcato f 77 597 Bblograhy. Aggaral S. P. Idefte qadratc fractoal rograg Cahers d Cetre d Etdes de Recherche Oeratoelle 97. Corba A. No Lear three-desoal rograg Re. Ro. Math. Pres et Al. 975. Datzg G. B. Wolfe F. The Decoosto Algorth for Lear Progras Ecooetrca ol. 9 o. 4 96 4. Magasara O. L. Psedo Coe Fctos J. Sa Cotrol r. 965 5. Moata D. Three desoal trasort robles Debrdge Press Ne Yor 006 6. Moata D. Teore s ractca roblee de trasort Cartea Uerstara Bcharest 006 7. Stac Masa I. M. A Three-Desoal Trasortato Proble th a Secal Strctred Obecte Fcto Bllet Math. Toe 8 o. -4 974 Dora Moata has receed a B.S. fro Faclty of Matheatcs Uersty of Bcharest. Also she has receed a degree Iforatcs ad has a Ph.D. Ecoocs - Ecooc Cyberetcs feld. She s the athor of ore tha 6 artcles Oeratos Research Ecooc Calcls ad Iforatcs ad atteded at eros secalty cogresses. Recetly blshed boos:. Moata D: Three desoal trasort robles Debrdge Press Ne Yor 006. Moata D: Teore s ractca roblee de trasort Cartea Uerstara Bcharest 006 48