Dynamic Programming: Path Analysis - Essay Example

Comments (0) Cite this document
DYNAMIC PROGRAMMING Executive summary Once companies are faced with a number of strategic plans that aim at developing their organisations, it always becomes important to have monitoring and evaluation techniques to arrive at making the right selection with regards or reference to the best and most feasible line of strategy to tow…
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER99% of users find it useful
Dynamic Programming: Path Analysis
Read TextPreview

Extract of sample "Dynamic Programming: Path Analysis"

DYNAMIC PROGRAMMING Executive summary Once companies are faced with a number of strategic plans that aim at developing their organisations, it always becomes important to have monitoring and evaluation techniques to arrive at making the right selection with regards or reference to the best and most feasible line of strategy to tow. In this report, this finance company is presented with a broad objective of achieving 60% growth over a five (5) year period. To do this, there are some major benchmarks of strategies and programs to put in place. These bench marks are centralisation of information system, human resource expansion, infrastructural expansion, profit investment and publicity system enhancement. Each of these benchmarks have sub coordinate programs that fall under them. From the current position of the company, the company want to get to a destination of 60% growth in five (5) years. The report therefore presents a technique under the basis of dynamic programming to bring out the path to trend to come to a successful destination under the different variables and programs. Musama (2003) explains that path analysis program always leads to a conclusive shortcut and financial prudence in selecting a line of strategy to tow. In the conclusion, it was established that the most useful path to two is system networking – to – on campus hiring – to – branch expansion – to – company merger – to – social networking. Introduction The global economic climate that is being experienced currently makes it imperative on corporate organisations, especially finance companies to put in place strategies that will ensure the eventual growth of their companies. Without any doubt, once finance companies grow, the entire economy of immediate local businesses and populace are sure to grow as well. This is because finance companies have most often than not become the source of funding for other companies and businesses whose individual successes bring about economic growth. This not withstanding, such strategic plans for growth cannot be undertaken in isolation. It has always been important to have techniques that monitor and evaluate the successful implementation of the strategies. In this report, the dynamic programming idea has been used to come up with a simple technique for monitoring the achievement of the strategic plan of this finance company over a period of five (5) years. The basis of the technique has been structured around the need for time and financial prudence. Major Points The allocated technique for selecting the best path analysis for the intended strategic plans to bring about 60% growth changes in the company over the next five years is the dynamic programming technique. This technique has been identified as very useful in situations that include objective functions to be achieved and where the objectives can be sub divided into stages and states (Brobbey, 2007). Considering that there are five major objective points with one input and output end; making a total of six (6) stages, the dynamic programming cannot be described in any other words than ‘best’ for the current situation. It will be noted that even though each of the five objectives must be achieved, there are four (4) specific goals under each objective. This means that to move from the input to the final output, there would be over two hundred thematic points to cross. Without any doubt, trying to achieve each of the thematic points would demand a lot of resource (money) and time. Meanwhile, the company does not have that much to give out. Through the dynamic programming therefore, a simple routine is going to be identified for use. This means that thematic points that do not fall within the path will be ignored for that particular objective. For clarity, the targeted objectives and specific goals are given in a table form. Under each objective, only one specific goal will be selected. The function of the dynamic programming would therefore be to point to which of the specific goals to select depending on calculations and factors that take into consideration the amount of company budget to put into each specific goal. The table is given as follows: Objectives Centralised information system Human resource expansion Infrastructural expansion Profit investment Publicity system enhancement Goal 1 External system networking (J1) Internal placement (K1) Opening new branches (L1) Acquisition (M1) Event sponsorship (N1) Goal 2 Wide area networking (J2) On campus hiring (K2) New market destination (L2) Share purchasing (M2) Print advertisement (N2) Goal 3 Internal system networking (J3) External placement (K3) Existing market expansion (L3) Company merger (M3) Social networking (N3) Goal Peer to peer networking (J4) Internship (K4) Existing branch expansion (L4) Initial public offer (M4) Global branding (N4) Table 1: Goals and their Codes Despite the advantages, it should be noted that using the dynamic programming to come to conclusions may be very strenuous and demands a lot of dedicated time to avoid oversight mistakes. Conclusions and Recommendations As would be seen in the appendix, each objective puts a relatively different weight of financial demand on the budget of the company. It was therefore found that the path analysis conducted by the use of dynamic programming resulted in coming up with the most cost effective but result oriented goals to pursue under each objective. It is strongly recommended that the conclusions drawn from the path analysis as seen in the appendix should be adhered to religiously so that the company’s expected growth will be achieved. Appendices The technique adopted, which was the use of dynamic programming for arriving at the strategic path has been elaborated in detail below. In the following appendix, the code for each goal is used. The numbers corresponding to the lines represent the percentage of the company’s budget that will be spent from moving from one goal to the next. After the diagram, a breakdown calculation of the best goals to opt for according to the most cost effective paths has been done below. Due to space and for the sake of representation, only the concluded figures are shown. Stage 6 Stage 5 Stage 4 Stage 3 Stage 2 Stage 1 Information System Human Res. Expansion Infrastructural Exp. Profit Investment Publicity 7 1 3 3 4 3 From the diagram, the following calculations for the shortest path (less budget involving path) can be made as follows. The calculation explains why the final path was selected. Stage 1 Input nodes Arc chosen Output nodes Shortest distance (budget percentage) N1 N2 N3 N4 N1 – O N2 – O N3 – O N4 - O O O O O 7 6 3 5 Stage 2 Input nodes Arc chosen Output nodes Shortest distance ( budget percentage) M1 M2 M3 M4 M1 – N2 M2 – N1; M2 – N3 M3 – N3 M4 – N4 N2 N3 N3 N4 12 7 8 9 Stage 3 Input nodes Arc chosen Output nodes Shortest distance ( budget percentage) L1 L2 L3 L4 L1 – M4 L2 – M4 L3 – M2 L4 – M1 M4 M4 M2 M1 12 10 13 15 Stage 4 Input nodes Arc chosen Output nodes Shortest distance ( budget percentage) K1 K2 K3 K4 K1 – L1 K2 – L1 K3 – L2 K4 – L3 L1 L1 L2 L3 19 15 17 18 Stage 5 Input nodes Arc chosen Output nodes Shortest distance ( budget percentage) J1 J2 J3 J4 J1 – K3 J2 – K2 J3 – K2 J4 – K1 K1 K1 K2 K3 19 15 17 18 Stage 6 Input nodes Arc chosen Output nodes Shortest distance ( budget percentage) I I – J3 J3 22 Concluding Path I to J3 to K2 to L4 to M3 to N3 to O From the table 1, this implies the goals to be achieved will be Present Growth > internal system networking > on campus hiring > company merger > social networking > 60% growth REFERENCE LIST Ben-Ameur, Hatem & Breton, Michele & Francois, Pascal, 2006. "A dynamic programming approach to price installment options," European Journal of Operational Research, vol. 169(2), pages 667-676. Brobbey A. H. 2007, “Dynamic Programming and Finance Companies” Durban: Ultimate Publishing House Elton, Edwin J & Gruber, Martin J, 1971. "Dynamic Programming Applications in Finance," Journal of Finance, vol. 26(2), pages 473-506. James C. T. Mao & Carl Erik Sarndal, 1966. "A Decision Theory Approach to Portfolio Selection," Management Science, vol. 12(8), pages B323-B333. Martin R. Young. 1998. "A Minimax Portfolio Selection Rule with Linear Programming Solution", Management Science, Volume 44, No. 5, page 673-683 Musasa T. F 2003, “Financial Structuring for Company Growth” London: Wide Press Limited Polak, George G. & Rogers, David F. & Sweeney, Dennis J., 2010. "Risk management strategies via minimax portfolio optimization," European Journal of Operational Research, vol. 207(1), pages 409-419. Read More
Cite this document
  • APA
  • MLA
