نتایج جستجو برای: goal linear programming gp

تعداد نتایج: 990465  

2002
BOAZ GOLANY JIAN YANG GANG YU

We propose an interactive Goal Programming (GP) for operational recovery problems that are present in diverse areas of application. After defining the problem we discuss its relevance to scenarios taken from airline scheduling, supply chain management and call centers operations. We then construct the GP procedure for operational recovery decision making and illustrate the mechanics of the prop...

Journal: :Journal of the Operations Research Society of Japan 1989

Journal: :Journal of Uncertainty Analysis and Applications 2015

2000
William B. Langdon

A common problem in datamining is to nd accurate classi-ers for a dataset. For this purpose, genetic programming (GP) is applied to a set of benchmark classiication problems. Using GP, we are able to induce decision trees with a linear combination of variables in each function node. A new representation of decision trees using Strong Typing in GP is introduced. With this representation it is no...

Journal: :مدیریت صنعتی 0
جمشید صالحی صدقیانی دانشگاه علامه مقصود امیری دانشگاه علامه طباطبایی سیدحسین رضوی دانشگاه علامه طباطبایی شیده سادات هاشمی دانشگاه علامه طباطبایی اصحاب حبیب زاده

data envelopment analysis (dea) is a wide range of mathematical models that used for measuring the relative efficiency of a set of harmonic units whit similar inputs and outputs. this model calculates some different weight for input and output variables in each decision making model. this variation in similar weights caused some critiques to this method. from 1991 some linear and nonlinear mode...

2016
Ivaylo Hristakiev Detlef Plump

We present the foundations of critical pair analysis for the graph programming language GP 2. Our goal is to develop a static checker that can prove or refute confluence (functional behaviour) for a large class of graph programs. In this paper, we introduce symbolic critical pairs of GP 2 rule schemata, which are labelled with expressions, and establish the completeness and finiteness of the se...

Bibhas C. Giri Partha Pratim Dey Surapati Pramanik

The objective of this paper is to present a technique for order preference by similarity to ideal solution (TOPSIS) algorithm to linear fractional bi-level multi-objective decision-making problem. TOPSIS is used to yield most appropriate alternative from a finite set of alternatives based upon simultaneous shortest distance from positive ideal solution (PIS) and furthest distance from negative ...

Journal: :اقتصاد و توسعه کشاورزی 0
حسن سخدری محمود صبوحی

in a region, optimal allocation of lands to various agricultural products is one of the most important issue associated with optimal use of agricultural resources. meta-goal programming is one of the multiple criteria decision models. this programming provides more flexible decisions for decision makers than other goal programming. in the current study, optimal cropping pattern was determined u...

1999
Julian F. Miller

A new form of Genetic Programming (GP) called Cartesian Genetic Programming (CGP) is proposed in which programs are represented by linear integer chromosomes in the form of connections and functionalities of a rectangular array of primitive functions. The effectiveness of this approach is investigated for boolean even-parity functions (3,4,5), and the 2-bit multiplier. The minimum number of eva...

Journal: :Association of Arab Universities Journal of Engineering Sciences 2019

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید