SlideShare a Scribd company logo
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
41
An Application of Assignment Problem in Laptop
Selection Problem Using MATLAB
Ghadle Kirtiwant P, Muley Yogesh M
ABSTRACT
The assignment – selection problem used to find one-to- one match of given “Users” to “Laptops”, the
main objective is to minimize the cost as per user requirement. This paper presents satisfactory solution for
real assignment – Laptop selection problem using MATLAB coding.
KEYWORD
Assignment problem, linear integer programming, Revised Ones Assignment Method (ROA), MATLAB
programming
2010 Mathematics Subject Classification: 90-02, 90-08, 90B06, 90B10, 90C05, 90C08, 90C90.
1 INTRODUCTION
Now a day’s laptop is very essential equipment for college, university students as well as
faculties. It is also common to observe that at each home having either laptop or PC. Consider
that an individual want to purchase laptop, but in market various types of product & companies
available, where anyone can be confused. If we want to purchase laptop seller gives us latest high
configured system, which cost approximately between Rs. 45,000 to Rs 90,000. So problem
arises here, if owner is general user and his purpose and requirement are basic then whether he
should purchase given amount laptop? To overcome this problem we defined four categories of
users, and also recommended which laptop he should purchase as per his category and basic
requirement. To solve this laptop selection problem an Assignment Model used.
Assignment Problem (AP) is known as degenerate form of a transportation problem, in AP total
number of assign element is ‘n’. It appears in some decision-making situations. The typical
problems are to assign activities to resources, ‘n’ workers to ‘n’ jobs etc.
Laptop selection problem is in unbalanced form, where four types of users have to choose four
laptops from 21 described laptops (see table 3). To solve this problem ROA method is used
which gives some ones in Assignment matrix and using “Ghadle and Muley rule” will find out
optimal solution. To verify the result MATLAB Program is used which will save calculating time
of problem and give accurate optimal solution within sec.
MATLAB is specially used for matrix, using MATLAB software various matrix operations can
be performed for e.g. matrix addition, subtraction, multiplication, element to element
multiplication, inverse etc and various functions available for solving matrix. In unbalanced
laptop selection problem ROA algorithm is used as program. The time complexity for this
algorithm is less than O (n2
log n). MATLAB programming is stronger and sophisticated than
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
42
1
1
1
Required
1
1
1
nn
C
n2
C
n1
C
2n
C
22
C
21
C
1n
C
12
C
11
C
n
R
2
R
1
R
Resource
Available
n
A
2
A
1
A
Activity
L
M
L
M
O
M
M
L
L
M
L














conventional computer languages (e.g. C, FORTRAN) for solving technical problems. MATLAB
is an interactive system whose basic data element is an array that does not require dimensioning.
2 MATHEMATICAL MODELS FOR ASSIGNMENT PROBLEM
To minimize the overall cost or time, let consider Assignment Problem of ‘n’ resources to ‘n’
activities in such a way that one and only one job should assign to each resources. Where ‫ܥ‬௜௝ is
cost matrix given as,
In Assignment Model, the availability at each of the resources and the requirement at each of the
destinations is unity.
Let x୧୨ – Assign ݅௧௛
resources to ݆௧௛
activity such that,
x୧୨ = ൜
1; if assignment of i୲୦
resources to j୲୦
activity.
0 ; otherwise

Then the mathematical model for assignment problem is,
‫݁ݖ݅݉݊݅݊݅ܯ‬ ‫ݖ‬ = ෍ ෍ ܿ௜௝‫ݔ‬௜௝
௡
௝ୀଵ
௡
௜ୀଵ
(1)
Subject to,
෍ ‫ݔ‬௜௝ = 1 ܽ݊݀ ෍ ‫ݔ‬௜௝ = 1 ∶ ‫ݔ‬௜௝
௡
௝ୀଵ
= 0 ‫ݎ݋‬ 1
௡
௜ୀଵ
(2)
For all i=1, 2, …, n and j= 1,2,…,n.
Preliminaries:
Balance Assignment Problem: In balanced model activities equal resources.
Unbalance Assignment Problem: In an unbalanced model activity does not equal resource.
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
43














nn
C
n2
C
n1
C
2n
C
22
C
21
C
1n
C
12
C
11
C
n
2
1
n
2
1
L
M
O
M
M
L
L
M
L
n
a
2
a
1
a
nn
C
n2
C
n1
C
2n
C
22
C
21
C
1n
C
12
C
11
C
n
2
1
M
L
M
O
M
M
L
L
L














n
b
2
b
1
b
n
a
nn
C
n
a
n2
C
n
a
n1
C
2
a
2n
C
2
a
22
C
2
a
21
C
1
a
1n
C
1
a
12
C
1
a
11
C
n
2
1
n
2
1
L
L
M
O
M
M
L
L
M
L














