Development of a formal algorithm for the formulation of a dual linear optimization problem
The rigorous formal algorithm for formulating a dual problem for different forms (general, basic, standard, and canonical) of a primal linear programming problem is proposed. First, definitions of a pair of dual problems for standard form of primal linear programming are given. This approach is base...
Main Authors: | Lyudmila Chernova, Sergiy Titov, Sergii Chernov, Kateryna Kolesnikova, Liubava Chernova, Viktor Gogunskii |
---|---|
Format: | Article |
Language: | English |
Published: |
PC Technology Center
2019-08-01
|
Series: | Eastern-European Journal of Enterprise Technologies |
Subjects: | |
Online Access: | http://journals.uran.ua/eejet/article/view/175105 |
Similar Items
-
Algorithm for the simplification of solution to discrete optimization problems
by: Sergii Chernov, et al.
Published: (2018-06-01) -
Fuzzy optimization of primal-dual pair using piecewise linear membership functions
by: Pandey D., et al.
Published: (2012-01-01) -
Improved Primal–Dual Interior-Point Method Using the Lawson-Norm for Inverse Problems
by: Wenjing Shang, et al.
Published: (2020-01-01) -
A primal-dual approach of weak vector equilibrium problems
by: László Szilárd
Published: (2018-03-01) -
An Exact Penalty Approach and Conjugate Duality for Generalized Nash Equilibrium Problems with Coupling and Shared Constraints
by: L. Altangerel, et al.
Published: (2020-03-01)