Simplex method for dynamic linear program solution

2005 ◽  
pp. 116-124
Author(s):  
V. E. Krivonozhko ◽  
A. I. Propoi
Keyword(s):  
Simplex Method ◽  
Linear Program

An Extended Simplex Algorithm for Linear Programming

2012 ◽  
Vol 532-533 ◽  
pp. 1626-1630
Author(s):  
Guo Guang Zhang
Keyword(s):  
Linear Programming ◽  
Simplex Method ◽  
Feasible Solution ◽  
Simplex Algorithm ◽  
Linear Program ◽  
Problem Solution ◽  
Test Number ◽  
The Times ◽  
Definition Of

Simplex method is one of the most useful methods to solve linear program. However, before using the simplex method, it is required to have a base feasible solution of linear program and the linear program is changed to thetypical form. Although there are some methods to gain the base feasible solution of linear program, artificial variablesare added and the times of calculating are increased with these calculations. In this paper, an extended algorithm of the simplex algorithm is established, the definition of feasible solution in the new algorithm is expended, the test number is not the same sign in the process of finding problem solution. Explained the principle of the new algorithm and showed results of LP problems calculated by the new algorithm.

scholarly journals Media Pembelajaran Berbantuan Sparkol Materi Program Linier Metode Simpleks

2018 ◽  
Vol 1 (3) ◽  
pp. 353-362 ◽  
Author(s):  
Indriyani Indriyani ◽  
Fredi Ganda Putra
Keyword(s):  
Large Class ◽  
Simplex Method ◽  
Video Data ◽  
Linear Program ◽  
Small Class ◽  
Design Development ◽  
The Media

Mathematics is a means of communication science about patterns that are useful to practice thinking logically, critically, creative and innovative.  The importance of mathematics in education is inversely related to the interest of students, because mathematics is considered to be difficult and tedious, it is necessary for the innovation in learning so that math seems easy and interesting, namely one of them with developing a learning media in the form of a video by using the app Sparkol's video scribe. The purpose of this research is learning media math using software Sparkol Video scribe on the main discussion of linear program simplex method, as well as test the feasibility and know the response of students to the media. This study uses a model ADDIE which includes 5 steps, namely: analysis (analyze), planning (design), development (development), implementation (implementation), and evaluation (evaluation). The feasibility of learning media obtained from the results of the validation by media experts and matter experts with the category and the attractiveness of the video data obtained from a questionnaire filled by the students include small class and large class and qualitatively qualified interesting. 

scholarly journals OPTIMIZATION OF PRODUCTION COSTS WITH SIMPLEX METHOD

2020 ◽  
Vol 4 (2) ◽  
pp. 66
Author(s):  
Firmansyah Firmansyah ◽  
Dedy Juliandri Panjaitan ◽  
Madyunus Salayan ◽  
Alistraja Dison Silalahi
Keyword(s):  
Problem Solving ◽  
Production Process ◽  
Everyday Life ◽  
Production Planning ◽  
Process Planning ◽  
Simplex Method ◽  
Resource Limitation ◽  
Linear Program ◽  
Production Costs ◽  
Limited Resources

One of the problems in the company is my resource limitation, the time of production and the tools used in the production process. Companies in making decisions in production planning in the presence of these limitations, should seek to maximize the profit generated. However, in the production process a production planning reference is required to maximize the results obtained and minimize the production costs used. To solve the problem, needed a problem solving tool that is linear program using simplex method. Simplex method is one of the methods of linear program in solving the problem of more than two variables that can be applied into everyday life and can be used in production process planning. With one of the ultimate goal is the achievement of the optimum value with the constraints of limited resources. The results of the simplex method have decreased costs incurred less than the usual costs incurred every month and the results obtained using the simplex method can be used as a reference in making decisions to get optimal results on production costs in the company.

scholarly journals A Computer Oriented Method for Solving Transportation Problem