3 Revised Ones Assignment Method (ROA) for Assignment Problem. [1, 3]
In ROA method, by dividing minimum element from each row and column to corresponding
rows and column we get at least one value in each rows and columns. Then find complete
assignment in terms of ones.
Now, in assignment matrix ‫ܥ‬௜௝ is the cost or effectiveness of assigning ݅௧௛
machine.
The new algorithm is as follows.
Let (1-2) be an assignment problem in which the objective function can be minimized or
maximized.
Step 1
In a minimization case, find the minimum element of each row (say ai) and write it on the right
hand side of the matrix.
After dividing each element of ith
row of the matrix by ai. We get at least one ones in each rows.
In term of one for each row and one for each column, do assignment. Otherwise go to step 2.
Step 2
Find the minimum element of each column (say bj), and write it below jth
column, by dividing
each element of jth
column of the matrix by bj. We get at least one ones in each columns. This
gives assignment matrix in terms of ones. If no feasible assignment can be achieved from step (1)
and (2) then go to step 3.
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
44
Note: In a maximization case, the end of step 2 we have a fuzzy matrix. Which all elements are
belong to [0, 1], and the greatest is one [2].
Step 3
To find optimality test draw the minimum number of lines which cover all the ones in the
Assignment matrix. If the numbers of drawn lines are less than ‘n’, then optimality condition fails
i.e. complete assignment is not possible. While optimality condition satisfied, if the number of
lines is exactly equal to ‘n’, then the complete assignment is possible.
Step 4
If optimality condition fails in step 3, then select the smallest element (say dij) out of those which
do not lie on any of the lines in the above matrix. By dividing smallest element dij to each element
of the uncovered rows or columns. This gives some new ones to this row or column.
If still optimality condition fails in this new matrix, then use step 4 and 3 iteratively. By repeating
the same procedure the optimal assignment will be obtained.
(To assign one Ghadle and Muley Rule is used, which is mentioned below.)
Step 5 (Ghadle and Muley Rule to assign one in Assignment Matrix)
i) For minimization problem select max value from calculated matrix and write it on right
hand side as well as bottom side.
• To assign one, start from min value of columns (mentioned at bottom side) and select
ones.
• If there are more than one ones in any column then ignore temporarily, and give last
priority to that column.
• If still there are identical ones in column then give the priority to max value of rows
(mentioned at right hand side).
Or Vice – Versa.
Remarks: In Unbalanced Assignment Problem, if there are more than one ones in any row then
give priority to first element.
Priority rule
To solve Unbalanced Assignment Problem (non square matrix), we convert it into Balanced
Assignment Matrix form by adding artificial row or column, which having all elements one.
Hence we can solve the problem using ROA method. After performing the steps reduces to a
matrix which has ones in each rows and columns. So, the optimal assignment has been reached.
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
45
4 APPLICATIONS:
Now a day various techniques have been used to attract candidates in colleges and universities for
admission. Let consider that a college management decide to give the laptops to admitted students
as per their requirements and courses. To reduce laptop purchase cost we have select laptop as per
courses and there requirement, for laptop configuration we divide users into four categories, like
General users, Professionals, Programmers, Engineers.
Requirements of Users:
As per our observations we conclude following
1. General Users:
• Like science, commerce, and arts student, used laptop for preparing notes, presentation
and also using some software like Ms-office, Tally, DTP etc. for that sufficient
configuration is : asus/ dual core processor, 1 or 2 GB RAM, 500 GB HDD, 512 GD (for
high graphics, like games).
2. Professional Users:
• Like MBA (all courses), ICWA, CA, used laptop for accounting, presentation and also
using some software like Ms-office, Tally, SAP and some online software which required
high configuration than General users. For that sufficient configuration is: dual core
processor, 1 or 2 GB RAM, 500 GB HDD.
3. Programmers:
• Like MCA, MCS, M.E / B.E (Computer) used laptop for programming, making
software’s. Generally they used software like C- programming, VB, VB.net, Oracle, Java,
SAP etc. which required high configuration than Professional users. For that sufficient
configuration is: core i3 processor, 2 or 4 GB RAM, 500 GB HDD, 1GB GD (for high
graphics).
4. Engineers:
• Like Mechanical, Electrical, Civil etc. used laptop for graphics design. Generally they
used software like Auto Cad, UG, PRO –E, CATIA which required higher graphics
resolution. For that sufficient configuration is: Core i5 or i7 processor, 4 or 8 GB RAM,
500 GB HDD, 1 or 2 GB GD (for high graphics).
To overcome this situation there are several credit points under consideration, firstly consider the
competencies necessary to develop the users. Obviously some competencies like processor, RAM
having more importance and some competencies like HDD, Screen size, Graphics Card having
less important compare to first one. Moreover, usually the users are not independent; therefore a
relationship among them could appear. Finally, all particular with credit points are shown in table
1 as per their necessary requirements.
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
46
Particulars Credit Points
Essential 5
Fairly High 4
High 3
Moderate 2
Low 1
Fairly Low 0
Table 1
Processor
Particulars Users General Professionals Programmers Engineers
Dual Core 5 5 0 0
Core i3 0 4 5 0
Core i5 0 0 4 5
Core i7 0 0 0 4
Asus Brazo 5 0 0 0
Asus Intel Dual Core 4 5 0 0
Asus Core i3 0 4 5 0
Asus Core i5 0 0 4 5
RAM
2 GB 3 3 3 0
4 GB 0 2 2 3
8 GB 0 0 0 2
HDD
500 GB 3 3 3 3
1 TB 0 0 2 2
Screen 15.6 3 3 3 3
Graphics
Card
512 MB 3 2 3 0
1 GB 0 0 2 3
2 GB 0 0 0 2
Once the users involved in the selection procedure have been determined, the laptops must next to be
considered. Let it be imagined that there are 21 laptops (see table 3) that might be able to select for
different Users.
Laptops Name
Laptop1 L1
Laptop2 L2
..
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
47
Laptop21 L21
For each one it is necessary to find out by some appropriate, means the levels in each of the particular
required for the users. Finally as there are links between the users and laptops (using table1 credit
points in table 3) must be looked at in order to find out the relationships that there would be among
them, as shown in table 2.
Table 2
Unbalanced Assignment Problem is solved by using ROA method and MATLAB Programming
(See Appendix 1). This gives final optimal solution as:
Users Laptop
General L1
Professionals L2
Programmers L9
Engineers L15
5 CONCLUSIONS:
To select appropriate laptops as per user’s requirement and basic needs. The given problem
converted into Assignment Model. The given information in table 3 is converted into numerical
by using credit points given in table 1, to solve this realistic problem ROA method is used and at
last it verified by MATLAB program which gives optimal solution within 0.005256 sec.
6 REFERENCES
[1] Hadi Basirzadeh. “Ones Assignment Method for solving Assignment Problems”, Applied
Mathematical Sciences, Vol 6 (2012), No. 47, pp. 2345-2355.
[2] Francisco Herrera, Enrique López, Cristina Mendaña, Miguel A. Rodríguez. “Solving an assignment
– selection problem with verbal information and using genetic algorithms”, European Journal of
Operation Research, 119 (1999), pp. 326-337.
[3] Ghadle Kirtiwant P, Muley Yogesh M (2013), “Revised Ones Assignment Method for Solving
Assignment Problem”, Journal of Statistics and Mathematics, Volume 4, Issue 1 (2013), pp. 147-150.
Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015
48
Table 3: (shows various types of laptops with specifications and cost)
Appendix 1:
% MATLAB PROGRAM FOR ASSIGNMENT - LAPTOP SELECTION PROBLEM.
% DEVELOPED BY : Dr. Kirtiwant Ghadle , Mr. Yogesh Muley
clc
tic;
x= [17 14 14 9 9 3 6 9 9 6 6 9 6 6 6 6 6 6 3 3 3
11 14 14 13 13 10 12 9 13 12 12 13 12 8 8 12 8 8 5 5 6
12 9 9 14 14 13 13 13 16 15 15 14 13 12 14 15 12 14 13 11 5
6 6 6 6 6 5 9 11 9 12 12 6 11 14 17 12 16 17 16 15 13 ]
% matrix x is copied in xnv and x1 variable
xnv=x;
x1=x;
% calculating each row minimum no.
maxr= nnmaxr(x)
% find row and column no
[r c]=size(x)
% dividing each element of row
49
for i=1:r
for j=1:c
x(i,j)=x(i,j)/maxr(i);
end
end
x
y=x;
for i=1:r
for j=1:c
if x(i,j)1
x(i,j)=0;
end
end
end
x
l=1;
for i=1:r
for j=1:c
[xr xc]= find(x==l,'1');
k1=length(xr);
for m=1:k1
x(xr(m),xc(m))=1;
if x(xr(m),j)~= x(xr(m),xc(m))
x(xr(m),j)=0;
end
end
end
end
x;
z=xnv.*x
toc;
Dr. Kirtiwant P Ghadle
Department of Mathematics,
Dr. Babasaheb Ambedkar Marathwada University,
Aurangabad -431004.
drkp.ghadle@gmail.com
Mr. Yogesh M Muley
Department of Mathematics,
Dr. Babasaheb Ambedkar Marathwada University,
Aurangabad -431004.
yogesh.m.muley@gmail.com

