Neutrosophic Optimization and Intelligent systems

Journal Homepage: sciencesforce.com/nois

Neutrosophic Opt. Int. Syst. Vol. 1 (2024) 39-45

Paper Type: Original Article

Converting Some Zero-One Neutrosophic Nonlinear

Programming Problems into Zero-One Neutrosophic Linear
Programming Problems

Maissam Jdid 1,* and Florentin Smarandache 2

1 Faculty of Science, Damascus University, Damascus, Syria; [email protected].

2 University of New Mexico ،Mathematics, Physics and Natural Sciences Division, 705 Gurley Ave., Gallup, NM 87301, USA;
[email protected].

Received: 30 Jul 2023 Revised: 30 Nov 2023 Accepted: 01 Jan 2024 Published: 21 Jan 2024

Abstract
The science of operations research is the applied aspect of mathematics and one of the most important modern
sciences that is concerned with practical issues and meets the desire and request of decision makers to obtain ideal
decisions through the methods it presents that are appropriate for all issues, such as linear programming, nonlinear
programming, dynamic programming, integer programming, etc. The basic essence of this science is to build
mathematical models consisting of an objective function and constraints. In these models, the objective function
is a maximization function or a minimization function for a specific quantity. This quantity depends on a number
of decision variables that may be independent of each other or related to each other. Through a set of constraints,
we obtain values for these variables by solving the mathematical model that we obtain. Given the great importance
of operations research methods, we have in previous research presented a neutrosophic vision for some of these
methods, such as neutrosophic linear models, neutrosophic nonlinear models, dynamic programming, neutrosophic
programming with binary integers, etc. In this research, we present a neutrosophical study of some of the
procedures used to convert some zero-one neutrosophic nonlinear programming problems into zero-one
neutrosophic linear programming problems.

Keywords: Neutrosophic Operations Research, Neutrosophic Linear Programming, Neutrosophic Nonlinear Programming,
Zero-One Neutrosophic Nonlinear Programming Problems, Zero-One Neutrosophic Linear Programming Problems.

1 |Introduction
To keep pace with scientific development and provide new studies of operations research methods that rely
on concepts of logic different from classical logic, and after the emergence of neutrosophic logic, many
researchers turned to reformulating many scientific concepts using the concepts of this neutrosophic logic,
so we have neutrosophic numbers ,neutrosophic groups ,neutrosophic probabilities ,neutrosophic statistics,
neutrosophic differentiation, neutrosophic integration, neutrosophic decision theory, neutrosophic linear
programming, neutrosophic nonlinear programming, neutrosophic dynamic programming, neutrosophic
simulation, neutrosophic binary integer programming... [1-23], in this research we present some procedures

Corresponding Author: [email protected]

10. https://doi.org/10.61356/j.nois.2024.17489
Licensee Neutrosophic Optimization and Intelligent systems. This article is an open access article distributed under the
terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0).
Converting Some Zero-One Neutrosophic Nonlinear Programming Problems into Zero-One ... 04

used to converting some zero-one neutrosophic nonlinear programming problems into zero-one
neutrosophic linear programming problems. We know that nonlinear programming problems are
characterized by the presence of a set of terms that implicitly call for the use of nonlinear functions such as:
𝑙𝑛𝑥, 𝑠𝑖𝑛𝑥, 𝑒 𝑥 , 𝑥 𝑛 … , nonlinearity also appears as a result of a mutual influence between two or more variables,
such as: 𝑥1 𝑥2 , 𝑥1 𝑙𝑛𝑥2 , …, If there are such expressions in the objective function, constraints, or both, then
the mathematical model is a nonlinear model, and if some or all of the variables are restricted to be one or
zero , then we get nonlinear models with binary integers. The mathematical model is a neutrosophic model if
it has some indeterminacy. When collecting data that describes a realistic issue and this data is incomplete or
contains something ambiguous or may contain some contradictions or may be unclear, we will then be unable
to build an accurate traditional model. This will lead us to building an approximate model, in neutrosophic
model, the variables in the objective function and constraints, some or all of them, are neutrosophic numbers.
The neutrosophic number is a number written in the following standard form, 𝑁 = 𝑎 + 𝑏𝐼, where 𝑎 𝑎𝑛𝑑 𝑏
are real or complex coefficients. 𝑎 represents the definite part and 𝑏𝐼 represents the indefinite part
(indeterminacy) of the number 𝑁, and it is possible that [𝜆1 , 𝜆2 ] or {𝜆1 , 𝜆1 } or...otherwise it is any set
close to the real value 𝑎.

