Some remarks about the transformation of Charnes and Cooper by Ezio Marchi *)

Similar documents
On Generalized Fractional Hankel Transform

BINARY LAMBDA-SET FUNCTION AND RELIABILITY OF AIRLINE

ECE 422 Power System Operations & Planning 2 Synchronous Machine Modeling

Instance-Based Learning and Clustering

Machine Learning: and 15781, 2003 Assignment 4

A Developed Method of Tuning PID Controllers with Fuzzy Rules for Integrating Processes

ECE 522 Power Systems Analysis II 2 Power System Modeling

EC3075 Mathematical Approaches to Economics

The corresponding link function is the complementary log-log link The logistic model is comparable with the probit model if

APPROXIMATE OPTIMAL CONTROL OF LINEAR TIME-DELAY SYSTEMS VIA HAAR WAVELETS

Journal of Engineering and Applied Sciences. Ultraspherical Integration Method for Solving Beam Bending Boundary Value Problem

Complement of an Extended Fuzzy Set

CHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION

ON DUALITY FOR NONSMOOTH LIPSCHITZ OPTIMIZATION PROBLEMS

Interval Valued Neutrosophic Soft Topological Spaces

Controller Design for Networked Control Systems in Multiple-packet Transmission with Random Delays

can be decomposed into r augmenting cycles and the sum of the costs of these cycles equals, c . But since is optimum, we must have c

General Nonlinear Programming (NLP) Software

Chapter 2 Transformations and Expectations. , and define f

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

Outline. Clustering: Similarity-Based Clustering. Supervised Learning vs. Unsupervised Learning. Clustering. Applications of Clustering

Global Exponential Stability of FAST TCP

FAULT DETECTION AND IDENTIFICATION BASED ON FULLY-DECOUPLED PARITY EQUATION

Uniform bounds on the 1-norm of the inverse of lower triangular Toeplitz matrices

Jointly optimized rate-compatible UEP-LDPC codes for half-duplex co-operative relay networks

t } = Number of calls in progress at time t. Engsett Model (Erlang-B)

An Integer Solution of Fractional Programming Problem

Balanced multicolour Pólya urns via smoothing systems analysis

4.Discrete Systems. Continuous system. () t. ( k) t Digitized. Computer controller. Assume the DAC+ADC are clocked at sampling period T.

Opinion Consensus of Modified Hegselmann-Krause Models

Voltammetry. Bulk electrolysis: relatively large electrodes (on the order of cm 2 ) Voltammetry:

Some modelling aspects for the Matlab implementation of MMA

Three-Partition Flow Cover Inequalities for Constant Capacity Fixed-Charge Network Flow Problems

Module 9. Lecture 6. Duality in Assignment Problems

JSM Survey Research Methods Section. Is it MAR or NMAR? Michail Sverchkov

1 GSW Iterative Techniques for y = Ax

OPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming

On the unconditional Security of QKD Schemes quant-ph/

