scholarly journals Hybrid Methodology of Nonlinear Goal Programming

2014 ◽  
Vol 8 (2) ◽  
Author(s):  
Lazo Roljić
Keyword(s):  
Goal Programming ◽  
Step Length ◽  
Nonlinear Constraints ◽  
Feasible Direction ◽  
Nonlinear Constraint ◽  
Convergence Problem ◽  
Method Of Feasible Directions ◽  
Euler’S Theorem ◽  
Linear Goal Programming ◽  
Hybrid Methodology

What we demonstrate here is a nonlinear goal-programming (NGP) algorithm based on hybrid connection of the modified simplex method of goal programming, gradient method of feasible directions and method of optimal displacement size finding-called HNGPM. Iterative methodology is given in five steps: (1) linearization the set of nonlinear constraints at particular point, (2) solving the problem of normalized linear goal programming, (3) feasible direction computation, (4) calculating optimal step length displacement, and (5) testing out convergence problem. Our idea was to apply Euler’s theorem for the “total” linearization of the nonlinear constraints (in the space) around particular point. According to Euler’s theorem, it is possible to apply this methodology to solve the problems of NGP whether the nonlinear constraint functions are linearly or positively homogeneous.

Open pit optimisation including mineral dressing criteria using 0–1 non-linear goal programming

2004 ◽  
Vol 113 (1) ◽  
pp. 3-16 ◽  
Author(s):  
Bijan Esfandiari ◽  
Mir Bahador Aryanezhad ◽  
S. Amir Abrishamifar
Keyword(s):  
Goal Programming ◽  
Open Pit ◽  
Linear Goal Programming ◽  
Non Linear

scholarly journals Pengembangan Struktur Ekonomi Jawa Timur pada Tahun 2002 dengan Menggunakan Linear Goal Programming

2010 ◽  
Vol 3 (2) ◽  
pp. 93
Author(s):  
Sugeng Santoso, Ratri Handayani
Keyword(s):  
Labor Force ◽  
Goal Programming ◽  
Consumer Demand ◽  
Economic Structure ◽  
Added Value ◽  
Economic Sector ◽  
Force Coefficient ◽  
Demand Fulfillment ◽  
Linear Goal Programming ◽  
Textile Industries

This research has objective in planning economic structure of East Java in 2002.Some aspect should be considered in planing the structure are consumer demand fulfillment that hasclose relation with output which must be resulted by respective sector,PDRB target achievement while paying attention on problem of absorbing labor force in the respective economic sector and import reduction.To attain the structure we use concept of linear goal programming. The first step we take is developing a model suitable for the linear goal programming and then manipulating data hat is began by aggregation updating,arranging technology coellcient, labor force coefficient,added value coeffcient import coefficient and right side value. To get a solution of the existing model we make use of QS software.From the result of research could be concluced that priority sector must be priority are l. Trading, 2. Textile Industries 3. Transportation4. cigaretteindustry,6. Food of plants.The critical sector have to be attended are 1. Fishery,2. Bevarage industry, 3. Forestry

scholarly journals Equivalent Transformation of Nonlinear Constraints to Linear Constraints in Petri Nets

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
YuFeng Chen ◽  
Abdulrahman Al-Ahmari ◽  
Chi Tin Hon ◽  
NaiQi Wu
Keyword(s):  
Linear Programming ◽  
Petri Nets ◽  
Integer Linear Programming ◽  
Programming Model ◽  
Linear Constraints ◽  
Linear Programming Model ◽  
Equivalent Transformation ◽  
Nonlinear Constraints ◽  
Nonlinear Constraint ◽  
Integer Linear Programming Model

This paper focuses on the enforcement of nonlinear constraints in Petri nets. An integer linear programming model is formulated to transform a nonlinear constraint to a minimal number of conjunctive linear constraints that have the same admissible marking space as the nonlinear one does in Petri nets. The obtained linear constraints can be easily enforced to be satisfied by a set of control places with a place invariant based method. The control places make up a supervisor that can enforce the given nonlinear constraint. For a case that the admissible marking space decided by a nonlinear constraint is nonconvex, another integer linear programming model is developed to obtain a minimal number of constraints whose disjunctions are equivalent to the nonlinear constraint with respect to the reachable markings. Finally, a number of examples are provided to demonstrate the proposed approach.

A Linear Goal Programming Model for Weight Calculation in Fuzzy AHP and its Application in Product Development

2010 ◽  
Vol 118-120 ◽  
pp. 712-716 ◽  
Author(s):  
Li Jun Yan ◽  
Zong Bin Li ◽  
Xiao Chun Yang
Keyword(s):  
Product Development ◽  
Goal Programming ◽  
Programming Model ◽  
Pairwise Comparison ◽  
Analysis Method ◽  
Pairwise Comparison Matrix ◽  
Wrong Decision ◽  
Comparison Matrix ◽  
Linear Goal Programming ◽  
Goal Programming Model

The key issue of FAHP application is how to derive fuzzy weights from fuzzy pairwise comparison matrix. The most of applications, however, were founding avoiding the use of sophisticated approaches such as fuzzy least squares method and using a simple extent analysis method to derive fuzzy weight from pairwise comparison matrix for the sake of simplicity. But the extent analysis method proves to be incorrect and may lead to a wrong decision result. So, this paper proposes a sound yet simple linear goal programming model to derive weights from pairwise fuzzy comparison matrix, which takes minimizing inconsistence degree of comparison matrix as objective and obtain a normalized weight vector finally. The proposed model is validated by an application to new product development scheme screening decision making.

Sign in / Sign up

Export Citation Format

Share Document