Abstract:
In this paper we develop an optimization model to generate a finite sequence, where i th term of the sequence is the number of occurrence of i in that sequence. This model is formulated as a 0-1 Integer Programming Problem and is solved using Branch-and- Bound algorithm.
Reference this Research Paper (copy & paste below code):
P.Paramadevan, W.B.Daundasekera (2018); An Optimization Model to Generate a Finite Sequence Subject to the Given Conditions;
Int J Sci Res Publ 3(1) (ISSN: 2250-3153). http://www.ijsrp.org/research-paper-1301.php?rp=P13636