More Related Content

Similar to An Application of Assignment Problem in Laptop Selection Problem Using MATLAB

LPP.pptx
LPP.pptxLPP.pptx
A tour of the top 10 algorithms for machine learning newbies
A tour of the top 10 algorithms for machine learning newbiesA tour of the top 10 algorithms for machine learning newbies
A tour of the top 10 algorithms for machine learning newbies
Vimal Gupta
 
Notion of an algorithm
Notion of an algorithmNotion of an algorithm
Notion of an algorithm
Nisha Soms
 
Ac4103169172
Ac4103169172Ac4103169172
Ac4103169172
IJERA Editor
 
chapter 1
chapter 1chapter 1
chapter 1
yatheesha
 
AMAZON STOCK PRICE PREDICTION BY USING SMLT
AMAZON STOCK PRICE PREDICTION BY USING SMLTAMAZON STOCK PRICE PREDICTION BY USING SMLT
AMAZON STOCK PRICE PREDICTION BY USING SMLT
IRJET Journal
 
Data structures & problem solving unit 1 ppt
Data structures & problem solving unit 1 pptData structures & problem solving unit 1 ppt
Data structures & problem solving unit 1 ppt
aviban
 
An Implementational approach to genetic algorithms for TSP
An Implementational approach to genetic algorithms for TSPAn Implementational approach to genetic algorithms for TSP
An Implementational approach to genetic algorithms for TSPSougata Das
 
Recognition of Handwritten Mathematical Equations
Recognition of  Handwritten Mathematical EquationsRecognition of  Handwritten Mathematical Equations
Recognition of Handwritten Mathematical Equations
IRJET Journal
 
Solving ONE’S interval linear assignment problem
Solving ONE’S interval linear assignment problemSolving ONE’S interval linear assignment problem
Solving ONE’S interval linear assignment problem
IJERA Editor
 
IMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHES
IMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHESIMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHES
IMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHES
Vikash Kumar
 
A brief study on linear programming solving methods
A brief study on linear programming solving methodsA brief study on linear programming solving methods
A brief study on linear programming solving methods
MayurjyotiNeog
 
Teaching Mathematics Concepts via Computer Algebra Systems
Teaching Mathematics Concepts via Computer Algebra SystemsTeaching Mathematics Concepts via Computer Algebra Systems
Teaching Mathematics Concepts via Computer Algebra Systems
inventionjournals
 
Data Structures - Lecture 1 [introduction]
Data Structures - Lecture 1 [introduction]Data Structures - Lecture 1 [introduction]
Data Structures - Lecture 1 [introduction]
Muhammad Hammad Waseem
 
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
gerogepatton
 
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
ijaia
 
Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...
Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...
Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...
ijtsrd
 
complexity analysis.pdf
complexity analysis.pdfcomplexity analysis.pdf
complexity analysis.pdf
pasinduneshan
 
AMA_Assignment Theory notes
AMA_Assignment Theory notesAMA_Assignment Theory notes
AMA_Assignment Theory notes
CA Niraj Thapa
 

Similar to An Application of Assignment Problem in Laptop Selection Problem Using MATLAB (20)

LPP.pptx
LPP.pptxLPP.pptx
LPP.pptx
 
A tour of the top 10 algorithms for machine learning newbies
A tour of the top 10 algorithms for machine learning newbiesA tour of the top 10 algorithms for machine learning newbies
A tour of the top 10 algorithms for machine learning newbies
 
Notion of an algorithm
Notion of an algorithmNotion of an algorithm
Notion of an algorithm
 
Ac4103169172
Ac4103169172Ac4103169172
Ac4103169172
 
chapter 1
chapter 1chapter 1
chapter 1
 