2015 ◽  
Vol 63 (1) ◽  
pp. 1-7
Author(s):  
Sharmin Afroz ◽  
M Babul Hasan
Keyword(s):  
Linear Programming ◽  
Computer Program ◽  
Simplex Method ◽  
Transportation Problem ◽  
Linear Program ◽  
Numerical Examples ◽  
Linear Programming Problems

In this paper, an algorithm and its computer oriented program have been developed for solving transportation programming (TP) reducing it into a linear program (LP). After formulating it into linear programming problems the number of variables becomes large. It then, becomes more difficult and time-consuming if it is done manually with simplex method. By using the computer program the solution can be found in a shorter time. It will be shown that a TP with a large number of variables can be solved in few seconds by using this method. A number of numerical examples are presented to demonstrate the method developed in this research. DOI: http://dx.doi.org/10.3329/dujs.v63i1.21758 Dhaka Univ. J. Sci. 63(1): 1-7, 2015 (January)

scholarly journals Optimisasi Program Linear Integer Murni Dengan Metode Branch And Bound

2018 ◽  
Vol 1 (2) ◽  
pp. 175-181
Author(s):  
Tondi Marulizar ◽  
Ujian Sinulingga ◽  
Esther Nababan
Keyword(s):  
Combinatorial Optimization ◽  
Branch And Bound ◽  
Simplex Method ◽  
Optimization Problem ◽  
Linear Program ◽  
Integer Linear Program ◽  
Branch And Bound Method ◽  
A Value ◽  
Calculation Process ◽  
Lower Limits

Program Linier Integer Murni merupakan optimisasi kombinatorial yang tidak mudah untuk diselesaikan secara efisien. Metode yang sering digunakan untuk menyelesaikan Program Linier Integer Murni diantaranya adalah metode merative, yang merupakan salah satunya metode Branch and Bound. Metode ini menggunakan hasil dari metode simpleks yang belum bernilai integer sehingga dilakukan pencabangan dan batasan terhadap variabel x_j yang bernilai pecahan terbesar. Metode Branch and Bound dapat menyelesaikan masalah optimisasi suatu produk, tetapi membutuhkan waktu yang lebih lama dalam proses perhitungannya dikarenakan dalam setiap tahap perhitungan harus dicari nilai dari batas atas dan batas bawah yang ditentuan berdasarkan suatubatasandankriteria tertentu. Pure Integer Linear Program is combinatorial optimization that is not easy to solve efficiently. The method that is often used to complete the Pure Integer Linear Program is the merative method, which is one of the Branch and Bound methods. This method uses the results of the simplex method that is not yet an integer value so that the branching and limitation of the x_j variable is the largest fraction. The Branch and Bound method can solve the optimization problem of a product, but requires a longer time in the calculation process because in each calculation phase, a value must be sought from the upper and lower limits determined based on the boundary and certain criteria. 

Maksimalisasi Keuntungan Dengan Pendekatan Metode Simpleks Kasus Pada Pabrik Sosis SM

Liquidity ◽  
2018 ◽  
Vol 2 (1) ◽  
pp. 59-65 ◽  
Author(s):  
Yanti Budiasih
Keyword(s):  
Linear Programming ◽  
Simplex Method ◽  
Optimal Combination ◽  
Optimal Input ◽  
Maximum Profit ◽  
Input Combination

The purpose of this study are to (1) determine the combination of inputs used in producing products such as beef sausages and veal sausage meatball; and (2) determine the optimal combination whether the product can provide the maximum profit. In order to determine the combination of inputs and maximum benefits can be used linear programming with graphical and simplex method. The valuation result shows that the optimal input combination would give a profit of Rp. 1.115 million per day.

Digital Multiple Notch Filter Design with Nelder-Mead Simplex Method

2017 ◽  
Vol E100.A (1) ◽  
pp. 259-265
Author(s):  
Qiusheng WANG ◽  
Xiaolan GU ◽  
Yingyi LIU ◽  
Haiwen YUAN
Keyword(s):  
Simplex Method ◽  
Filter Design ◽  
Notch Filter
Sign in / Sign up

Export Citation Format

Share Document