2 |Discussion
Since the aim of this research is to converting some zero-one neutrosophic nonlinear programming problems
into zero-one neutrosophic linear programming problems, based on the information contained in references
[24-26].
1. From reference [24], we find that what is meant by neutrosophic data are values that are not completely
defined, written in the following standard format:
𝑁 = 𝑎 + 𝑏𝐼
where 𝑎 𝑎𝑛𝑑 𝑏 are real or complex coefficients, 𝑎 represents the definite part and 𝑏𝐼 the indeterminate
part of the number 𝑁 and it can be [𝜆1 , 𝜆2 ] or {𝜆1 , 𝜆1 } or...otherwise it is any set close to the real
value 𝑎, and the neutrosophic model, the numbers that precede the variables in the objective function
and in the constraints are neutrosophic values, as well as the second side of the relationships that represent
the constraints, and it is written in the following general formula:
𝑁𝑓 = 𝑁𝑓(𝑥1 , 𝑥2 , −−, 𝑥𝑛 ) → (𝑀𝑎𝑥 )𝑜𝑟 (𝑀𝑖𝑛)
Constraints:
≤
𝑁𝑔𝑖 (𝑥1 , 𝑥2 , −−, 𝑥𝑛 ) (≥) 𝑁𝑏𝑖 ; 𝑖 = 1,2, − − −, 𝑚
=
𝑥1 , 𝑥2 , −−, 𝑥𝑛 ≥ 0
2. In references [25-26] the neutrosophic linear models and the neutrosophic nonlinear models were
defined, and we mention that the mathematical model is a nonlinear model if any of the components of
the objective function or constraints are nonlinear expressions such as 𝑙𝑛𝑥, 𝑠𝑖𝑛𝑥, 𝑒 𝑥 , 𝑥 𝑛 , 𝑥1 𝑥2 , 𝑥1 𝑙𝑛𝑥2 , …
,and the nonlinear expressions may be in both.
3. The Neutrosophic nonlinear programming problem is a zero-one problem if the decision variables 𝑥𝑗 are
restricted to belonging to the set {0,1}
Then the neutrosophic mathematical model is written in the following general form:
𝑁𝑓 = 𝑁𝑓(𝑥1 , 𝑥2 , −−, 𝑥𝑛 ) → (𝑀𝑎𝑥 )𝑜𝑟 (𝑀𝑖𝑛)
Constraints:
04 Jadid and smarandache| Neutrosophic Opt. Int. Syst. 1 (2024) 39-45

≤
𝑁𝑔𝑖 (𝑥1 , 𝑥2 , −−, 𝑥𝑛 ) (≥) 𝑁𝑏𝑖 ; 𝑖 = 1,2, − − −, 𝑚
=
𝑥𝑗 ∈ {0,1} ; 𝑗 = 1,2, … , 𝑛
4. From the study reported in the classical reference [27], we find that if the nonlinearity in any zero–one
model results from the presence of nonlinearity expressions of the following two forms:
𝑥 𝑛 , 𝑥1 𝑥2 𝑥3 𝑥4 … 𝑥n
We can convert this model into zero-one linear model by relying on the validity of the following relation:
i. For any positive number 𝑘 and any binary variable we have:

𝑥𝑗 ∈ {0,1} 𝑡ℎ𝑒𝑛 𝑥𝑗𝑘 = 𝑥𝑗 ; 𝑗 = 1,2, … , 𝑛