(“Dynamic Programming: Path Analysis Essay Example | Topics and Well Written Essays - 750 words”, n.d.)
Dynamic Programming: Path Analysis Essay Example | Topics and Well Written Essays - 750 words. Retrieved from
(Dynamic Programming: Path Analysis Essay Example | Topics and Well Written Essays - 750 Words)
Dynamic Programming: Path Analysis Essay Example | Topics and Well Written Essays - 750 Words.
“Dynamic Programming: Path Analysis Essay Example | Topics and Well Written Essays - 750 Words”, n.d.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document

CHECK THESE SAMPLES OF Dynamic Programming: Path Analysis

Career Path Analysis

...?Career Path Analysis Introduction One of the crucial programs delved into the development of human resources is career planning. For individuals employed in organizations, this phase of development entails a process by which the individual worker patterns and orchestrates one’s separate but related work activities to prepare the person altogether with the organization to take greater job and personal responsibility in the future. Career pathing is actually defined by Heathfield (2011) as the “process used by an employee to chart a course within an organization for his or her career path and career development. Career pathing involves understanding what knowledge, skills, personal characteristics, and experience are required... for an...
4 Pages(1000 words)Essay

Dynamic Programming: Resource Allocation

...available for investment is 10 million. The following table summarise the return of all options along with the cost associated with them. Apart from this, the table also presents the limit for investing in any particular type of securities in order to minimise the risk associated with it. Security Cost per security (M) Return per security (000) Maximum Limit Bonds 5 90 2 T-bills 2 30 5 Stocks 2 50 3 With the help of the dynamic programming problem formulation, solution, and analysis the company will be able to invest the available fund in optimal way. The objective function in this case is to maximise the overall return of the investment. The global decision is to decide how much...
3 Pages(750 words)Assignment