AMAZON STOCK PRICE PREDICTION BY USING SMLT
AMAZON STOCK PRICE PREDICTION BY USING SMLTAMAZON STOCK PRICE PREDICTION BY USING SMLT
AMAZON STOCK PRICE PREDICTION BY USING SMLT
 
Data structures & problem solving unit 1 ppt
Data structures & problem solving unit 1 pptData structures & problem solving unit 1 ppt
Data structures & problem solving unit 1 ppt
 
An Implementational approach to genetic algorithms for TSP
An Implementational approach to genetic algorithms for TSPAn Implementational approach to genetic algorithms for TSP
An Implementational approach to genetic algorithms for TSP
 
Recognition of Handwritten Mathematical Equations
Recognition of  Handwritten Mathematical EquationsRecognition of  Handwritten Mathematical Equations
Recognition of Handwritten Mathematical Equations
 
Solving ONE’S interval linear assignment problem
Solving ONE’S interval linear assignment problemSolving ONE’S interval linear assignment problem
Solving ONE’S interval linear assignment problem
 
IMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHES
IMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHESIMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHES
IMAGE CLASSIFICATION USING DIFFERENT CLASSICAL APPROACHES
 
A brief study on linear programming solving methods
A brief study on linear programming solving methodsA brief study on linear programming solving methods
A brief study on linear programming solving methods
 
presentationIDC - 14MAY2015
presentationIDC - 14MAY2015presentationIDC - 14MAY2015
presentationIDC - 14MAY2015
 
Teaching Mathematics Concepts via Computer Algebra Systems
Teaching Mathematics Concepts via Computer Algebra SystemsTeaching Mathematics Concepts via Computer Algebra Systems
Teaching Mathematics Concepts via Computer Algebra Systems
 
Data Structures - Lecture 1 [introduction]
Data Structures - Lecture 1 [introduction]Data Structures - Lecture 1 [introduction]
Data Structures - Lecture 1 [introduction]
 
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
 
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
A BI-OBJECTIVE MODEL FOR SVM WITH AN INTERACTIVE PROCEDURE TO IDENTIFY THE BE...
 
Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...
Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...
Mobile Phone Selection Problem Solved by an Unbalanced Assignment Model by us...
 
complexity analysis.pdf
complexity analysis.pdfcomplexity analysis.pdf
complexity analysis.pdf
 
AMA_Assignment Theory notes
AMA_Assignment Theory notesAMA_Assignment Theory notes
AMA_Assignment Theory notes
 

More from mathsjournal

OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
mathsjournal
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
mathsjournal
 
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
mathsjournal
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
mathsjournal
 
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
mathsjournal
 
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
mathsjournal
 
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
mathsjournal
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
mathsjournal
 
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
mathsjournal
 
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
mathsjournal
 
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
mathsjournal
 
A Study on L-Fuzzy Normal Subl-GROUP
A Study on L-Fuzzy Normal Subl-GROUPA Study on L-Fuzzy Normal Subl-GROUP
A Study on L-Fuzzy Normal Subl-GROUP
mathsjournal
 
ON β-Normal Spaces
ON β-Normal SpacesON β-Normal Spaces
ON β-Normal Spaces
mathsjournal
 
Cubic Response Surface Designs Using Bibd in Four Dimensions
Cubic Response Surface Designs Using Bibd in Four DimensionsCubic Response Surface Designs Using Bibd in Four Dimensions
Cubic Response Surface Designs Using Bibd in Four Dimensions
mathsjournal
 
Quantum Variation about Geodesics
Quantum Variation about GeodesicsQuantum Variation about Geodesics
Quantum Variation about Geodesics
mathsjournal
 
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
mathsjournal
 
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
mathsjournal
 
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
mathsjournal
 
Table of Contents - September 2022, Volume 9, Number 2/3
Table of Contents - September 2022, Volume 9, Number 2/3Table of Contents - September 2022, Volume 9, Number 2/3
Table of Contents - September 2022, Volume 9, Number 2/3
mathsjournal
 
Code of the multidimensional fractional pseudo-Newton method using recursive ...
Code of the multidimensional fractional pseudo-Newton method using recursive ...Code of the multidimensional fractional pseudo-Newton method using recursive ...
Code of the multidimensional fractional pseudo-Newton method using recursive ...
mathsjournal
 

More from mathsjournal (20)

OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
 
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
 
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
 
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
 
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...
 
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...
 
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...
 
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...
 
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...
 
A Study on L-Fuzzy Normal Subl-GROUP
A Study on L-Fuzzy Normal Subl-GROUPA Study on L-Fuzzy Normal Subl-GROUP
A Study on L-Fuzzy Normal Subl-GROUP
 
ON β-Normal Spaces
ON β-Normal SpacesON β-Normal Spaces
ON β-Normal Spaces
 
Cubic Response Surface Designs Using Bibd in Four Dimensions
Cubic Response Surface Designs Using Bibd in Four DimensionsCubic Response Surface Designs Using Bibd in Four Dimensions
Cubic Response Surface Designs Using Bibd in Four Dimensions
 
Quantum Variation about Geodesics
Quantum Variation about GeodesicsQuantum Variation about Geodesics
Quantum Variation about Geodesics
 
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...
 
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
 
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...
 
Table of Contents - September 2022, Volume 9, Number 2/3
Table of Contents - September 2022, Volume 9, Number 2/3Table of Contents - September 2022, Volume 9, Number 2/3
Table of Contents - September 2022, Volume 9, Number 2/3
 
Code of the multidimensional fractional pseudo-Newton method using recursive ...
Code of the multidimensional fractional pseudo-Newton method using recursive ...Code of the multidimensional fractional pseudo-Newton method using recursive ...
Code of the multidimensional fractional pseudo-Newton method using recursive ...
 

Recently uploaded

Hemostasis_importance& clinical significance.pptx
Hemostasis_importance& clinical significance.pptxHemostasis_importance& clinical significance.pptx
Hemostasis_importance& clinical significance.pptx
muralinath2
 