ii. For binary values of any variables 𝑥𝑟 , 𝑥𝑠 , the product 𝑥𝑟 𝑥𝑠 is always “equal” to 0 or 1, so we
replace the product with a new variable, 𝑦1 = 𝑥𝑟 𝑥𝑠 achieves the following:
1 𝑥𝑟 = 𝑥𝑠 = 1
𝑦1 = {
0 𝑥𝑟 𝑜𝑟 𝑥𝑠 = 0
We achieve this by adding the following two constraints:
𝑥𝑟 + 𝑥𝑠 − 𝑦1 ≤ 1
−𝑥𝑟 − 𝑥𝑠 + 2𝑦1 ≤ 0
We note that when 𝑥r = 𝑥s = 1 reduces the previous two constraint to 𝑦1 ≥ 1 and 𝑦1 ≤ 1
Therefore 𝑦1 = 1, when 𝑥r = 0 𝑜𝑟 𝑥s = 0 𝑜𝑟 𝑥r = 𝑥s = 0 ,we find that the second constraint
forces 𝑦1 to be equal to zero because:
𝑥r + 𝑥s
−𝑥𝑟 − 𝑥𝑠 + 2𝑦1 ≤ 0 ⟹ 𝑦1 ≤ ⟹ 𝑦1 = 0
2
This procedure requires adding an integer variable for every product, and since the time to solve integer
programming problems increases proportionally with the number of integer variables, this procedure was
replaced by another procedure by (F. Glover and E. Woolsey) that was presented in reference [27] which
states the following: Instead of adding an integer variable, a continuous variable is added. The product is
replaced by the continuous variable 𝑥𝑟𝑠 and the following constraints are added:
𝑥𝑟 + 𝑥𝑠 − 𝑥𝑟𝑠 ≤ 1
𝑥𝑟𝑠 ≤ 𝑥𝑟
𝑥𝑟𝑠 ≤ 𝑥𝑠
𝑥𝑟𝑠 ≥ 0
If 𝑥r 𝑜𝑟 𝑥s = 0 𝑜𝑟 𝑥r = 𝑥s = 0 ,the constraints impose that 𝑥𝑟𝑠 be equal to one. What is taken into
account with this procedure is that it adds more constraints than the previous procedure.
The procedure for dealing with the product of two variables can be extended to include the product of any
number of variables, if we take the product 𝑥1 𝑥2 𝑥3 𝑥4 … 𝑥n .
According to the first procedure, we replace the product with the variable 𝑦1 and add the following two
constraints:
𝑛

∑ 𝑥𝑗 − 𝑦1 ≤ 𝑛 − 1
𝑗=1
Converting Some Zero-One Neutrosophic Nonlinear Programming Problems into Zero-One ... 04

− ∑ 𝑥𝑗 − 𝑛𝑦1 ≤ 0
𝑗=1

𝑦1 ∈ {0,1}
𝑥𝑗 ∈ {0,1}

According to the second procedure, we replace the product with the non-negative variable 𝑦0 and add the
following 𝑛 + 1 constraints:
𝑛

∑ 𝑥𝑗 − 𝑦0 ≤ 𝑛 − 1
𝑗=1

𝑦0 ≤ 𝑥𝑗 ; 𝑗 = 1,2, … , 𝑛

2.1 |Example 1
We have the following zero-one neutrosophic nonlinear programming model:
Find:
𝑀𝑎𝑥𝑍 = 𝑐𝑁1 𝑥12 + 𝑐𝑁2 𝑥1 𝑥2 − 𝑐𝑁3 𝑥33
Constraints:
−𝑎𝑁1 𝑥1 + 𝑎𝑁2 𝑥2 + 𝑎𝑁3 𝑥3 ≤ 𝑏𝑁
𝑥1 , 𝑥2 , 𝑥3 ∈ {0,1}
Where: 𝑐𝑁1 , 𝑐𝑁2 , 𝑐𝑁3 , 𝑎𝑁1 , 𝑎𝑁2 , 𝑎𝑁3 , 𝑏𝑁 ,neutrosophic values are taken in proportion to the nature of the issue
under study.
Using the previous study, this zero-one neutrosophic nonlinear model is converting into a zero-one
neutrosophic linear model.
1. Using the following transformations:
a. For 𝑥12 = 𝑥1 and also 𝑥33 = 𝑥3
b. For the product 𝑥2 𝑥3 , we take instead the variable 𝑦1 = 𝑥2 𝑥3 and add the following two constraints:
𝑥2 + 𝑥3 − 𝑦1 ≤ 1
−𝑥2 − 𝑥3 + 2𝑦1 ≤ 0
We obtain the following zero-one neutrosophic linear model:
Find:
𝑀𝑎𝑥𝑍 = 𝑐𝑁1 𝑥1 + 𝑐𝑁2 𝑦1 − 𝑐𝑁3 𝑥3
Constraints:
−𝑎𝑁1 𝑥1 + 𝑎𝑁2 𝑥2 + 𝑎𝑁3 𝑥3 ≤ 𝑏𝑁
𝑥2 + 𝑥3 − 𝑦1 ≤ 1
−𝑥2 − 𝑥3 + 2𝑦1 ≤ 0
𝑥1 , 𝑥2 , 𝑥3 ∈ {0,1}
2. Using the transformation (F. Glover and E. Woolsey):
04 Jadid and smarandache| Neutrosophic Opt. Int. Syst. 1 (2024) 39-45

a. For 𝑥12 = 𝑥1 and also 𝑥33 = 𝑥3

b. We substitute the product 𝑥2 𝑥3 into the continuous variable 𝑥23 and add the constraints:
𝑥2 + 𝑥3 − 𝑥23 ≤ 1
𝑥23 ≤ 𝑥2
𝑥23 ≤ 𝑥3
𝑥23 ≥ 0
We obtain the following zero-one neutrosophic linear model:
Find:
𝑀𝑎𝑥𝑍 = 𝑐𝑁1 𝑥1 + 𝑐𝑁2 𝑥23 − 𝑐𝑁3 𝑥3
Constraints:
−𝑎𝑁1 𝑥1 + 𝑎𝑁2 𝑥2 + 𝑎𝑁3 𝑥3 ≤ 𝑏𝑁
𝑥2 + 𝑥3 − 𝑥23 ≤ 1
𝑥23 ≤ 𝑥2
𝑥23 ≤ 𝑥3
𝑥23 ≥ 0
𝑥1 , 𝑥2 , 𝑥3 ∈ {0,1}

3 | Conclusion and Results

As a continuation of what we presented in previous research of neutrosophic studies on operations research
topics, we presented in this research a neutrosophic study specifically for zero-one programming problems,
which is procedures that we can follow to convert some neutrosophic zero-one nonlinear models into zero-
one neutrosophic linear models., with the aim of taking advantage of the easy-to-apply algorithms that have
been developed by scholars in the field of operations research to obtain the optimal solution for zero-one
linear models. Restricting the decision variables to be either zero or one helps us convert some nonlinear
expressions into linear expressions, and these procedures can be used. In any study that contains binary integer
variables.

Acknowledgments
The author is grateful to the editorial and reviewers, as well as the correspondent author, who offered
assistance in the form of advice, assessment, and checking during the study period.

Author Contributaion
All authors contributed equally to this work.

Funding
This research has no funding source.
Converting Some Zero-One Neutrosophic Nonlinear Programming Problems into Zero-One ... 00

Data Availability
The datasets generated during and/or analyzed during the current study are not publicly available due to the
privacy-preserving nature of the data but are available from the corresponding author upon reasonable
request.

Conflicts of Interest
The authors declare that there is no conflict of interest in the research.

Ethical Approval
This article does not contain any studies with human participants or animals performed by any of the authors.

References
Florentin Smarandache, Maissam Jdid, On Overview of Neutrosophic and Plithogenic Theories and Applications, Doi
:https://doi.org/10.54216/PAMDA.020102
Maissam Jdid, Said Broumi, Neutrosophical Rejection and Acceptance Method for the Generation of Random Variables,
Neutrosophic Sets and Systems, Vol. 56, 2023, pp. 153-166. DOI: 10.5281/zenodo.8194749
Victor Christianto, Robert N. Boyd, Florentin Smarandache, Three possible applications of Neutrosophic Logic in
Fundamental and Applied Sciences, International Journal of Neutrosophic Science, Volume 1, Issue 2, PP: 90-95, 2020
Maissam Jdid, Rafif Alhabib, Neutrosophical dynamic programming, Doi: https://doi.org/10.54216/IJNS.1803013
Maissam Jdid, Studying Transport Models with the Shortest Time According to the Neutrosophic Logic, Neutrosophic Sets
and Systems, Vol. 58, 2023, pp. 631-638. DOI: 10.5281/zenodo.8404545
Broumi S. and Smarandache, F., Correlation coefficient of interval neutrosophic set, Appl. Mech. Mater., 436:511–517,
2013.
Madeleine Al- Tahan, Some Results on Single Valued Neutrosophic (Weak) Polygroups, International Journal of
Neutrosophic Science, Volume 2, Issue 1, PP: 38-46, 2020.
Aslam, M., Khan, N. and AL-Marshadi, A. H. (2019). Design of Variable Sampling Plan for Pareto Distribution Using
Neutrosophic Statistical Interval Method, Symmetry, 11 (1), 80.
Mahmoud Ismail, Ahmed M. Ali, Ahmed Abdelhafeez, Ahmed Abdel-Rahim EI-Douh, Mahmoud Ibrahim and Ayman H.
Abdel-aziem, Neutrosophic Multi-Criteria Decision Making for Sustainable Procurement in Food Business, Neutrosophic
Sets and Systems, Vol. 57, 2023, pp. 283-293. DOI: 10.5281/zenodo.8271435
Maissam Jdid and Nada A. Nabeeh, Generating Random Variables that follow the Beta Distribution Using the Neutrosophic
Acceptance-Rejection Method, Neutrosophic Sets and Systems, Vol. 58, 2023, pp. 139-148. DOI: 10.5281/zenodo.8404445
Maissam Jdid, F. Smarandache, Neutrosophic Static Model without Deficit and Variable Prices, Neutrosophic Sets and
Systems, Vol. 60, 2023, pp. 124-132. DOI: 10.5281/zenodo.10224148
Maissam Jdid, Florentin Smarandache, Finding a Basic Feasible Solution for Neutrosophic Linear Programming Models:
Case Studies, Analysis, and Improvements. DOI: https://doi.org/10.61356/j.nswa.2024.130
Florentin Smarandache, Maissam Jdid, Neutrosophic linear models and algorithms to find their optimal solution, Biblio
Publishing, ISBN, 978_1 _59973_784_3, USA,2024
Maissam Jdid, Florentin Smarandache, An Efficient Optimal Solution Method for Neutrosophic Transport Models: Analysis,
Improvements, and Examples, DOI: https://doi.org/10.61356/j.nswa.2023.111,
Maissam Jdid , Florentin Smarandache, A Study of Systems of Neutrosophic Linear Equations, Doi:
https://doi.org/10.54216/IJNS.230202
https://fs.unm.edu/NeutrosophicOperationsResearch.pdf, Biblio Publishing, Research on the topics of neutrosophic
operations research, Volume (1),2023
Maissam Jdid, Some Important Theories about Duality and the Economic Interpretation of Neutrosophic Linear Models
and Their Dual Models, Doi :https://doi.org/10.54216/PAMDA.020203
Florentin Smarandache, Maissam Jdid, NEUTROSOPHIC TRANSPORT AND ASSIGNMENT ISSUES, Publisher:
Global Knowledge’s: 978_1 _59973_769_0
Maissam Jdid, Florentin Smarandache, The Graphical Method for Finding the Optimal Solution for Neutrosophic linear
Models and Taking Advantage of Non-Negativity Constraints to Find the Optimal Solution for Some Neutrosophic linear
Models in Which the Number of Unknowns is More than Three, Neutrosophic Sets and Systems, Vol. 58, 2023, pp. 68-80.
DOI: 10.5281/zenodo.8404429
Maissam Jdid, Florentin Smarandache, Graphical Method for Solving Neutrosophical Nonlinear Programming Models, DOI:
https://doi.org/10.61356/j.nswa.2023.67
 04 Jadid and smarandache| Neutrosophic Opt. Int. Syst. 1 (2024) 39-45

Maissam Jdid, Florentin Smarandache, The Use of Neutrosophic Methods of Operation Research in the Management of
Corporate,Work, DOI: https://doi.org/10.61356/j.nswa.2023.11
Maissam Jdid, Neutrosophic Mathematical Model of Product Mixture Problem Using Binary Integer Mutant, Doi
:https://doi.org/10.54216/JNFS.060206
Maissam Jdid, Florentin Smarandache, Lagrange Multipliers and Neutrosophic Nonlinear Programming Problems
Constrained by Equality Constraints, DOI: https://doi.org/10.61356/j.nswa.2023.35
Maissam Jdid, Huda E. Khalid, Mysterious Neutrosophic Linear Models, Doi: https://doi.org/10.54216/IJNS.180207
Maissam Jdid, Neutrosophic Nonlinear Models, Doi: https://doi.org/10.54216/PAMDA.020104
Smarandache, F., Introduction to Neutrosophic statistics, Sitech & Education Publishing, 2014.
Bugaha J.S, Mualla.W, and others -Operations Research Translator into Arabic, The Arab Center for Arabization,
Translation, Authoring and Publishing, Damascus,1998. (Arabic version).

View publication stats