Dynamic Analysis of Malware

...? Dynamic Analysis of Malware Dynamic Analysis of Malware Malware is a generic term referring to kinds of unwanted softwares. Dynamic malware analysis came about due to problems arising in reference to manual malware analysis. Dynamic malware analysis comprises of methods that analyze large amounts of malware in a fast and reliable fashion. The main focus of researchers is on different types of dynamic malware analysis (Hartmann, 2009). Dynamic Malware Analysis Techniques Dynamic analysis...
4 Pages(1000 words)Research Paper


...Question 29 a) Dynamic data structures can grow or shrink according to the wish of the programmer. Static values do not hold this property; once declared they remain fixed to the defined length. b) After the assignment chPtr = new char[10]; chPtr content will be the memory location where char[10] is stored. Question 30 a) Encapsulation in object oriented programming is a technique that integrates data and operations to make an object. The benefits of encapsulation are abstraction and security. Abstraction in the sense that the operations and properties of an object are hidden from the outside world who is not bogged down with the inner workings of the object and security because the outside world can...
9 Pages(2250 words)Research Paper

Sequence Analysis

... BHS008-6 Computational Biology Topic:  Sequence Analysis 11th December Introduction: Dynamic programming In the era of the human genome and the need to explore the entire 3 billion DNA base pairs, computer algorithms become an essential tool. Most of these computer algorithms string use dynamic programming in their implementation. According to Giegerich, (2000), dynamic programming is the most popular programming method applied in bioinformatics. Among the applications of dynamic programming in computational biology include assembling DNA sequence data from automated sequencing machines, determining the intron or exon structure in eukaryotic genes and also in inferring function through homology using proteins with known functions... to...
6 Pages(1500 words)Essay

Career Path Analysis

... about him. It helps people deal with their negative qualities in a good way. It also helps in building trust by sharing. In my case, I can use my analysis by the Johari’s Window in a number of scenarios. The open area is best for communication and relations with others. By the expansion of my open area, I am aware of who I am and the others are as well. That enables me and my subject to communicate on the same level and we get each other. In case I am interacting with a new member in the team, the unknown area of the Window is large, as he doesn’t know me and I don’t know him. In case of a person I already know, the open area is larger and the unknown area is relatively smaller.... Window is a psychological technique to analyze what a...
11 Pages(2750 words)Essay

Consulting critical path analysis

...of the company, therefore this should also be looked at and the company should come up with a better plan of where and how to invest the capital. All these steps are vital to be carried out in an order so that the company can benefit from them. Q2 Develop a critical path analysis for the stages that you would go through. The first step towards coming up with an optimal solution would be to find a common ground for both the technical and sales team. This has to be done in order to work collaboratively with more resources to help solve the case. The technical and the sales team might seem an odd couple, but these days a product’s success depend upon the cooperation, ability, and willingness of the teams...
3 Pages(750 words)Case Study


...Logic and Programming Programming A problem Analysis Chart Given information The information provided is that children below 18 Years of age should not be considered as customers for purchases. Required Results Processing required Solution Alternatives The only alternative is to use the “if” condition to test whether the age is greater than, equal to or less than 18. 2. A flowchart 3. A chart showing input, output, and processing Year of Birth YOB Year Today YT Age (YT-YOB) Status Accepted / Rejected 4. Algorithm (Pseudo code) using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Text; using...
1 Pages(250 words)Essay

Investigating Dynamic Malware Analysis tool

...detection offers minimal zero-day protection (Venugopal & Hu, 2008). In addition, the signature database grows exponentially since the detector uses a specific signature for every variant of malware. Task 2 Research Alternate Methods, Advantages and Disadvantages Heuristic analysis Heuristic scanning bears a close resemblance to signature scanning with the only difference being, instead of checking for particular signatures; heuristic scanning will check for certain commands or instructions within a program, which are not typically found in application programs (Aycock, 2006). The heuristic engine ultimately is better placed to sense for potentially malicious executions in...
4 Pages(1000 words)Research Proposal

Investigating Dynamic Malware Analysis tool

...Investigating Dynamic Malware Analysis tool Malware is a type of malicious software, which has been major software through which intruders steal crucial information out of organizations. The continuous evolutionary patterns of the malware designs have raise difficult for the analysts in terms of identifying and terminating such programs from slipping into systems in an undetected manner. Considering these matters, there are certain possible ways through which such malicious programs can be terminated. One of such attained findings includes the sandbox technology that has proved to be appropriate enough in terms of identifying and testing such codes. It has been identified that the sandbox tools are effective in terms of updating... patterns,...
20 Pages(5000 words)Research Paper
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.

Let us find you another Essay on topic Dynamic Programming: Path Analysis for FREE!

Contact Us