Chapter 12 - climate change and the energy crisis
Chapter 12 - climate change and the energy crisisChapter 12 - climate change and the energy crisis
Chapter 12 - climate change and the energy crisis
tonzsalvador2222
 
Lateral Ventricles.pdf very easy good diagrams comprehensive
Lateral Ventricles.pdf very easy good diagrams comprehensiveLateral Ventricles.pdf very easy good diagrams comprehensive
Lateral Ventricles.pdf very easy good diagrams comprehensive
silvermistyshot
 
原版制作(carleton毕业证书)卡尔顿大学毕业证硕士文凭原版一模一样
原版制作(carleton毕业证书)卡尔顿大学毕业证硕士文凭原版一模一样原版制作(carleton毕业证书)卡尔顿大学毕业证硕士文凭原版一模一样
原版制作(carleton毕业证书)卡尔顿大学毕业证硕士文凭原版一模一样
yqqaatn0
 
bordetella pertussis.................................ppt
bordetella pertussis.................................pptbordetella pertussis.................................ppt
bordetella pertussis.................................ppt
kejapriya1
 
Seminar of U.V. Spectroscopy by SAMIR PANDA
 Seminar of U.V. Spectroscopy by SAMIR PANDA Seminar of U.V. Spectroscopy by SAMIR PANDA
Seminar of U.V. Spectroscopy by SAMIR PANDA
SAMIR PANDA
 
in vitro propagation of plants lecture note.pptx
in vitro propagation of plants lecture note.pptxin vitro propagation of plants lecture note.pptx
in vitro propagation of plants lecture note.pptx
yusufzako14
 
THE IMPORTANCE OF MARTIAN ATMOSPHERE SAMPLE RETURN.
THE IMPORTANCE OF MARTIAN ATMOSPHERE SAMPLE RETURN.THE IMPORTANCE OF MARTIAN ATMOSPHERE SAMPLE RETURN.
THE IMPORTANCE OF MARTIAN ATMOSPHERE SAMPLE RETURN.
Sérgio Sacani
 
BLOOD AND BLOOD COMPONENT- introduction to blood physiology
BLOOD AND BLOOD COMPONENT- introduction to blood physiologyBLOOD AND BLOOD COMPONENT- introduction to blood physiology
BLOOD AND BLOOD COMPONENT- introduction to blood physiology
NoelManyise1
 
S.1 chemistry scheme term 2 for ordinary level
S.1 chemistry scheme term 2 for ordinary levelS.1 chemistry scheme term 2 for ordinary level
S.1 chemistry scheme term 2 for ordinary level
ronaldlakony0
 
Nucleic Acid-its structural and functional complexity.
Nucleic Acid-its structural and functional complexity.Nucleic Acid-its structural and functional complexity.
Nucleic Acid-its structural and functional complexity.
Nistarini College, Purulia (W.B) India
 
In silico drugs analogue design: novobiocin analogues.pptx
In silico drugs analogue design: novobiocin analogues.pptxIn silico drugs analogue design: novobiocin analogues.pptx
In silico drugs analogue design: novobiocin analogues.pptx
AlaminAfendy1
 
Orion Air Quality Monitoring Systems - CWS
Orion Air Quality Monitoring Systems - CWSOrion Air Quality Monitoring Systems - CWS
Orion Air Quality Monitoring Systems - CWS
Columbia Weather Systems
 
Nutraceutical market, scope and growth: Herbal drug technology
Nutraceutical market, scope and growth: Herbal drug technologyNutraceutical market, scope and growth: Herbal drug technology
Nutraceutical market, scope and growth: Herbal drug technology
Lokesh Patil
 
nodule formation by alisha dewangan.pptx
nodule formation by alisha dewangan.pptxnodule formation by alisha dewangan.pptx
nodule formation by alisha dewangan.pptx
alishadewangan1
 
如何办理(uvic毕业证书)维多利亚大学毕业证本科学位证书原版一模一样
如何办理(uvic毕业证书)维多利亚大学毕业证本科学位证书原版一模一样如何办理(uvic毕业证书)维多利亚大学毕业证本科学位证书原版一模一样
如何办理(uvic毕业证书)维多利亚大学毕业证本科学位证书原版一模一样
yqqaatn0
 
DMARDs Pharmacolgy Pharm D 5th Semester.pdf
DMARDs Pharmacolgy Pharm D 5th Semester.pdfDMARDs Pharmacolgy Pharm D 5th Semester.pdf
DMARDs Pharmacolgy Pharm D 5th Semester.pdf
fafyfskhan251kmf
 
Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...
Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...
Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...
Sérgio Sacani
 
Unveiling the Energy Potential of Marshmallow Deposits.pdf
Unveiling the Energy Potential of Marshmallow Deposits.pdfUnveiling the Energy Potential of Marshmallow Deposits.pdf
Unveiling the Energy Potential of Marshmallow Deposits.pdf
Erdal Coalmaker
 
GBSN - Biochemistry (Unit 5) Chemistry of Lipids
GBSN - Biochemistry (Unit 5) Chemistry of LipidsGBSN - Biochemistry (Unit 5) Chemistry of Lipids
GBSN - Biochemistry (Unit 5) Chemistry of Lipids
Areesha Ahmad
 

Recently uploaded (20)

Hemostasis_importance& clinical significance.pptx
Hemostasis_importance& clinical significance.pptxHemostasis_importance& clinical significance.pptx
Hemostasis_importance& clinical significance.pptx
 
Chapter 12 - climate change and the energy crisis
Chapter 12 - climate change and the energy crisisChapter 12 - climate change and the energy crisis
Chapter 12 - climate change and the energy crisis
 
Lateral Ventricles.pdf very easy good diagrams comprehensive
Lateral Ventricles.pdf very easy good diagrams comprehensiveLateral Ventricles.pdf very easy good diagrams comprehensive
Lateral Ventricles.pdf very easy good diagrams comprehensive
 