Correlation and Regression without Sums of Squares. (Kendall's Tau) Rudy A. Gideon ABSTRACT

Charged Particle in a Magnetic Field

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Affine transformations and convexity

425. Calculation of stresses in the coating of a vibrating beam

Correlation and Regression. Correlation 9.1. Correlation. Chapter 9

PHYSICS 212 MIDTERM II 19 February 2003

Lecture-7. Homework (Due 2/13/03)

Analytical classical dynamics

MULTICRITERION OPTIMIZATION OF LAMINATE STACKING SEQUENCE FOR MAXIMUM FAILURE MARGINS

Optimization. Nuno Vasconcelos ECE Department, UCSD

A solution to the Curse of Dimensionality Problem in Pairwise Scoring Techniques

Some Results on the Counterfeit Coins Problem. Li An-Ping. Beijing , P.R.China Abstract

Discriminative Estimation (Maxent models and perceptron)

Fuzzy Rings and Anti Fuzzy Rings With Operators

Differential flatness and control of nonlinear systems

Statistical Analysis of Environmental Data - Academic Year Prof. Fernando Sansò CLUSTER ANALYSIS

One Dimensional Axial Deformations

Clustering. CS4780/5780 Machine Learning Fall Thorsten Joachims Cornell University

A new mixed integer linear programming model for flexible job shop scheduling problem

CHAPTER 4d. ROOTS OF EQUATIONS

Large-Scale Data-Dependent Kernel Approximation Appendix

ρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to

e a = 12.4 i a = 13.5i h a = xi + yj 3 a Let r a = 25cos(20) i + 25sin(20) j b = 15cos(55) i + 15sin(55) j

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

MEASURING SOFT CONSENSUS IN UNCERTAIN LINGUISTIC GROUP DECISION-MAKING BASED ON DEVIATION AND OVERLAP DEGREES

Module 3: Element Properties Lecture 1: Natural Coordinates

The calculation of ternary vapor-liquid system equilibrium by using P-R equation of state

A Theorem of Mass Being Derived From Electrical Standing Waves (As Applied to Jean Louis Naudin's Test)

POWER ON DIGRAPHS. 1. Introduction

A 2D Bounded Linear Program (H,c) 2D Linear Programming

Integrals and Invariants of Euler-Lagrange Equations

McCreight s Suffix Tree Construction Algorithm. Milko Izamski B.Sc. Informatics Instructor: Barbara König

MMA and GCMMA two methods for nonlinear optimization

Brander and Lewis (1986) Link the relationship between financial and product sides of a firm.

PART 8. Partial Differential Equations PDEs

COMPUTER SCIENCE 349A SAMPLE EXAM QUESTIONS WITH SOLUTIONS PARTS 1, 2

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem

Risk Based Maintenance Strategy for Coastal Concrete Structures

4DVAR, according to the name, is a four-dimensional variational method.

DOAEstimationforCoherentSourcesinBeamspace UsingSpatialSmoothing

e i is a random error

Outline. Classification Methods. Feature Selection/Reduction: Entropy Minimization Algorithm

Nonequilibrium Thermodynamics of open driven systems

THE DIRAC THEORY OF CONSTRAINTS, THE GOTAY-NESTER THEORY AND POISSON GEOMETRY

APPLYING TRANSFORMATION CHARACTERISTICS TO SOLVE THE MULTI OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEMS

Solutions to Homework 7, Mathematics 1. 1 x. (arccos x) (arccos x) 1

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

Chapter 2 A Class of Robust Solution for Linear Bilevel Programming

p(z) = 1 a e z/a 1(z 0) yi a i x (1/a) exp y i a i x a i=1 n i=1 (y i a i x) inf 1 (y Ax) inf Ax y (1 ν) y if A (1 ν) = 0 otherwise

Solution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Which Protocol? Mutual Interaction of Heterogeneous Congestion Controllers

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

Problem Set 9 Solutions

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

1 Convex Optimization

36.1 Why is it important to be able to find roots to systems of equations? Up to this point, we have discussed how to find the solution to

Iterative Discovering of User s Preferences Using Web Mining

On the Multicriteria Integer Network Flow Problem

Semi-explicit Solution and Fast Minimization Scheme for an Energy with l 1 -Fitting and Tikhonov-Like Regularization

EE 330 Lecture 24. Small Signal Analysis Small Signal Analysis of BJT Amplifier

Transcription:

Some remars about the transformaton of Charnes an Cooper b Eo Marh * Abstrat In ths paper we eten n a smple wa the transformaton of Charnes an Cooper to the ase where the funtonal rato to be onsere are of smlar polnomal. Kewors: programmng, transformaton, Charnes an Cooper, fratonal programmng. Introuton * ouner an rst Dretor of the Insttuto e Matemáta Aplaa San Lus, CONICE-UNSL, Argentna.

Charnes an Cooper n [3] have ntroue an mportant transformaton. hs regars the equvalene about programmng wth lnear fratonal funtonal an lnear ones. Members of ths lass have been enountere n a varet of ontets. One suh ourrene [3] nvolve stuatons n whh the more usual senstvt analses were etene to problems nvolvng plans for optmal ata hanges. In these nstanes, lnear programmng nequaltes were to be onsere relatve to a funtonal formulate as a rato of two varables wheren one varable, n the numerator, represente the volume hanges that mght atten the possble varatons of a partular ost oeffent. Another eample was ealt wth b M. Klen n [8]. o hanle the problem of the fratonal funton, Klen apple a square-root transformaton whh be attrbute to C. Derman [5] n orer to effet a reuton to an equvalent lnear programmng problem. nall, a speal nstane of our general ase was treate b J. R. Isbell an W. H. Marlow n ther artle on Attrton Games, [7]. In onserng a rato, Isbell an Marlow were able to establsh a onvergent teratve proess whh nvolve replang the rato b the problem of optmng a sequene of fferent lnear funtonals. he lnear funtonal at an stage n the teratons was etermne b optmaton of the lnear funtonal at the preeng stage. he objetve of the present short paper s to eten the Charnes an Cooper transformaton to some other problems where the funtonal nvolves are quotent of lnear ones. As a partular ase of t we get the result that a general non-lnear problem s equvalent to a lnear one. General ratonal Moels Conser a general lass of fratonal moels arsng n programmng, whh are renere n the followng form:. A b 0 where A s an mn matr an b s an m vetor so that the two sets of onstants for the onstrans are relate b the n vetor of varables,. 2

It s assume, unless otherwse note, that the onstrants of. are regular, so that the soluton set n nonempt an boune. form P Here R nates the reals. n { R : A b, 0 } he general lass of fratonal moels to be onsere n ths paper s of the subjet to.: Where,,, mn f A b 0., are transpose of the n vetors of oeffents, where : 0, L,. If 0 we have the ase stue b Charnes an Cooper [4]. B reason of smplt we assume that for eah, we have the last part of the enomnator 0. > hus sne f s a ontnuous funton efne on a non-empt ompat set, t reahes ts mnmum. hat s to sa the problem P s solvable. ollowng the eas presente b Charnes an Cooper n [4], we wll prove that the guarantee the equvalene between P an the programmng program wth n varables P 2 subjet to, K, n, an the feasble set 2 : mn f, 3

2 A b 0 0, 0. We now proee to prove: Lemma : If, 2, then > 0. we obtan Proof: Assume that 0, then A 0. ae ˆ an µ > 0 an arbtrar, A But ˆ 0 an 0, ˆ A ˆ b µ. ontans the half straght lne { ˆ / λ 0} 0. hs s ontrator wth the fat that s boune. hen 0 λ f. But ths last fat proves a ontraton wth the seon restrton of P 2. Sne 0 an 0, we have > 0. Q. E. D.. As an mmeate onsequene of the prevous fat, we have that, f, 2 then :. Lemma 2: If, let us efne then, 2. : an : Proof: Sne > 0, we get 0 an 0 for eah. On the other han, f we ve the nequalt A b b we obtan A b whh s equvalent to A b 0. nall q hene, 2. Q. E. D.. 4

5 heorem 3: P an 2 P are solvable. Moreover, f s an optmal soluton of P,, s an optmal soluton of 2 P, an reproall, f, s an optmal soluton of 2 P, then s an optmal soluton of P. Proof: We now that P s solvable. Let an optmal soluton of P. Gvng a par 2, then 0 > an b Lemma an the omment after t. Sne we assume that f f for eah, f we now assoate to the vetor 2,,, we have, f, f hen we have prove that, s an optmal soluton of 2 P. herefore 2 P s also solvable.

Assume now that, s an optmal soluton of P 2. Conser a vetor an let the transformaton an. Applng the result after the Lemma, we have f f, f, whh t sas that s a soluton of P. Q. E. D.. Our result t turns out to be of mportant nterest n the ase of 0. In ths nstane t reues to the mportant transformaton of Charnes an Cooper [4]. In more general ases, t reues the egree of omplet of the polnomal. f Conlusons Here we have obtane an etenson of the Charnes an Cooper transformaton to the ase when we have a polnomal form n the numerator an the enomnator. he ase when some an are equal t reues the omplet n more egrees n the enomnator. urthermore, there est some varetes of stuatons that the smplt of the new programs appears naturall. or eample the ase where?for S N. hen n suh a ase we obtan goo reuton. Moreover f all 0 an the,, K, we have obtane an nterestng result, sne the transforme program s lnear. or further omments we subjet the reaer to refer to the orgnal paper [4]. here are also further etensons whh we shall treat elsewhere. Anowlegement Part of the researh unerlng ths paper was supporte b grants of the CONICE Consejo Naonal e Investgaones Centífas énas an b the Consejo e Investgaones of the ault of. M. N. S. of UNSL. 6

Bblograph [] Barlow, R. E., an L. C. Hunter: Mathematal Moels for Sstem Relablt, he Slvana ehnologst XIII, an 2 960. [2] Charnes, A., an W. W. Cooper: Management Moels an Inustral Applatons of Lnear Programmng John Wle an Sons, In., New Yor, 96. [3] Charnes, A., an W. W. Cooper: Sstems Evaluaton an Reprng heorems, O.N.R. Memoranum No. 3, September 960. [4] Charnes, A., an W. W. Cooper: Programmng wth ratonal untonals: I, Lnear ratonal Programmng, Sstems Researh Group, he ehnologal Insttute, Northwestern Unverst, ONR Researh Memoranum No. 50, ebruar 962. [5] Derman, C.: On Sequental Desons an Marov Chans, Management Sene, Vol. 9, No., Otober 962. [6] Goberna, M. A., V. Jornet an R. Puente: Optmaón Lneal, eoría, Métoos Moelos In Spansh. [7] Isbell, J. R., an W. H. Marlow: Attrton Games, Naval Researh Logsts Quartel, 3, an 2, 7-93 956. [8] Klen, M.: Inspeton-Mantenane-Replaement Sheule uner Marovan Deteroraton, Management Sene, Vol. 9, No., Otober 962. [9] Shable, S.: Nonlnear fratonal programmng, Sehste Oberwolfah-agung über Operatons Researh 973, el II, pp. 09-5. Operatons Researh Verfahren, Ban XIX, Han, Mesenhem am Glan, 974. 7