scholarly journals Comparative Study of AMPL, Pyomo and JuMP Optimization Modeling Languages on a Network Linear Programming Problem Example

2021 ◽  
Vol 25 (3) ◽  
pp. 23-30
Author(s):  
Andrzej Karbowski ◽  
Krzysztof Wyskiel
Keyword(s):  
Linear Programming ◽  
Comparative Study ◽  
Programming Problem ◽  
Data Structures ◽  
Shortest Path ◽  
Linear Programming Problem ◽  
Modeling Languages ◽  
Specific Data ◽  
Optimization Modeling ◽  
Network Problems

The purpose of this work is a comparative study of three languages (environments) of optimization modeling: AMPL, Pyomo and JuMP. The comparison will be based on three implementations of the shortest path problem formulated as a linear programming problem. The codes for individual models and differences between them will be presented and discussed. Various aspects will be taken into account, such as: simplicity and intuitiveness of implementation, availability of specific data structures for a LP network problems, etc.

scholarly journals A comparative study of the methods of solving non-linear programming problem

1970 ◽  
Vol 4 (1) ◽  
pp. 28-34
Author(s):  
Bimal Chandra Das
Keyword(s):  
Linear Programming ◽  
Quadratic Programming ◽  
Comparative Study ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Feasible Region ◽  
Non Linear Programming ◽  
Condition Method ◽  
Non Linear ◽  
Matlab Programming

The work present in this paper is based on a comparative study of the methods of solving Non-linear programming (NLP) problem. We know that Kuhn-Tucker condition method is an efficient method of solving Non-linear programming problem. By using Kuhn-Tucker conditions the quadratic programming (QP) problem reduced to form of Linear programming(LP) problem, so practically simplex type algorithm can be used to solve the quadratic programming problem (Wolfe's Algorithm).We have arranged the materials of this paper in following way. Fist we discuss about non-linear programming problems. In second step we discuss Kuhn- Tucker condition method of solving NLP problems. Finally we compare the solution obtained by Kuhn- Tucker condition method with other methods. For problem so consider we use MATLAB programming to graph the constraints for obtaining feasible region. Also we plot the objective functions for determining optimum points and compare the solution thus obtained with exact solutions. Keywords: Non-linear programming, objective function ,convex-region, pivotal element, optimal solution. DOI: 10.3329/diujst.v4i1.4352 Daffodil International University Journal of Science and Technology Vol.4(1) 2009 pp.28-34

scholarly journals Comparative Study of AMPL, Pyomo and JuMP Optimization Modeling Languages on a Flood Control Problem Example

2021 ◽  
Vol 25 (4) ◽  
pp. 19-24
Author(s):  
Andrzej Karbowski ◽  
Krzysztof Wyskiel
Keyword(s):  
Nonlinear Programming ◽  
Comparative Study ◽  
Control Problem ◽  
Programming Problem ◽  
Discrete Time ◽  
Flood Control ◽  
Modeling Languages ◽  
Nonlinear Programming Problem ◽  
Optimization Modeling

The purpose of this work is a comparative study of three languages (environments) of optimization modeling: AMPL, Pyomo and JuMP. The comparison will be based on three implementations of an optimal discrete-time flood control problem formulated as a nonlinear programming problem. The codes for individual models and differences between them will be presented and discussed. Various aspects will be taken into account, e.g. simplicity and intuitiveness of implementation.

scholarly journals A Comparative Study of Solving Methods of Transportation Problem in Linear Programming Problem

2020 ◽  
pp. 45-67
Author(s):  
Farzana Sultana Rafi ◽  
Safiqul Islam
Keyword(s):  
Linear Programming ◽  
Comparative Study ◽  
Programming Problem ◽  
Approximation Method ◽  
Linear Programming Problem ◽  
Transportation Problem ◽  
Optimal Result ◽  
North West ◽  
C Programming

The paper is related with the basic transportation problem (TP)which is one kind of linear programming problem (LPP). There are some existing methods for solving transportation problem and in this paper all the standard existing methods has been discussed to understand which one is the best method among them. Among all of existing methods, the Vogel’s Approximation Method (VAM) is considered the best method which gives the better optimal result then other methods and North-West Corner Rule is considered as simplest but gives worst result. A C programming code for Vogel’s Approximation Method have been added in the appendix.

scholarly journals A comparative study on interval arithmetic operations with intuitionistic fuzzy numbers for solving an intuitionistic fuzzy multi–objective linear programming problem

2017 ◽  
Vol 27 (3) ◽  
pp. 563-573 ◽  
Author(s):  
Rajendran Vidhya ◽  
Rajkumar Irene Hepzibah
Keyword(s):  
Linear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Fuzzy Numbers ◽  
Optimization Method ◽  
Arithmetic Operations ◽  
Intuitionistic Fuzzy Numbers ◽  
Multi Objective ◽  
Intuitionistic Fuzzy ◽  
Interval Valued

AbstractIn a real world situation, whenever ambiguity exists in the modeling of intuitionistic fuzzy numbers (IFNs), interval valued intuitionistic fuzzy numbers (IVIFNs) are often used in order to represent a range of IFNs unstable from the most pessimistic evaluation to the most optimistic one. IVIFNs are a construction which helps us to avoid such a prohibitive complexity. This paper is focused on two types of arithmetic operations on interval valued intuitionistic fuzzy numbers (IVIFNs) to solve the interval valued intuitionistic fuzzy multi-objective linear programming problem with pentagonal intuitionistic fuzzy numbers (PIFNs) by assuming differentαandβcut values in a comparative manner. The objective functions involved in the problem are ranked by the ratio ranking method and the problem is solved by the preemptive optimization method. An illustrative example with MATLAB outputs is presented in order to clarify the potential approach.

Sign in / Sign up

Export Citation Format

Share Document