原版制作(carleton毕业证书)卡尔顿大学毕业证硕士文凭原版一模一样
原版制作(carleton毕业证书)卡尔顿大学毕业证硕士文凭原版一模一样原版制作(carleton毕业证书)卡尔顿大学毕业证硕士文凭原版一模一样
原版制作(carleton毕业证书)卡尔顿大学毕业证硕士文凭原版一模一样
 
bordetella pertussis.................................ppt
bordetella pertussis.................................pptbordetella pertussis.................................ppt
bordetella pertussis.................................ppt
 
Seminar of U.V. Spectroscopy by SAMIR PANDA
 Seminar of U.V. Spectroscopy by SAMIR PANDA Seminar of U.V. Spectroscopy by SAMIR PANDA
Seminar of U.V. Spectroscopy by SAMIR PANDA
 
in vitro propagation of plants lecture note.pptx
in vitro propagation of plants lecture note.pptxin vitro propagation of plants lecture note.pptx
in vitro propagation of plants lecture note.pptx
 
THE IMPORTANCE OF MARTIAN ATMOSPHERE SAMPLE RETURN.
THE IMPORTANCE OF MARTIAN ATMOSPHERE SAMPLE RETURN.THE IMPORTANCE OF MARTIAN ATMOSPHERE SAMPLE RETURN.
THE IMPORTANCE OF MARTIAN ATMOSPHERE SAMPLE RETURN.
 
BLOOD AND BLOOD COMPONENT- introduction to blood physiology
BLOOD AND BLOOD COMPONENT- introduction to blood physiologyBLOOD AND BLOOD COMPONENT- introduction to blood physiology
BLOOD AND BLOOD COMPONENT- introduction to blood physiology
 
S.1 chemistry scheme term 2 for ordinary level
S.1 chemistry scheme term 2 for ordinary levelS.1 chemistry scheme term 2 for ordinary level
S.1 chemistry scheme term 2 for ordinary level
 
Nucleic Acid-its structural and functional complexity.
Nucleic Acid-its structural and functional complexity.Nucleic Acid-its structural and functional complexity.
Nucleic Acid-its structural and functional complexity.
 
In silico drugs analogue design: novobiocin analogues.pptx
In silico drugs analogue design: novobiocin analogues.pptxIn silico drugs analogue design: novobiocin analogues.pptx
In silico drugs analogue design: novobiocin analogues.pptx
 
Orion Air Quality Monitoring Systems - CWS
Orion Air Quality Monitoring Systems - CWSOrion Air Quality Monitoring Systems - CWS
Orion Air Quality Monitoring Systems - CWS
 
Nutraceutical market, scope and growth: Herbal drug technology
Nutraceutical market, scope and growth: Herbal drug technologyNutraceutical market, scope and growth: Herbal drug technology
Nutraceutical market, scope and growth: Herbal drug technology
 
nodule formation by alisha dewangan.pptx
nodule formation by alisha dewangan.pptxnodule formation by alisha dewangan.pptx
nodule formation by alisha dewangan.pptx
 
如何办理(uvic毕业证书)维多利亚大学毕业证本科学位证书原版一模一样
如何办理(uvic毕业证书)维多利亚大学毕业证本科学位证书原版一模一样如何办理(uvic毕业证书)维多利亚大学毕业证本科学位证书原版一模一样
如何办理(uvic毕业证书)维多利亚大学毕业证本科学位证书原版一模一样
 
DMARDs Pharmacolgy Pharm D 5th Semester.pdf
DMARDs Pharmacolgy Pharm D 5th Semester.pdfDMARDs Pharmacolgy Pharm D 5th Semester.pdf
DMARDs Pharmacolgy Pharm D 5th Semester.pdf
 
Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...
Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...
Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...
 
Unveiling the Energy Potential of Marshmallow Deposits.pdf
Unveiling the Energy Potential of Marshmallow Deposits.pdfUnveiling the Energy Potential of Marshmallow Deposits.pdf
Unveiling the Energy Potential of Marshmallow Deposits.pdf
 
GBSN - Biochemistry (Unit 5) Chemistry of Lipids
GBSN - Biochemistry (Unit 5) Chemistry of LipidsGBSN - Biochemistry (Unit 5) Chemistry of Lipids
GBSN - Biochemistry (Unit 5) Chemistry of Lipids
 

An Application of Assignment Problem in Laptop Selection Problem Using MATLAB

  • 1. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015 41 An Application of Assignment Problem in Laptop Selection Problem Using MATLAB Ghadle Kirtiwant P, Muley Yogesh M ABSTRACT The assignment – selection problem used to find one-to- one match of given “Users” to “Laptops”, the main objective is to minimize the cost as per user requirement. This paper presents satisfactory solution for real assignment – Laptop selection problem using MATLAB coding. KEYWORD Assignment problem, linear integer programming, Revised Ones Assignment Method (ROA), MATLAB programming 2010 Mathematics Subject Classification: 90-02, 90-08, 90B06, 90B10, 90C05, 90C08, 90C90. 1 INTRODUCTION Now a day’s laptop is very essential equipment for college, university students as well as faculties. It is also common to observe that at each home having either laptop or PC. Consider that an individual want to purchase laptop, but in market various types of product & companies available, where anyone can be confused. If we want to purchase laptop seller gives us latest high configured system, which cost approximately between Rs. 45,000 to Rs 90,000. So problem arises here, if owner is general user and his purpose and requirement are basic then whether he should purchase given amount laptop? To overcome this problem we defined four categories of users, and also recommended which laptop he should purchase as per his category and basic requirement. To solve this laptop selection problem an Assignment Model used. Assignment Problem (AP) is known as degenerate form of a transportation problem, in AP total number of assign element is ‘n’. It appears in some decision-making situations. The typical problems are to assign activities to resources, ‘n’ workers to ‘n’ jobs etc. Laptop selection problem is in unbalanced form, where four types of users have to choose four laptops from 21 described laptops (see table 3). To solve this problem ROA method is used which gives some ones in Assignment matrix and using “Ghadle and Muley rule” will find out optimal solution. To verify the result MATLAB Program is used which will save calculating time of problem and give accurate optimal solution within sec. MATLAB is specially used for matrix, using MATLAB software various matrix operations can be performed for e.g. matrix addition, subtraction, multiplication, element to element multiplication, inverse etc and various functions available for solving matrix. In unbalanced laptop selection problem ROA algorithm is used as program. The time complexity for this algorithm is less than O (n2 log n). MATLAB programming is stronger and sophisticated than
  • 2. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015 42 1 1 1 Required 1 1 1 nn C n2 C n1 C 2n C 22 C 21 C 1n C 12 C 11 C n R 2 R 1 R Resource Available n A 2 A 1 A Activity L M L M O M M L L M L               conventional computer languages (e.g. C, FORTRAN) for solving technical problems. MATLAB is an interactive system whose basic data element is an array that does not require dimensioning. 2 MATHEMATICAL MODELS FOR ASSIGNMENT PROBLEM To minimize the overall cost or time, let consider Assignment Problem of ‘n’ resources to ‘n’ activities in such a way that one and only one job should assign to each resources. Where ‫ܥ‬௜௝ is cost matrix given as, In Assignment Model, the availability at each of the resources and the requirement at each of the destinations is unity. Let x୧୨ – Assign ݅௧௛ resources to ݆௧௛ activity such that, x୧୨ = ൜ 1; if assignment of i୲୦ resources to j୲୦ activity. 0 ; otherwise Then the mathematical model for assignment problem is, ‫݁ݖ݅݉݊݅݊݅ܯ‬ ‫ݖ‬ = ෍ ෍ ܿ௜௝‫ݔ‬௜௝ ௡ ௝ୀଵ ௡ ௜ୀଵ (1) Subject to, ෍ ‫ݔ‬௜௝ = 1 ܽ݊݀ ෍ ‫ݔ‬௜௝ = 1 ∶ ‫ݔ‬௜௝ ௡ ௝ୀଵ = 0 ‫ݎ݋‬ 1 ௡ ௜ୀଵ (2) For all i=1, 2, …, n and j= 1,2,…,n. Preliminaries: Balance Assignment Problem: In balanced model activities equal resources. Unbalance Assignment Problem: In an unbalanced model activity does not equal resource.
  • 3. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015 43               nn C n2 C n1 C 2n C 22 C 21 C 1n C 12 C 11 C n 2 1 n 2 1 L M O M M L L M L n a 2 a 1 a nn C n2 C n1 C 2n C 22 C 21 C 1n C 12 C 11 C n 2 1 M L M O M M L L L               n b 2 b 1 b n a nn C n a n2 C n a n1 C 2 a 2n C 2 a 22 C 2 a 21 C 1 a 1n C 1 a 12 C 1 a 11 C n 2 1 n 2 1 L L M O M M L L M L               3 Revised Ones Assignment Method (ROA) for Assignment Problem. [1, 3] In ROA method, by dividing minimum element from each row and column to corresponding rows and column we get at least one value in each rows and columns. Then find complete assignment in terms of ones. Now, in assignment matrix ‫ܥ‬௜௝ is the cost or effectiveness of assigning ݅௧௛ machine. The new algorithm is as follows. Let (1-2) be an assignment problem in which the objective function can be minimized or maximized. Step 1 In a minimization case, find the minimum element of each row (say ai) and write it on the right hand side of the matrix. After dividing each element of ith row of the matrix by ai. We get at least one ones in each rows. In term of one for each row and one for each column, do assignment. Otherwise go to step 2. Step 2 Find the minimum element of each column (say bj), and write it below jth column, by dividing each element of jth column of the matrix by bj. We get at least one ones in each columns. This gives assignment matrix in terms of ones. If no feasible assignment can be achieved from step (1) and (2) then go to step 3.
  • 4. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015 44 Note: In a maximization case, the end of step 2 we have a fuzzy matrix. Which all elements are belong to [0, 1], and the greatest is one [2]. Step 3 To find optimality test draw the minimum number of lines which cover all the ones in the Assignment matrix. If the numbers of drawn lines are less than ‘n’, then optimality condition fails i.e. complete assignment is not possible. While optimality condition satisfied, if the number of lines is exactly equal to ‘n’, then the complete assignment is possible. Step 4 If optimality condition fails in step 3, then select the smallest element (say dij) out of those which do not lie on any of the lines in the above matrix. By dividing smallest element dij to each element of the uncovered rows or columns. This gives some new ones to this row or column. If still optimality condition fails in this new matrix, then use step 4 and 3 iteratively. By repeating the same procedure the optimal assignment will be obtained. (To assign one Ghadle and Muley Rule is used, which is mentioned below.) Step 5 (Ghadle and Muley Rule to assign one in Assignment Matrix) i) For minimization problem select max value from calculated matrix and write it on right hand side as well as bottom side. • To assign one, start from min value of columns (mentioned at bottom side) and select ones. • If there are more than one ones in any column then ignore temporarily, and give last priority to that column. • If still there are identical ones in column then give the priority to max value of rows (mentioned at right hand side). Or Vice – Versa. Remarks: In Unbalanced Assignment Problem, if there are more than one ones in any row then give priority to first element. Priority rule To solve Unbalanced Assignment Problem (non square matrix), we convert it into Balanced Assignment Matrix form by adding artificial row or column, which having all elements one. Hence we can solve the problem using ROA method. After performing the steps reduces to a matrix which has ones in each rows and columns. So, the optimal assignment has been reached.
  • 5. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015 45 4 APPLICATIONS: Now a day various techniques have been used to attract candidates in colleges and universities for admission. Let consider that a college management decide to give the laptops to admitted students as per their requirements and courses. To reduce laptop purchase cost we have select laptop as per courses and there requirement, for laptop configuration we divide users into four categories, like General users, Professionals, Programmers, Engineers. Requirements of Users: As per our observations we conclude following 1. General Users: • Like science, commerce, and arts student, used laptop for preparing notes, presentation and also using some software like Ms-office, Tally, DTP etc. for that sufficient configuration is : asus/ dual core processor, 1 or 2 GB RAM, 500 GB HDD, 512 GD (for high graphics, like games). 2. Professional Users: • Like MBA (all courses), ICWA, CA, used laptop for accounting, presentation and also using some software like Ms-office, Tally, SAP and some online software which required high configuration than General users. For that sufficient configuration is: dual core processor, 1 or 2 GB RAM, 500 GB HDD. 3. Programmers: • Like MCA, MCS, M.E / B.E (Computer) used laptop for programming, making software’s. Generally they used software like C- programming, VB, VB.net, Oracle, Java, SAP etc. which required high configuration than Professional users. For that sufficient configuration is: core i3 processor, 2 or 4 GB RAM, 500 GB HDD, 1GB GD (for high graphics). 4. Engineers: • Like Mechanical, Electrical, Civil etc. used laptop for graphics design. Generally they used software like Auto Cad, UG, PRO –E, CATIA which required higher graphics resolution. For that sufficient configuration is: Core i5 or i7 processor, 4 or 8 GB RAM, 500 GB HDD, 1 or 2 GB GD (for high graphics). To overcome this situation there are several credit points under consideration, firstly consider the competencies necessary to develop the users. Obviously some competencies like processor, RAM having more importance and some competencies like HDD, Screen size, Graphics Card having less important compare to first one. Moreover, usually the users are not independent; therefore a relationship among them could appear. Finally, all particular with credit points are shown in table 1 as per their necessary requirements.
  • 6. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015 46 Particulars Credit Points Essential 5 Fairly High 4 High 3 Moderate 2 Low 1 Fairly Low 0 Table 1 Processor Particulars Users General Professionals Programmers Engineers Dual Core 5 5 0 0 Core i3 0 4 5 0 Core i5 0 0 4 5 Core i7 0 0 0 4 Asus Brazo 5 0 0 0 Asus Intel Dual Core 4 5 0 0 Asus Core i3 0 4 5 0 Asus Core i5 0 0 4 5 RAM 2 GB 3 3 3 0 4 GB 0 2 2 3 8 GB 0 0 0 2 HDD 500 GB 3 3 3 3 1 TB 0 0 2 2 Screen 15.6 3 3 3 3 Graphics Card 512 MB 3 2 3 0 1 GB 0 0 2 3 2 GB 0 0 0 2 Once the users involved in the selection procedure have been determined, the laptops must next to be considered. Let it be imagined that there are 21 laptops (see table 3) that might be able to select for different Users. Laptops Name Laptop1 L1 Laptop2 L2 ..
  • 7. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015 47 Laptop21 L21 For each one it is necessary to find out by some appropriate, means the levels in each of the particular required for the users. Finally as there are links between the users and laptops (using table1 credit points in table 3) must be looked at in order to find out the relationships that there would be among them, as shown in table 2. Table 2 Unbalanced Assignment Problem is solved by using ROA method and MATLAB Programming (See Appendix 1). This gives final optimal solution as: Users Laptop General L1 Professionals L2 Programmers L9 Engineers L15 5 CONCLUSIONS: To select appropriate laptops as per user’s requirement and basic needs. The given problem converted into Assignment Model. The given information in table 3 is converted into numerical by using credit points given in table 1, to solve this realistic problem ROA method is used and at last it verified by MATLAB program which gives optimal solution within 0.005256 sec. 6 REFERENCES [1] Hadi Basirzadeh. “Ones Assignment Method for solving Assignment Problems”, Applied Mathematical Sciences, Vol 6 (2012), No. 47, pp. 2345-2355. [2] Francisco Herrera, Enrique López, Cristina Mendaña, Miguel A. Rodríguez. “Solving an assignment – selection problem with verbal information and using genetic algorithms”, European Journal of Operation Research, 119 (1999), pp. 326-337. [3] Ghadle Kirtiwant P, Muley Yogesh M (2013), “Revised Ones Assignment Method for Solving Assignment Problem”, Journal of Statistics and Mathematics, Volume 4, Issue 1 (2013), pp. 147-150.
  • 8. Applied Mathematics and Sciences: An International Journal (MathSJ ), Vol. 2, No. 1, March 2015 48 Table 3: (shows various types of laptops with specifications and cost) Appendix 1: % MATLAB PROGRAM FOR ASSIGNMENT - LAPTOP SELECTION PROBLEM. % DEVELOPED BY : Dr. Kirtiwant Ghadle , Mr. Yogesh Muley clc tic; x= [17 14 14 9 9 3 6 9 9 6 6 9 6 6 6 6 6 6 3 3 3 11 14 14 13 13 10 12 9 13 12 12 13 12 8 8 12 8 8 5 5 6 12 9 9 14 14 13 13 13 16 15 15 14 13 12 14 15 12 14 13 11 5 6 6 6 6 6 5 9 11 9 12 12 6 11 14 17 12 16 17 16 15 13 ] % matrix x is copied in xnv and x1 variable xnv=x; x1=x; % calculating each row minimum no. maxr= nnmaxr(x) % find row and column no [r c]=size(x) % dividing each element of row
  • 9. 49 for i=1:r for j=1:c x(i,j)=x(i,j)/maxr(i); end end x y=x; for i=1:r for j=1:c if x(i,j)1 x(i,j)=0; end end end x l=1; for i=1:r for j=1:c [xr xc]= find(x==l,'1'); k1=length(xr); for m=1:k1 x(xr(m),xc(m))=1; if x(xr(m),j)~= x(xr(m),xc(m)) x(xr(m),j)=0; end end end end x; z=xnv.*x toc; Dr. Kirtiwant P Ghadle Department of Mathematics, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad -431004. drkp.ghadle@gmail.com Mr. Yogesh M Muley Department of Mathematics, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad -431004. yogesh.m.muley@gmail.com