The document provides an overview of linear programming models (LPM), including:
- Defining the key components of an LPM, such as the objective function, decision variables, constraints, and parameters.
- Explaining the characteristics and assumptions of an LPM, such as linearity, divisibility, and non-negativity.
- Describing methods for solving LPMs, including graphical and algebraic (simplex) methods.
- Providing examples of formulating LPMs to maximize profit based on constraints like available resources.
UNIT-2 Quantitaitive Anlaysis for Mgt Decisions.pptxMinilikDerseh1
This document provides an overview of linear programming problems (LPP). It discusses the key components of linear programming models including objectives, decision variables, constraints, and parameters. It also covers formulation of LPP, graphical and simplex solution methods, duality, and post-optimality analysis. Various applications of linear programming in areas like production, marketing, finance, and personnel management are also highlighted. An example problem on determining optimal product mix given resource constraints is presented to illustrate linear programming formulation.
This document provides an introduction to the analysis of algorithms. It discusses algorithm specification, performance analysis frameworks, and asymptotic notations used to analyze algorithms. Key aspects covered include time complexity, space complexity, worst-case analysis, and average-case analysis. Common algorithms like sorting and searching are also mentioned. The document outlines algorithm design techniques such as greedy methods, divide and conquer, and dynamic programming. It distinguishes between recursive and non-recursive algorithms and provides examples of complexity analysis for non-recursive algorithms.
The document summarizes key concepts regarding linear programming problems. It discusses:
1. Linear programming problems aim to optimize an objective function subject to constraints. They can model many practical operations research problems.
2. The document provides an example problem of determining production levels to maximize profit. It demonstrates formulating the problem as a mathematical model and solving it graphically and with the simplex method.
3. The simplex method solves linear programming problems by examining vertex points of the feasible solution space. It involves setting up the problem in standard form and using minimum ratio and pivot element calculations to systematically search for an optimal solution.
CHAPTER TWO - OPERATIONS RESEARCH (2).pptxAynetuTerefe2
The document summarizes concepts of linear programming including its components and assumptions. It discusses that linear programming is an optimization method that allocates scarce resources in the best way subject to limiting conditions. The key components of a linear programming model are the objective function, decision variables, constraints, and parameters. Some assumptions of linear programming models include linearity, divisibility, certainty of parameters, and non-negativity. Examples are provided to illustrate how to formulate a linear programming model and solve problems graphically or using the simplex method.
This document provides an overview of linear programming (LP), including its key characteristics and applications. LP aims to optimally allocate limited resources to achieve objectives. It involves defining decision variables, an objective function to maximize/minimize, and constraints on the resources. Common applications include production planning, finance, marketing, and more. The document also discusses various LP solving techniques like the graphical method, algebraic method, simplex method, and their use of concepts like the feasible region, basic feasible solutions, and optimality conditions.
Linear programming is a mathematical modeling technique useful for allocating scarce or limited resources to competing activities based on an optimality criterion. There are four key components of any linear programming model: decision variables, objective function, constraints, and non-negativity assumptions. Linear programming models make simplifying assumptions like certainty of parameters, additivity, linearity/proportionality, and divisibility of decision variables. The technique helps decision-makers use resources effectively and arrive at optimal solutions subject to constraints, but it has limitations if variables are not continuous or parameters uncertain.
The document discusses linear programming and its applications. It begins by defining linear programming and its key characteristics like objectives, constraints, and decision variables. It then provides examples of how linear programming is used in various industries like manufacturing, retail, delivery routing, and machine learning to optimize objectives like profit, efficiency, and costs. Specific techniques like graphical method and solving LP problems in tabular form are also summarized.
A brief study on linear programming solving methodsMayurjyotiNeog
This document summarizes linear programming and two methods for solving linear programming problems: the graphical method and the simplex method. It outlines the key components of linear programming problems including decision variables, objective functions, and constraints. It then describes the steps of the graphical method and simplex method in solving linear programming problems. The graphical method involves plotting the feasible region and objective function on a graph to find the optimal point. The simplex method uses an algebraic table approach to iteratively find the optimal solution.
UNIT-2 Quantitaitive Anlaysis for Mgt Decisions.pptxMinilikDerseh1
This document provides an overview of linear programming problems (LPP). It discusses the key components of linear programming models including objectives, decision variables, constraints, and parameters. It also covers formulation of LPP, graphical and simplex solution methods, duality, and post-optimality analysis. Various applications of linear programming in areas like production, marketing, finance, and personnel management are also highlighted. An example problem on determining optimal product mix given resource constraints is presented to illustrate linear programming formulation.
This document provides an introduction to the analysis of algorithms. It discusses algorithm specification, performance analysis frameworks, and asymptotic notations used to analyze algorithms. Key aspects covered include time complexity, space complexity, worst-case analysis, and average-case analysis. Common algorithms like sorting and searching are also mentioned. The document outlines algorithm design techniques such as greedy methods, divide and conquer, and dynamic programming. It distinguishes between recursive and non-recursive algorithms and provides examples of complexity analysis for non-recursive algorithms.
The document summarizes key concepts regarding linear programming problems. It discusses:
1. Linear programming problems aim to optimize an objective function subject to constraints. They can model many practical operations research problems.
2. The document provides an example problem of determining production levels to maximize profit. It demonstrates formulating the problem as a mathematical model and solving it graphically and with the simplex method.
3. The simplex method solves linear programming problems by examining vertex points of the feasible solution space. It involves setting up the problem in standard form and using minimum ratio and pivot element calculations to systematically search for an optimal solution.
CHAPTER TWO - OPERATIONS RESEARCH (2).pptxAynetuTerefe2
The document summarizes concepts of linear programming including its components and assumptions. It discusses that linear programming is an optimization method that allocates scarce resources in the best way subject to limiting conditions. The key components of a linear programming model are the objective function, decision variables, constraints, and parameters. Some assumptions of linear programming models include linearity, divisibility, certainty of parameters, and non-negativity. Examples are provided to illustrate how to formulate a linear programming model and solve problems graphically or using the simplex method.
This document provides an overview of linear programming (LP), including its key characteristics and applications. LP aims to optimally allocate limited resources to achieve objectives. It involves defining decision variables, an objective function to maximize/minimize, and constraints on the resources. Common applications include production planning, finance, marketing, and more. The document also discusses various LP solving techniques like the graphical method, algebraic method, simplex method, and their use of concepts like the feasible region, basic feasible solutions, and optimality conditions.
Linear programming is a mathematical modeling technique useful for allocating scarce or limited resources to competing activities based on an optimality criterion. There are four key components of any linear programming model: decision variables, objective function, constraints, and non-negativity assumptions. Linear programming models make simplifying assumptions like certainty of parameters, additivity, linearity/proportionality, and divisibility of decision variables. The technique helps decision-makers use resources effectively and arrive at optimal solutions subject to constraints, but it has limitations if variables are not continuous or parameters uncertain.
The document discusses linear programming and its applications. It begins by defining linear programming and its key characteristics like objectives, constraints, and decision variables. It then provides examples of how linear programming is used in various industries like manufacturing, retail, delivery routing, and machine learning to optimize objectives like profit, efficiency, and costs. Specific techniques like graphical method and solving LP problems in tabular form are also summarized.
A brief study on linear programming solving methodsMayurjyotiNeog
This document summarizes linear programming and two methods for solving linear programming problems: the graphical method and the simplex method. It outlines the key components of linear programming problems including decision variables, objective functions, and constraints. It then describes the steps of the graphical method and simplex method in solving linear programming problems. The graphical method involves plotting the feasible region and objective function on a graph to find the optimal point. The simplex method uses an algebraic table approach to iteratively find the optimal solution.
The document discusses linear programming and its key concepts. It begins by defining linear programming as using a mathematical model to allocate scarce resources to maximize profit or minimize cost. It then provides the steps to solve linear programming problems: [1] identify the problem as solvable by LP, [2] formulate a mathematical model, [3] solve the model, and [4] implement the solution. The document also discusses modeling techniques like defining decision variables, objective functions, and constraints. It provides examples of LP formulations and solutions using both graphical and algebraic methods. Finally, it discusses special issues that can arise like infeasible, unbounded, and redundant solutions or the existence of multiple optimal solutions.
The document discusses linear programming and its key concepts. It begins by defining linear programming as using a mathematical model to allocate scarce resources to maximize profit or minimize cost. It then provides the steps to solve linear programming problems: [1] identify the problem as solvable by LP, [2] formulate a mathematical model, [3] solve the model, and [4] implement the solution. The document also discusses modeling techniques like defining decision variables, objective functions, and constraints. It provides examples of LP formulations and solutions using both graphical and algebraic methods. Finally, it discusses special issues that can arise like infeasible, unbounded, and redundant solutions or the existence of multiple optimal solutions.
Design and Analysis of Algorithm help to design the algorithms for solving different types of problems in Computer Science. It also helps to design and analyze the logic of how the program will work before developing the actual code for a program.
The document discusses linear programming models and optimization techniques. It covers sensitivity analysis and duality analysis to determine parameter values where a linear programming solution remains valid. It also discusses solving linear programming problems with integer constraints and using network models to solve transportation problems. The document then provides an example of using the simplex method and sensitivity analysis to solve a linear programming problem to maximize profit based on production capacity constraints.
This document provides an overview of linear programming, including its history, key components, assumptions, and applications. Linear programming involves maximizing or minimizing a linear objective function subject to linear constraints. It was developed in 1947 and can be used to optimize problems involving allocation of limited resources. The key components of a linear programming problem are the objective function, decision variables, constraints, and parameters. It makes assumptions of proportionality, additivity, continuity, determinism, and finite choices. Common applications of linear programming include production planning, facility location, and transportation problems.
This document discusses linear programming and its concepts, formulation, and methods of solving linear programming problems. It provides the following key points:
1) Linear programming involves optimizing a linear objective function subject to linear constraints. It aims to find the best allocation of limited resources to achieve objectives.
2) Formulating a linear programming problem involves identifying decision variables, the objective function, and constraints. Problems can be solved graphically or algebraically using the simplex method.
3) The graphic method can be used for problems with two variables, involving plotting the constraints on a graph to find the optimal solution at a corner point of the feasible region.
The document discusses linear programming, including:
1. It describes the basic concepts of linear programming, such as decision variables, constraints, and the objective function needing to be linear.
2. It explains the steps to formulate a linear programming problem, such as identifying decision variables and constraints, and writing the objective function and constraints as linear combinations of the variables.
3. It provides examples of how to write linear programming problems in standard form to maximize or minimize objectives subject to constraints.
Dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable when problems exhibit overlapping subproblems that are only slightly smaller. The method involves 4 steps: 1) developing a mathematical notation to express solutions, 2) proving the principle of optimality holds, 3) deriving a recurrence relation relating solutions to subsolutions, and 4) writing an algorithm to compute the recurrence relation. Dynamic programming yields optimal solutions when the principle of optimality holds, without needing to prove optimality. It is used to solve production, scheduling, resource allocation, and inventory problems.
For a good business plan creative thinking is important. A business plan is very important and strategic tool for entrepreneurs. A good business plan not only helps entrepreneurs focus on specific steps necessary for them to make business ideas succeed, but it also helps them to achieve short-term and long-term objectives. As an inspiring entrepreneur who is looking towards starting a business, one of the businesses you can successfully start without much stress is book servicing café.
Importance:
Nowadays, network plays an important role in people’s life. In the process of the improvement of the people’s living standard, people’s demand of the life’s quality and efficiency is more higher, the traditional bookstore’s inconvenience gradually emerge, and the online book store has gradually be used in public. The online book store system based on the principle of providing convenience and service to people.
With the online book servicing café, college student do not need to blindly go to various places to find their own books, but only in a computer connected to the internet log on online book servicing café in the search box, type u want to find of the book information retrieval, you can efficiently know whether a site has its own books, if you can online direct purchase, if not u can change the home book store to continue to search or provide advice to the seller in order to supply. This greatly facilitates every college student saving time.
The online book servicing café’s main users are divided into two categories, one is the front user, and one is the background user. The main business model for Book Servicing Café relies on college students providing textbooks, auctions, classifieds teacher evaluations available on website. Therefore, our focus will be on the marketing strategy to increase student traffic and usage. In turn, visitor volume and transactions will maintain the inventory of products and services offered.
Online bookstore system i.e. Book Servicing Café not only can easily find the information and purchase books, and the operating conditions are simple, user-friendly, to a large extent to solve real-life problems in the purchase of the books.
When you shop in online book servicing cafe, you have the chance of accessing and going through customers who have shopped at book servicing café and review about the book you intend to buy. This will give you beforehand information about that book.
While purchasing or selling books at the book servicing café, you save money, energy and time for your favorite book online. The book servicing café will offer discount coupons which help college students save money or make money on their purchases or selling. Shopping for books online is economical too because of the low shipping price.
Book servicing café tend to work with multiple suppliers, which allows them to offer a wider variety of books than a traditional retail store without accruing a large, costly inventory which will help colle
This document provides an overview of linear programming (LP). It begins with a brief introduction defining LP as a technique for determining optimal resource allocation to achieve objectives. The history of LP is then summarized, noting its development in 1947 to solve military planning problems. Key aspects of LP are outlined, including decision variables, constraints, and the objective function. Common applications are listed such as manufacturing, finance, and agriculture. An example diet problem is illustrated to demonstrate solving an LP formulation. The assignment problem as a type of LP is also described. The assumptions, methods, and limitations of LP are discussed. Finally, duality in LP is defined as analyzing a problem and its equivalent dual problem from different perspectives.
This document provides information about obtaining fully solved assignments from an assignment help service. It lists a mail ID and phone number to contact along with details about the subject code, semester, credits, and marks for an Operations Research assignment from the Winter 2013 semester. The assignment contains 6 questions and provides evaluation criteria. Students are instructed to answer all questions and note the word count requirement for longer questions.
Linear programming manufacturing applicationMuneeb Ahmed
The document discusses a linear programming problem faced by an outdoor furniture company. The company produces benches and picnic tables and must determine production levels to maximize profit given constraints of available labor hours and materials. Graphical and algebraic methods are used to solve the problem, determining the optimal production mix is 34 picnic tables and 278 benches, yielding a maximum profit of $3,182. In conclusion, linear programming is useful for optimizing resource allocation and production planning to reduce waste and maximize profits for businesses.
This document discusses optimization problem formulation. It begins by introducing optimization algorithms and their use in computer-aided design. It then discusses the key components of formulating an optimization problem: identifying design variables and constraints, defining the objective function, and setting variable bounds. Two examples are provided to illustrate this process for optimizing a truss structure design and car suspension design. The document provides the details necessary to mathematically formulate engineering optimization problems.
The document defines linear programming and its key components. It explains that linear programming is a mathematical optimization technique used to allocate limited resources to achieve the best outcome, such as maximizing profit or minimizing costs. The document outlines the basic steps of the simplex method for solving linear programming problems and provides an example to illustrate determining the maximum value of a linear function given a set of constraints. It also discusses other applications of linear programming in fields like engineering, manufacturing, energy, and transportation for optimization.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
Algorithm and C code related to data structureSelf-Employed
Everything lies inside an algorithm in the world of coding and algorithm formation which is the basis of data structure and manipulation of the algorithm in computer science and information technology which is ultimately used to find a particular problems solution
Dynamic programming is a technique for solving complex problems by breaking them down into simpler sub-problems. It involves storing solutions to sub-problems for later use, avoiding recomputing them. Examples where it can be applied include matrix chain multiplication and calculating Fibonacci numbers. For matrix chains, dynamic programming finds the optimal order for multiplying matrices with minimum computations. For Fibonacci numbers, it calculates values in linear time by storing previous solutions rather than exponentially recomputing them through recursion.
This document provides an introduction to linear programming. It defines linear programming as a mathematical modeling technique used to optimize resource allocation. The key requirements are a well-defined objective function, constraints on available resources, and alternative courses of action represented by decision variables. The assumptions of linear programming include proportionality, additivity, continuity, certainty, and finite choices. Formulating a problem as a linear program involves defining the objective function and constraints mathematically. Graphical and analytical solutions can then be used to find the optimal solution. Linear programming has many applications in fields like industrial production, transportation, and facility location.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
This document provides an overview of network protocols for a training course. It defines what protocols are, their basic functions, and examples of common protocols like HTTP, FTP, and IP. It also discusses how protocols are implemented, their levels, types (standard vs proprietary), key elements (syntax, semantics, timing), and how they allow devices to communicate by establishing rules for data transmission.
This document discusses ethics, corporate social responsibility, sustainability, and governance in international business. It covers the importance of ethical behavior, challenges that can arise, and approaches to dealing with relativism across cultures. Unethical practices like corruption, bribery, harmful sourcing, and IP infringement are challenges. Firms must balance cultural norms with their own standards to operate ethically abroad and avoid legal/reputational risks of unethical behavior.
The document discusses linear programming and its key concepts. It begins by defining linear programming as using a mathematical model to allocate scarce resources to maximize profit or minimize cost. It then provides the steps to solve linear programming problems: [1] identify the problem as solvable by LP, [2] formulate a mathematical model, [3] solve the model, and [4] implement the solution. The document also discusses modeling techniques like defining decision variables, objective functions, and constraints. It provides examples of LP formulations and solutions using both graphical and algebraic methods. Finally, it discusses special issues that can arise like infeasible, unbounded, and redundant solutions or the existence of multiple optimal solutions.
The document discusses linear programming and its key concepts. It begins by defining linear programming as using a mathematical model to allocate scarce resources to maximize profit or minimize cost. It then provides the steps to solve linear programming problems: [1] identify the problem as solvable by LP, [2] formulate a mathematical model, [3] solve the model, and [4] implement the solution. The document also discusses modeling techniques like defining decision variables, objective functions, and constraints. It provides examples of LP formulations and solutions using both graphical and algebraic methods. Finally, it discusses special issues that can arise like infeasible, unbounded, and redundant solutions or the existence of multiple optimal solutions.
Design and Analysis of Algorithm help to design the algorithms for solving different types of problems in Computer Science. It also helps to design and analyze the logic of how the program will work before developing the actual code for a program.
The document discusses linear programming models and optimization techniques. It covers sensitivity analysis and duality analysis to determine parameter values where a linear programming solution remains valid. It also discusses solving linear programming problems with integer constraints and using network models to solve transportation problems. The document then provides an example of using the simplex method and sensitivity analysis to solve a linear programming problem to maximize profit based on production capacity constraints.
This document provides an overview of linear programming, including its history, key components, assumptions, and applications. Linear programming involves maximizing or minimizing a linear objective function subject to linear constraints. It was developed in 1947 and can be used to optimize problems involving allocation of limited resources. The key components of a linear programming problem are the objective function, decision variables, constraints, and parameters. It makes assumptions of proportionality, additivity, continuity, determinism, and finite choices. Common applications of linear programming include production planning, facility location, and transportation problems.
This document discusses linear programming and its concepts, formulation, and methods of solving linear programming problems. It provides the following key points:
1) Linear programming involves optimizing a linear objective function subject to linear constraints. It aims to find the best allocation of limited resources to achieve objectives.
2) Formulating a linear programming problem involves identifying decision variables, the objective function, and constraints. Problems can be solved graphically or algebraically using the simplex method.
3) The graphic method can be used for problems with two variables, involving plotting the constraints on a graph to find the optimal solution at a corner point of the feasible region.
The document discusses linear programming, including:
1. It describes the basic concepts of linear programming, such as decision variables, constraints, and the objective function needing to be linear.
2. It explains the steps to formulate a linear programming problem, such as identifying decision variables and constraints, and writing the objective function and constraints as linear combinations of the variables.
3. It provides examples of how to write linear programming problems in standard form to maximize or minimize objectives subject to constraints.
Dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable when problems exhibit overlapping subproblems that are only slightly smaller. The method involves 4 steps: 1) developing a mathematical notation to express solutions, 2) proving the principle of optimality holds, 3) deriving a recurrence relation relating solutions to subsolutions, and 4) writing an algorithm to compute the recurrence relation. Dynamic programming yields optimal solutions when the principle of optimality holds, without needing to prove optimality. It is used to solve production, scheduling, resource allocation, and inventory problems.
For a good business plan creative thinking is important. A business plan is very important and strategic tool for entrepreneurs. A good business plan not only helps entrepreneurs focus on specific steps necessary for them to make business ideas succeed, but it also helps them to achieve short-term and long-term objectives. As an inspiring entrepreneur who is looking towards starting a business, one of the businesses you can successfully start without much stress is book servicing café.
Importance:
Nowadays, network plays an important role in people’s life. In the process of the improvement of the people’s living standard, people’s demand of the life’s quality and efficiency is more higher, the traditional bookstore’s inconvenience gradually emerge, and the online book store has gradually be used in public. The online book store system based on the principle of providing convenience and service to people.
With the online book servicing café, college student do not need to blindly go to various places to find their own books, but only in a computer connected to the internet log on online book servicing café in the search box, type u want to find of the book information retrieval, you can efficiently know whether a site has its own books, if you can online direct purchase, if not u can change the home book store to continue to search or provide advice to the seller in order to supply. This greatly facilitates every college student saving time.
The online book servicing café’s main users are divided into two categories, one is the front user, and one is the background user. The main business model for Book Servicing Café relies on college students providing textbooks, auctions, classifieds teacher evaluations available on website. Therefore, our focus will be on the marketing strategy to increase student traffic and usage. In turn, visitor volume and transactions will maintain the inventory of products and services offered.
Online bookstore system i.e. Book Servicing Café not only can easily find the information and purchase books, and the operating conditions are simple, user-friendly, to a large extent to solve real-life problems in the purchase of the books.
When you shop in online book servicing cafe, you have the chance of accessing and going through customers who have shopped at book servicing café and review about the book you intend to buy. This will give you beforehand information about that book.
While purchasing or selling books at the book servicing café, you save money, energy and time for your favorite book online. The book servicing café will offer discount coupons which help college students save money or make money on their purchases or selling. Shopping for books online is economical too because of the low shipping price.
Book servicing café tend to work with multiple suppliers, which allows them to offer a wider variety of books than a traditional retail store without accruing a large, costly inventory which will help colle
This document provides an overview of linear programming (LP). It begins with a brief introduction defining LP as a technique for determining optimal resource allocation to achieve objectives. The history of LP is then summarized, noting its development in 1947 to solve military planning problems. Key aspects of LP are outlined, including decision variables, constraints, and the objective function. Common applications are listed such as manufacturing, finance, and agriculture. An example diet problem is illustrated to demonstrate solving an LP formulation. The assignment problem as a type of LP is also described. The assumptions, methods, and limitations of LP are discussed. Finally, duality in LP is defined as analyzing a problem and its equivalent dual problem from different perspectives.
This document provides information about obtaining fully solved assignments from an assignment help service. It lists a mail ID and phone number to contact along with details about the subject code, semester, credits, and marks for an Operations Research assignment from the Winter 2013 semester. The assignment contains 6 questions and provides evaluation criteria. Students are instructed to answer all questions and note the word count requirement for longer questions.
Linear programming manufacturing applicationMuneeb Ahmed
The document discusses a linear programming problem faced by an outdoor furniture company. The company produces benches and picnic tables and must determine production levels to maximize profit given constraints of available labor hours and materials. Graphical and algebraic methods are used to solve the problem, determining the optimal production mix is 34 picnic tables and 278 benches, yielding a maximum profit of $3,182. In conclusion, linear programming is useful for optimizing resource allocation and production planning to reduce waste and maximize profits for businesses.
This document discusses optimization problem formulation. It begins by introducing optimization algorithms and their use in computer-aided design. It then discusses the key components of formulating an optimization problem: identifying design variables and constraints, defining the objective function, and setting variable bounds. Two examples are provided to illustrate this process for optimizing a truss structure design and car suspension design. The document provides the details necessary to mathematically formulate engineering optimization problems.
The document defines linear programming and its key components. It explains that linear programming is a mathematical optimization technique used to allocate limited resources to achieve the best outcome, such as maximizing profit or minimizing costs. The document outlines the basic steps of the simplex method for solving linear programming problems and provides an example to illustrate determining the maximum value of a linear function given a set of constraints. It also discusses other applications of linear programming in fields like engineering, manufacturing, energy, and transportation for optimization.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
Algorithm and C code related to data structureSelf-Employed
Everything lies inside an algorithm in the world of coding and algorithm formation which is the basis of data structure and manipulation of the algorithm in computer science and information technology which is ultimately used to find a particular problems solution
Dynamic programming is a technique for solving complex problems by breaking them down into simpler sub-problems. It involves storing solutions to sub-problems for later use, avoiding recomputing them. Examples where it can be applied include matrix chain multiplication and calculating Fibonacci numbers. For matrix chains, dynamic programming finds the optimal order for multiplying matrices with minimum computations. For Fibonacci numbers, it calculates values in linear time by storing previous solutions rather than exponentially recomputing them through recursion.
This document provides an introduction to linear programming. It defines linear programming as a mathematical modeling technique used to optimize resource allocation. The key requirements are a well-defined objective function, constraints on available resources, and alternative courses of action represented by decision variables. The assumptions of linear programming include proportionality, additivity, continuity, certainty, and finite choices. Formulating a problem as a linear program involves defining the objective function and constraints mathematically. Graphical and analytical solutions can then be used to find the optimal solution. Linear programming has many applications in fields like industrial production, transportation, and facility location.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
This document provides an overview of network protocols for a training course. It defines what protocols are, their basic functions, and examples of common protocols like HTTP, FTP, and IP. It also discusses how protocols are implemented, their levels, types (standard vs proprietary), key elements (syntax, semantics, timing), and how they allow devices to communicate by establishing rules for data transmission.
This document discusses ethics, corporate social responsibility, sustainability, and governance in international business. It covers the importance of ethical behavior, challenges that can arise, and approaches to dealing with relativism across cultures. Unethical practices like corruption, bribery, harmful sourcing, and IP infringement are challenges. Firms must balance cultural norms with their own standards to operate ethically abroad and avoid legal/reputational risks of unethical behavior.
This document outlines the course syllabus for an Organizational Behavior class. It includes 5 chapters to be covered over 3 weeks on topics such as leadership, diversity, and organizational culture. Two major assignments will focus on power and politics as well as organizational change and stress management. The class is taught by Dr. Yohannes, and will draw from the textbook Organizational Behavior by Robbins and Judge.
Chapter 5 The External, Industry, and Competitive Analysis.pptTeshome48
This document discusses analyzing a firm's external environment and industry competition. It covers performing external environmental analysis to identify opportunities and threats. Key parts of the analysis include scanning, monitoring, forecasting and assessing the general environment. The document also discusses Porter's five forces model of competition and how the bargaining power of suppliers and buyers, threat of substitutes, and intensity of rivalry impact industry attractiveness and profit potential. It defines strategic groups within an industry and notes the importance of competitor analysis.
Market segmentation involves dividing a market into distinct subgroups of customers with common needs or characteristics. It allows companies to target specific segments with tailored marketing strategies. Key steps include identifying segmentation bases, developing segment profiles, selecting target segments, and developing positioning and marketing mixes for each segment. Common bases for segmenting consumers include geographic, demographic, psychographic and behavioral factors. Effective segmentation creates segments that are measurable, accessible, substantial and differential in their response to marketing strategies.
Chapter 1_ Overview of International Business.pptxTeshome48
This document provides an overview and introduction to an international business course. It defines international business as trade and investment activities across national borders. The main topics covered are the globalization of markets, international trade and investment, risks in international business, participants in international business, and strategies for entering international markets like exporting and foreign direct investment. The course objectives are to introduce students to international business and analyze how the global environment impacts international firms. Students will be evaluated based on assignments and a final exam.
This chapter discusses the globalization of markets and the internationalization of firms. It covers the key drivers of globalization like reductions in trade barriers and advances in technology. It also examines the phases of globalization and how firms are expanding their value chain activities internationally. The chapter analyzes the consequences of globalization for firms and societies. It provides examples of born global firms and discusses how globalization is impacting development in Africa.
Here are the key points of an exploratory research design using focus groups:
- A focus group consists of 6-10 people who are relevant to the research topic (e.g. current juice customers).
- The group is led by a moderator who facilitates an open discussion on people's views and experiences related to the juice selection and what might encourage them to purchase more juices.
- The discussion is recorded and analyzed for common themes, insights, and hypotheses that emerge from the participants' dialogue with each other.
- Focus groups allow exploratory research of people's perceptions in a social environment where they can consider their views in relation to others.
- The open discussion format is useful early in a research project to
This chapter discusses the characteristics and backgrounds of entrepreneurs. It explores who entrepreneurs are and examines their typical traits and motivations. Some key points covered include:
- Entrepreneurs are typically driven by a strong need for achievement and willingness to take risks. They exhibit traits like optimism, initiative, and perseverance.
- However, debates exist around whether entrepreneurs are "born" with these traits or if they can be "made" through environmental factors and training.
- Entrepreneurial motivations also stem from both "pull" factors like pursuing an opportunity or idea, or "push" factors like the need for employment or change.
- While entrepreneurship provides advantages like independence, it also
The document provides an overview of operations research (OR), including:
- The history and origins of OR which began in the late 1930s in the UK to study military operations problems.
- The key phases of a typical OR project: problem identification, mathematical modeling, model validation, solution of the model, and implementation.
- The wide range of applications of OR techniques across various fields such as accounting, construction, facilities planning, finance, manufacturing, and more.
- The types of models used in OR, classified based on the level of abstraction into physical, analog, and symbolic mathematical models. Deterministic and probabilistic/stochastic models are discussed.
This document provides an overview of an operations management course. It includes the course instructor's name and credentials, guiding principles, chapter outlines covering topics like operations strategy and quality management, assignment details, and a lecture schedule. The chapters will cover introduction to operations management, competitiveness and productivity, innovation, quality management, product design, just-in-time operations, and other key operations management topics. Students will complete two assignments involving summarizing course materials. The course aims to link operations and supply chain management concepts.
This study examines the effect of managerial efficiency on employee job satisfaction at the Commercial Bank of Ethiopia's Lega Tafo Subcity branches. The study uses a census sampling technique to collect primary data through questionnaires distributed to all 91 employees across four branches. Statistical analysis, including correlation coefficients and regression analysis, finds that managerial efficiency has a strong positive correlation with and 93.2% influence on employee job satisfaction. Specifically, leadership skill and teaming skill were found to significantly affect job satisfaction, while management skill had an insignificant effect. The study concludes that improving leadership skill, teaming skill, and overall managerial efficiency can enhance employee job satisfaction at the bank's branches.
The document discusses the transportation and assignment model, which is a type of linear programming problem dealing with transporting a commodity from sources to destinations at minimum cost. Key points:
- A product is transported from multiple sources to multiple destinations, with fixed supply quantities at sources and demand quantities at destinations.
- The model aims to determine shipping quantities from each source to each destination to satisfy all demands at minimum total shipping cost, subject to supply and demand constraints.
- Common solution methods include the northwest corner rule, least cost method, and Vogel's approximation method to find an initial feasible solution.
- The optimal solution is then tested using methods like the stepping stone or MODI method to evaluate empty cells and
This document discusses digital communication and data link control. It covers flow control methods like stop and wait and sliding windows to prevent buffer overflow. It also discusses fragmentation, error detection using cyclic redundancy checks, and error control protocols like automatic repeat request (ARQ) using stop and wait, go back N, and selective reject. Finally, it summarizes the High-Level Data Link Control (HDLC) protocol including frame structure, address fields, control fields, information fields, frame check sequences, and the initialization, data transfer, and disconnection phases of HDLC operation.
This document summarizes key aspects of classical management theory discussed in Chapter 1 of the textbook. It outlines the four categories of management theories, and focuses on pre-classical and classical management thought. Pre-classical management practices date back to ancient civilizations like Egypt and Greece, while influential early contributors included Robert Owen, Charles Babbage, and Adam Smith. Classical management theory had two broad perspectives: scientific management, whose chief proponents were Frederick Taylor, Frank and Lillian Gilbreth, and Henry Gantt; and classical organization theory focusing on bureaucratic and administrative management.
This document discusses customer perceived value and customer satisfaction in business markets. It begins by providing background on the increased interest in customer value among researchers and practitioners. It then reviews the literature on customer satisfaction and customer perceived value. Specifically, it discusses how satisfaction has traditionally been viewed through the disconfirmation paradigm but its nature is ambiguous. It also discusses criticisms of satisfaction and arguments for viewing perceived value as a better predictor of behavioral outcomes in business markets. The document then outlines three research questions it aims to address regarding the relationship between value and satisfaction and which better predicts behavioral intentions.
This document discusses several economic theories used by economists to analyze and understand economic phenomena:
- Supply and demand theory explains how price is determined by the interaction of supply and demand in a market.
- Classical economics views markets as self-regulating systems governed by production and exchange.
- Keynesian economics focuses on how aggregate demand impacts output, employment, and inflation.
- Malthusian economics argues that population growth outpaces food supply growth.
- Marxism views capitalism as creating two socioeconomic classes that are in conflict.
- Market socialism incorporates elements of both socialist planning and free markets.
This document provides a review of a paper on production theory and the production possibility frontier. The paper was written by O.S. Suguna Sheela in 2007 and published in the journal General Economics. It discusses key concepts in production theory including the production function, factors of production, the production possibility frontier, the law of variable proportions, and the law of returns to scale. The review finds that cost analysis plays an important role in managerial decision making.
The document summarizes a study on the effect of microfinance institutions on household livelihood in Enchini Town, Ethiopia. Key findings from the study include:
1) Microfinance leads to improved household income as descriptive results show 94.5% of clients reported increased average yearly income.
2) Microfinance enables increased consumption expenditures, improving household diet and living conditions.
3) Microfinance facilitates access to healthcare as 95% of clients reported increased responsiveness to medical care needs.
Storytelling is an incredibly valuable tool to share data and information. To get the most impact from stories there are a number of key ingredients. These are based on science and human nature. Using these elements in a story you can deliver information impactfully, ensure action and drive change.
Best Competitive Marble Pricing in Dubai - ☎ 9928909666Stone Art Hub
Stone Art Hub offers the best competitive Marble Pricing in Dubai, ensuring affordability without compromising quality. With a wide range of exquisite marble options to choose from, you can enhance your spaces with elegance and sophistication. For inquiries or orders, contact us at ☎ 9928909666. Experience luxury at unbeatable prices.
Unlocking WhatsApp Marketing with HubSpot: Integrating Messaging into Your Ma...Niswey
50 million companies worldwide leverage WhatsApp as a key marketing channel. You may have considered adding it to your marketing mix, or probably already driving impressive conversions with WhatsApp.
But wait. What happens when you fully integrate your WhatsApp campaigns with HubSpot?
That's exactly what we explored in this session.
We take a look at everything that you need to know in order to deploy effective WhatsApp marketing strategies, and integrate it with your buyer journey in HubSpot. From technical requirements to innovative campaign strategies, to advanced campaign reporting - we discuss all that and more, to leverage WhatsApp for maximum impact. Check out more details about the event here https://events.hubspot.com/events/details/hubspot-new-delhi-presents-unlocking-whatsapp-marketing-with-hubspot-integrating-messaging-into-your-marketing-strategy/
How are Lilac French Bulldogs Beauty Charming the World and Capturing Hearts....Lacey Max
“After being the most listed dog breed in the United States for 31
years in a row, the Labrador Retriever has dropped to second place
in the American Kennel Club's annual survey of the country's most
popular canines. The French Bulldog is the new top dog in the
United States as of 2022. The stylish puppy has ascended the
rankings in rapid time despite having health concerns and limited
color choices.”
Part 2 Deep Dive: Navigating the 2024 Slowdownjeffkluth1
Introduction
The global retail industry has weathered numerous storms, with the financial crisis of 2008 serving as a poignant reminder of the sector's resilience and adaptability. However, as we navigate the complex landscape of 2024, retailers face a unique set of challenges that demand innovative strategies and a fundamental shift in mindset. This white paper contrasts the impact of the 2008 recession on the retail sector with the current headwinds retailers are grappling with, while offering a comprehensive roadmap for success in this new paradigm.
Cover Story - China's Investment Leader - Dr. Alyce SUmsthrill
In World Expo 2010 Shanghai – the most visited Expo in the World History
https://www.britannica.com/event/Expo-Shanghai-2010
China’s official organizer of the Expo, CCPIT (China Council for the Promotion of International Trade https://en.ccpit.org/) has chosen Dr. Alyce Su as the Cover Person with Cover Story, in the Expo’s official magazine distributed throughout the Expo, showcasing China’s New Generation of Leaders to the World.
Zodiac Signs and Food Preferences_ What Your Sign Says About Your Tastemy Pandit
Know what your zodiac sign says about your taste in food! Explore how the 12 zodiac signs influence your culinary preferences with insights from MyPandit. Dive into astrology and flavors!
SATTA MATKA SATTA FAST RESULT KALYAN TOP MATKA RESULT KALYAN SATTA MATKA FAST RESULT MILAN RATAN RAJDHANI MAIN BAZAR MATKA FAST TIPS RESULT MATKA CHART JODI CHART PANEL CHART FREE FIX GAME SATTAMATKA ! MATKA MOBI SATTA 143 spboss.in TOP NO1 RESULT FULL RATE MATKA ONLINE GAME PLAY BY APP SPBOSS
AI Transformation Playbook: Thinking AI-First for Your BusinessArijit Dutta
I dive into how businesses can stay competitive by integrating AI into their core processes. From identifying the right approach to building collaborative teams and recognizing common pitfalls, this guide has got you covered. AI transformation is a journey, and this playbook is here to help you navigate it successfully.
2. Chapter objectives
• After studying this lesson, you should be able to:
– Define the basic concepts in LP;
– Formulate Linear Programming Problem
– Identify the characteristics of linear programming problem
– Make a graphical analysis of the linear programming problem
– Solve the problem graphically
– Understand the basics of simplex method
– Explain the simplex calculations
– Describe various solutions of Simplex Method
– Understand Big-M method
– Realize the special cases of LP model;
– Perform sensitivity analysis of an LP model
– Understand the Dual Linear programming Problem
– Formulate and solve the Dual Problem
2
3. 2.1. INTRODUCTION
• In 1947, George Danzig developed the use of
algebra for determining solutions to problems that
involved the optimal allocation of scarce
resources.
• In spite of numerous potential applications in
business, response to this new technique was low
due to substantial computational burden, which is
now removed with subsequent advances in
computer technology and related software during
the last three decades.
3
4. Cont’d
• The term linear implies that all the mathematical
relations used in the problem are linear or straight-line
relations.
• The term programming refers to the method of
determining a particular program or plan of action, i.e.,
the use of algorithms that is a well defined sequence of
steps that will lead to an optimal solution.
• Taken as a whole, the term linear programming refers
to a family of mathematical techniques for
determining the optimum allocation of resources and
obtaining a particular objective when there are
alternative uses of the limited or constrained
resources.
4
5. 2.2. CHARACTERISTICS OF LPM
• Linear programming models are mathematical
representations of LP problems.
• Linear programming models have certain characteristics in
common.
• Knowledge of these characteristics enables us to recognize
problems that are amenable to a solution using LP models,
and to be able to correctly formulate an LP model.
• These characteristics can be grouped as components and
assumptions.
• The components relate to the structure of a model, where as
the assumptions reveal the conditions under which the
model is valid.
5
6. 2.1.1. COMPONENTS OF LP MODELS
• There are four major components of LP models
including: Objective function, decision variables,
constraints and parameters.
1. Objective and Objective Function-The objective in
problem solving is the criterion by which all decisions
are evaluated.
• Because we are dealing with optimization, the objective
will be either maximization or minimization.
• Hence, every LP problem will be either maximization or
a minimization problem.
• An LP model consists of a mathematical statement of
the objective called the objective function.
6
7. Cont’d
2. Decision variables- They represent unknown quantities to be
solved for.. For example, how much of each product should
be produced in order to obtain the greatest profit?
3. Constraints- However, the ability of a decision maker to
select values of the decision variables in an LP problem is
subject to certain restrictions or limits coming from a variety
of sources.
– The restrictions may reflect availabilities of resources
(e.g., raw materials, labor time, etc.), legal or contractual
requirements (e.g., product standards, work standards,
etc.), technological requirements (e.g., necessary
compressive strength or tensile strength) or they may
reflect other limits based on forecasts, customer orders,
company policies, and so on.
7
8. Cont’d
In LP model, the restrictions are referred to as constraints.
Only solutions that satisfy all constraints in a model are
acceptable and are referred to as feasible solutions.
The optimal solution will be the one that provides the best
value for the objective function.
• Constraints can be arranged into three groups:
– System constraints – involve more than one decision
variable,
– Individual constraints – involve only one variable,
and
– Non-negativity constraints – specify that no variable
will be allowed to take on a negative value. The non-
negativity constraints typically apply in an LP model,
whether they are explicitly stated or not.
8
9. Cont’d
4. Parameters- The objective function and the
constraints consist of symbols that represent the
decision variables (e.g., X1, X2, etc.) and
numerical values called parameters.
• The parameters are fixed values that specify the
impact that one unit of each decision variable will
have on the objective and on any constraint it
pertains to as well as the numerical value of each
constraint.
• The following simple example illustrates the
components of LP models:
9
11. 2.1.2 ASSUMPTIONS OF LP MODELS
• A linear programming model is valid under the following
assumptions:
• 1. Linearity (proportionality)
• The linearity requirement is that each decision variable has a linear
impact on the objective function and in each constraint in which it
appears.
• In terms of a mathematical model, a function or equation is linear
when the variables included are all to the power 1 (not squared,
cubed, square root, etc.) and no products (e.g., x1x2) appear.
• On the other hand, the amount of each resource used (supplied) and
its contribution to the profit (or cost) in the objective function must
be proportional to the value of each decision variable.
• For example, if production of one unit requires 5 hours of a
particular resource, then making 3 units of that product requires 15
hours (3x5) of that resource.
11
12. 2. Divisibility (Continuity)
• The divisibility requirement pertains to potential values of
decision variables.
• It is assumed that non-integer values are acceptable.
However, if the problem concerns, for example, the optimal
number of houses to construct, 3.5 do not appear to be
acceptable.
• Instead, that type of problem would seem to require strictly
integer solutions. In such cases, integer-programming
methods should be used. It should be noted, however, that
some obvious integer type situations could be handled under
the assumption of divisibility.
• For instance, suppose 3.5 to be the optimal number of
television sets to produce per hour, which is unacceptable,
but it would result in 7 sets per two hours, which would
then be acceptable.
12
13. 3. Certainty
• -This requirement involves two aspects of LP models.
• One aspect relates to the model parameters, i.e., the
numerical values. It is assumed that these values are
known and constant.
• In practice, production times and other parameters may
not be truly constant. Therefore, the model builder must
make an assessment as to the degree to which the
certainty requirement is met.
• Large departures almost surely will have a significant
effect on the model.
• The other aspect is the assumption that all relevant
constraints have been identified and represented in the
model.
13
14. 5. Non-negativity
• -It assumes that negative values of variables
are unrealistic and, therefore, will not be
considered in any potential solutions.
• Only positive values and zero will be allowed
and the non-negativity assumption is inherent
in LP models.
• For example X=-12, can’t be a solution as it
doesn’t give any meaning as negative number
of units can’t be produced
14
15. 2.3. SOLVING LP MODELS
• Linear programming model can be solved by
either of:
• Graphical method or
• Simplex or algebraic method
15
16. 2.3.1.GRAPHICAL METHODS
• Graphical linear programming is a relatively straightforward for
determining the optimal solution to certain linear programming
problems involving only two decision variables.
• Although graphic method is limited as a solution approach, it is very
useful in the presentation of LP, in that it gives a “picture” of how a
solution is derived thus a better understanding of the solution.
• Moreover, graphical methods provide a visual portrayal of many
important concepts.
• In this method, the two decision variables are considered as ordered
pairs (X1, X2), which represent a point in a plane, i.e, X1 is
represented on X-axis and X2 on Y-axis.
• Graphical method has the following advantages:
– It is simple
– It is easy to understand, and
– It saves time.
16
17. STEPS IN GRAPHICAL SOLUTION METHODS
Step 1. Formulate the LPM of the problem
Steps in formulating LP models:
a)Identify the decision variables.
b)Determine the objective function.
c)Identify the constraints.
d)Build and validate the model.
Step 2. Plot each of the constraints on the graph
Step 3. Identify the feasible region -The feasible region is the
solution space that satisfies all the constraints simultaneously.
Step 4. Locate the optimal solution- Graphic approach to find
a solution for LP model consisting of only two decision
variables:
a) The extreme point enumeration method
b) The objective (Iso-profit or cost) function line approach
17
18. Formulating the LPM of the Problem
• Example1
• ABC Company is to start a production of two spare parts. The
production manager would like to produce so many parts to
earn per unit profit of Birr 60 from the sale of type I and Birr 50
from the sale of type II parts. However, the total available time
to assemble the items, to inspect them and the space for their
storage is limited to 100 hours, 22 hours and 39 square feet
respectively. Four hours of assembly time, two hours of
inspection time and three square feet of storage space is
required to produce each unit of type I spare part. On the other
hand 10 hours of assembly time, 1 hour of inspection time and
3 square feet of storage space is needed to produce each unit of
type II spare parts. How many of each item should the
Company produce and sale to maximize its profit?
• Required: Formulate the LPM of the Problem
18
19. Example 2
• An individual investor has Birr 70,000 to divide among several investments.
The alternative investments are municipal bonds with an 8.5% return,
certificates of deposits with a 10% return, Treasury bill with a 6.5% return, and
income bonds with a 13% return. The amount of time until maturity is the same
for each alternative. However, each investment alternative has a different
perceived risk to the investor; thus it is advisable to diversify. The investor
wants to know how much to invest in each alternative in order to maximize the
return. The following guidelines have been established for diversifying the
investment and lessening the risk perceived by the investor.
– No more than 20% of the total investment should be in an income bonds.
– The amount invested in certificates of deposit should not exceed the amount
invested in other three alternatives.
– At least 30% of the investment should be in treasury bills and certificates of
deposits.
– The ratio of the amount invested in municipal bonds to the amount invested in
treasury bills should not exceed one to three.
– The investor wants to invest the entire Birr 70,000.
• Required: Formulate a LP model for the problem.
19
20. Example 3:
• A chemical corporation produces a chemical mixture for the
customer in 1000- pound batches. The mixture contains three
ingredients- Zinc, mercury and potassium. The mixture must
conform to formula specifications (i.e., a recipe) supplied by a
customer. The company wants to know the amount of each
ingredient to put in the mixture that will meet all the requirements of
the mix and minimize total cost.
• The customer has supplied the following formula specifications for
each batch of mixture.
1. The mixture must contain at least 200 lb of mercury
2. The mixture must contain at least 300 lb of zinc
3. The mixture must contain at least 100 lb of potassium
• The cost per pound of mixture is Birr4, of zinc Birr 8 and of
potassium Birr 9.
• Required: Formulate LPM for the problem
20
21. 1.MAXIMIZATION CASE
• Example 1 of the previous example 1
• After formulating the LPM of the Problem,
the next steps will be:
• Plotting each constraints on the graph, then
• Identifying the feasible solution and finally
• Locating optimal solution
21
23. Figure 2-1 Feasible Region Based on a Plot of the First Constraint
(assembly time) and the Non-negativity Constraint
23
24. Figure 2–2 A Completed Graph of the Server Problem
Showing the Assembly and Inspection Constraints and the
Feasible Solution Space
24
25. Figure 2–3 Completed Graph of the Server Problem
Showing All of the Constraints and the Feasible Solution Space
25
26. Finding the Optimal Solution
• The extreme point approach
– Involves finding the coordinates of each
corner point that borders the feasible
solution space and then determining
which corner point provides the best value
of the objective function.
– The extreme point theorem
– If a problem has an optimal solution at
least one optimal solution will occur at a
corner point of the feasible solution
space.
26
27. The Extreme Point Approach
1. Graph the problem and identify the feasible
solution space.
2. Determine the values of the decision variables
at each corner point of the feasible solution
space.
3. Substitute the values of the decision variables at
each corner point into the objective function
to obtain its value at each corner point.
4. After all corner points have been evaluated in a
similar fashion, select the one with the highest
value of the objective function (for a
maximization problem) or lowest value (for a
minimization problem) as the optimal solution.
27
28. Figure 2–5 Graph of Server Problem with Extreme
Points of the Feasible Solution Space Indicated
28
30. SLACK VERSUS SURPLUS
• Slack is the amount of a scarce resource that is unused by a given
solution. Slack can potentially exist in a < constraint.
– Slack variables are considered in the objective function by using a
coefficient of zero for each of them. When all the constraints are
written as equalities after adding a slack variable to each of them, the
linear program is said to be in standard form.
• Surplus on the other hand is the amount by which the optimal
solution causes a > constraint to exceed the required minimum
amount. It can be determined in the same way that slack can, i.e.,
substitute the optimal values of the decision variables into the left
side of the constraint and solve.
– The difference between the resulting value and the original right hand
side amount is the amount of surplus.
– Surplus should also be accounted for in the objective function by using
coefficients of zero likewise.
30
31. Table 3–5 Computing the Amount of Slack for the
Optimal Solution to the Server Problem
31
32. 2.MINIMIZATION CASE
• Minimize Z with inequalities of constraints in > form
• Example:
• Suppose that a machine shop has two different types of
machines; machine 1 and machine 2, which can be used to
make a single product .These machines vary in the amount
of product produced per hr., in the amount of labor used
and in the cost of operation.
• Assume that at least a certain amount of product must be
produced and that we would like to utilize at least the
regular labor force. How much should we utilize each
machine in order to utilize total costs and still meets the
requirement?
32
36. Figure 2–8 A Comparison of Maximization and
Minimization Problems
36
37. 3. MIXED CONSTRAINT CASE
• It is only in some cases that the maximization problems consist of constraints
connected to the RHS value with only <. By the same token, constraints of
minimization problems are not always connected to their RHS with>. This is to
mean that both maximization and minimization problems may consist of constraints
connected to RHS with a mix of algebraic signs ( <, >, =).
•
Example
Minimize Z=1500x+2400y
Subjected to:
4x+Y>24 …I
2x+3y>42 …II
X+4y>36 …III
X<14 …IV
y<14 …V
x, y>0
37
40. Exercise
1. Formulate the LP
ABC Furniture manufacturer produces two products: Beds and
Chairs. Each unit of Bed requires 3 hrs in molding unit, 4hrs in
painting unit, and 1 hr in finishing. On the other hand, each unit of
Chair requires 3 hrs in molding unit, 2 hrs in the paint shop and 2
hours in finishing. Each week, there are 210 hrs available in molding,
200hrs in painting, and 120 hrs in finishing unit. The demand for
Beds cannot exceed 40 units per week. Each unit of Bed contributes
Birr 20 to profit, while each unit of chair contributes Birr 30.
2. Maximize Z 3x + 4y
S.T.
5x + 4y ≤ 200
3x + 5y ≤ 150
5x + 4y ≤ 100
8x + 4y ≤ 80
X,y ≥ 0 40
3. Minimize Z: 10x + 4y
S.T.
3x + 6y ≥ 250
15x + y ≥ 150
2x + 9y ≥ 200
X,y ≥ 0
41. 2.3.2.Some Special Issues
a) No Feasible/Infeasible Solutions
– Occurs in problems where to satisfy one of the
constraints, another constraint must be violated.
41
In the graph, there is no
common point in the shaded
area.
All constraints cannot be
satisfied simultaneously and
there is no feasible solution to
the problem.
42. b) Unbounded Problems
– Exists when the value of the objective
function can be increased without limit.
42
Note
Here that the two corners of the region are
A(0,3) and .B(2,1). The value of Max Z(A)=6
and Max Z(B)=8. But there exist number of
points in the shaded region for which the
value of the objective function is more than 8.
For example, the point (10, 12) lies in the
region and the function value at this point is
70 which is more than 8.
Remark:
An unbounded solution does not
mean that there is no solution to the
given LPP, but implies that there exits
an infinite number of solutions.
43. c)Redundant Constraints
– A constraint that does not form a unique boundary of the
feasible solution space; its removal would not alter the
feasible solution space.
– If a constraint when plotted on a graph doesn’t form part
of the boundary making the feasible region of the
problem that constraint is said to be redundant.
43
Note:
The packaging hour’s constraint does
not form part of the boundary making
the feasible region.
Thus, this constraint is of no
consequence and is therefore, redundant.
The inclusion or exclusion of a
redundant constraint does not affect the
optimal solution of the problem.
44. d) Multiple Optimal Solutions
–Problems in which different combinations
of values of the decision variables yield the
same optimal value.
44
Both C and D are optimal
solutions. Any point on the line
segment CD will also lead to the
same optimal solution.
Multiple optimal solutions
provide more choices for
management to reach their
objectives.
45. 2.3.2.THE SIMPLEX APPROACH
• The graphical approach is useful in solving linear
programming models having only two variables.
• When the model has more than two variables, the
appropriate approach is the Simplex procedure.
• It begins with a feasible solution which is not
optimal, and the solution is improved through
continuous algebraic manipulations (iterations) until
the optimal solution is determined.
45
46. Cont’d
• The graphical method to solving LPPs provides fundamental
concepts for fully understanding the LP process. However,
the graphical method can handle problems involving only
two decision variables (say X1 and X2).
• Simplex Method which is an efficient approach to solve
applied problems containing numerous constraints and
involving many variables that cannot be solved by the
graphical method.
• The simplex method is an ITERATIVE or “step by step”
method or repetitive algebraic approach that moves
automatically from one basic feasible solution to another
basic feasible solution improving the situation each time until
the optimal solution is reached at.
46
47. STEPS IN SIMPLEX APPROACH
• Step1. Formulate the linear programming model of the
real world problem
• Step2. Express the mathematical model of L.P. problem
in the standard form
• Step 3. Set up the initial simplex tableau
• Step 4.Check if the current solution is optimum or not.
• Step 5. Further iterate towards an optimum solution.
• Step 6. Repeat Step3-5 until optimal solution is reached
47
48. A.MAXIMIZATION CASE
Let us take the example of a spare part production
problem
– Step 1 Formulate LPP Model
– Step 2 Standardize the problem
i.e. Convert constraint inequality into equality
form by introducing a variable called Slack variable.
• Slack Variables:
–A slack variable(s) is added to the left hand
side of a < constraint to covert the constraint
inequality in to equality.
48
49. Cont’d
– The value of the slack variable shows unused resource.
– Slack variables represent unused resource or idle capacity.
– Thus, they don’t produce any product and their contribution
to profit is zero.
– A slack variable emerges when the LPP is a maximization
problem.
– Slack variables are added to the objective function with zero
coefficients.
– Let that s1, s2, and s3 are unused labor, machine and
marketing hrs. respectively.
49
50. 50
Example: Taking the microcomputer problem its
standard form is as follows:
Solve the problem using the simplex approach
Zmax = 60X1 + 50X2
4X1 + 10X2 100
2X1 + X2 22
3X1 + 3X2 39
X1, X2 0
The standard form is:
52. Cont’d
– To represent the data, the simplex method uses a
table called the simplex table or the simplex
matrix.
– In constructing the initial simplex tableau, the
search for of the optimal solution begins at the
origin. Indicating that nothing can be produced;
– Thus, first assumption, No production implies
that x1 =0 and x2=0
52
54. Step 3. Construct the initial tableau
The initial tableau always represents the “Do Nothing”
strategy, so that the decision variables are initially non-
basic.
• List the variables across the top of the table and write the
objective function coefficient of each variable jut above
it.
• There should be one row in the body of the table for each
constraint.
• List the slack variables in the basis column, one per raw.
• In the Cj column, enter the objective function coefficient
of zero for each slack variable. (Cj - coefficient of
variable in the objective function)
• Compute values for row Zj
• Computer values for Cj – Zj.
54
56. Interpretation
• Cj = the coefficient of the variables in the
objective function in the standard form.
• Cb = the coefficient of basic variables in the obj.
fun.
• X1, X2, ..Xn = decision variables .
• S1, s2, Sn = basic variables (slack).
• a11, a12,… coefficient of DV in the constraint set.
• 1, 0, 1 are coefficient of basic variables in the
constraints set.
• RHSV = the right hand side value of the
constraints.
56 56
58. Evaluate, the initial Tableau, does it optimal or
not?
58
Based on the above explanation it is not optimal:
Current Solution is x1= X2 =0, and S1= 100, S2= 22
and S3 =39
Decision: S2 departing and X1 is entering variable
59. Step 4.
• Choose the “incoming” or “entering” variables
• Note:
The entering variable is the variable that has the
most positive value in the Cj - Zj row also called as
indicator row.
Or the entering variable is the variable that has the
highest contribution to profit per unit.
a) X1 in our case is the entering variable
b) The column associated with the entering
variable is called key or pivot column ( X1
column in our case )
59
60. Step 5
• Choose the “leaving “or “outgoing” variable
• In this step, we determine the variable that will leave the solution for X1 (or
entering variable)
Note:
– The row with the minimum or lowest positive (non-negative)
replacement ratio shows the variable to leave the solution.
Replacement Ratio (RR) = Solution Quantity (Q)
Corresponding values in pivot column
Note: RR>0
– The variable leaving the solution is called leaving variable or outgoing
variable.
– The row associated with the leaving variable is called key or pivot row
(s3 column in our case)
– The element that lies at the intersection of the pivot column and pivot
row is called pivot element(No 2 in our case)
60
61. Step 6: Develop subsequent tableaus
• Repeat step 3-5 till optimum basic feasible solution is
obtained.
Or: repeat step 3-5 till no positive value occurs in the Cj - Zj
row.
• Note:
o Divide each element of the pivot row by the pivot element
to find new values in the key or pivot row.
o Perform row operations to make all other entries for the
pivot column equal to zero.
Raw operation= old Raw Value – Key column Value (New raw
value
61
64. Cont’d
• Since all the Cj - Zj < 0 optimal solution is
reached at
X1 = 9
X2 = 4
S1 = 24 hrs
Z = Birr 740
• “A simplex solution is a maximization problem is
optimal if the Cj – Zj row consists entirely of
zeros and negative numbers (i.e., there are no
positive values in the bottom row).”
64
65. B.MINIMIZATION PROBLEMS
• There are two methods to solve minimization LP problems:
1. Direct method/Big M-method/
–Using artificial variables
2. Conversion method
–Minimization by maximizing the dual
• Surplus Variable (-s):
A variable inserted in a greater than or equal to constraint
to create equality. It represents the amount of resource
usage above the minimum required usage.
Surplus variable is subtracted from a > constraint in the
process of converting the constraint to standard form.
Neither the slack nor the surplus is negative value. They
must be positive or zero. 65
66. Cont’d
• Example:
• 2x1+x2 < 40 ==>is a constraint inequality
x1= 12 and x2= 11==> 2x1+x2+s = 40 ==>2(12)+11+s= 40
==> s=5 unused resource
• 5x1+3x2 < 45
x1= 12 and x2= 11==> 5x1+3x2+s= 45 ==>5(12)+3(11)+s = 45
==> s=0 unused resource (No idle resource)
• 5x1+2x2 >20
x1= 4.5 and x2= 2==> 5x1+2x2- s = 20 ==>5(4.5)+2(2)-s = 20
==> s=6 unused resource
• 2x1+x2 >40
x1= 0 and x2= 0(No production)==> 5x1+2x2- s = 20 ==>5(4.5)+2(2)-s= 20
==> s=-6 (This is mathematically unaccepted)
66
67. Artificial variable
• Thus, in order to avoid the mathematical contradiction,
we have to add artificial variable (A)
• Artificial variable is a variable that has no
meaning in a physical sense but acts as a tool to
create an initial feasible LP solution.
• Note:
Type of constraint To put into
standard form
< --------------------------------------------- Add a
slack variable
= ---------------------------------------------Add an artificial
variable
> ---------------------- Subtract a surplus variable and add
artificial variable 67
68. Big M-Method
• The Big-M Method is a method which is used in
removing artificial variables from the basis.
• In this method; we assign coefficients to artificial
variables, undesirable from the objective function
point of view.
• If objective function Z is to be minimized, then a
very large positive price (called penalty) is
assigned to each artificial variable.
• Similarly, if Z is to be maximized, then a very
large negative price (also called penalty) is
assigned to each of these variables.
68
69. Characteristics of Big-M Method:
A. High penalty cost (or profit) is assumed as M
B. M is assigned to artificial variable A in the objective function Z.
C. Big-M method can be applied to minimization as well as maximization
problems with the following distinctions:
– Minimization problems
-Assign +M as coefficient of artificial variable A in the objective function
Z
– Maximization problems:
-Here –M is assigned as coefficient of artificial variable A in the objective
function Z
D. Coefficient of S (slack/surplus) takes zero values in the objective function
Z
E. For minimization problem, the incoming variable corresponds to the
highest negative value of Cj-Zj.
F. Solution is optimal when there is no negative value of Cj-Zj.(For
minimization case)
69
72. Cont’d
Initial simplex tableau
72
Note:
Once an artificial variable has left the basis, it has served its purpose and can therefore
be removed from the simplex tableau. An artificial variable is never considered for re-
75. Cont’d
Cj - Zj > 0==>Optimal solution is reached
X1=5/2
X2=10/3 and
MinZ=162.5
Note:
As long as an “A” variable is available in the solution
variable column, the solution is infeasible.
75
76. C.MAXIMIZATION WITH MIXED
CONSTRAINTS
• The simplex method requires that all the
constraints be in standard form.
• Constraints that are ≤ can be put in to standard
form by adding a slack variable in the constraint.
• Constraints with ≥or = sign are handled a bit
differently.
76
77. Cont’d
• To change equality constraints to standard form
add artificial variables
• To convert this inequality to standard form
subtract surplus variable first and add artificial
variable
77
78. Solve using simplex method
Maximize Z= 6X + 8Y
Subject to:
Y ≤4
X+ Y =9
6X+2Y ≥ 24
X, Y ≥ 0
78
79. In standard form
Max! 6X + 8Y + 0S1 + 0S3 – MA2 – MA3
Subject to: Y+ S1 = 4
X+Y + A2 = 9
6X+ 2Y –S3 + A3 = 24
All variables ≥ 0
79
88. 2.4. POST OPTIMALITY ANALYSIS
• Carried out after the optimal solution is
found
• Is begins with the final simplex tableau
• There are two scenarios in this case
–Duality and
–Sensitivity analysis
88
89. 2.4.1. Sensitivity Analysis
• Sensitivity analysis carries the LP analysis beyond the
determination of the optimal solution and begins with
the final simplex tableau.
• Its purpose is to explore how changes in any of the
parameters of a problem, such as the coefficients of the
constraints, coefficients of the objective function, or the
right hand side values; would affect the solution.
• For this, instead of resolving the entire problem as a
new problem with new parameters, we may consider
the original optimal solution as an initial solution for
the purpose of knowing the ranges, both lower and
upper, within which a parameter may assume a value.
89
90. a) A change in the RHS of a constraints
• Simultaneous changes are not contemplated
• Change in RHS or Q of one constraint is considered at a time
• The range of feasibility is the range over which the RHS value of a
constraint can be changed and still have the same shadow prices.
• Starts with Considering shadow price
• Shadow price: is a marginal value; it indicates the impact that a
one unit change in the value of the constraint would have on the
value of the objective function.
• Shadow prices are the values in the Zj-row of slack columns
90
91. Determining Range of Feasibility: How?
Feasibility Ratio (FR) = quantity ÷ respective slack variable coefficient:
in the final optimal solution tableau
The determine the range of feasibility according to the following rule
The effect of a RHS change on the objective function depends on whether the change
leads to relaxation or tightening of the constraint
≤ ≥
Allowable RHS increase The negative FR closest to zero Smallest positive FR
Allowable RHS decrease Smallest positive FR The negative FR closest to
zero
91
92. Coun’t…
• Relaxation of a constraint has favorable impact on the objective function.
• However, tightening has unfavorable impact on the objective function
92
93. Example
The LPM of the micro computer problem is:
Max Z: 60X1 + 50X2
Subject: Assembly time: 4X1 + 10X2 ≤100
Inspection time: 2X1 + X2≤22
Storage space: 3X1 + 3X2 ≤39
X1 and X2 ≥ 0
If the amount of assembly time was increased by one hour, there would
be no effect on profit; if the inspection time was increased by one hour,
the profit would have increased by $10, and if storage space was increased
by one cubic foot, profit would increase by $40/3. The reverse holds true.
one –unit decrease in inspection time would decrease profit by $10 since
its shadow price is $ 10.
93
94. Consider the previous optimal solution and compute
1. Compute the range of feasibility for the constraints in the above
illustration.
2. The manager in the above problem is contemplating one of two
possible changes in the level of the storage constraint. One change
would be an increase of 3 cubic feet in its level and another change
will be an increase of 8 cubic feet. Determine the revised optimal
solution for each possible change.
94
95. Example
3. Suppose the manager in the above problem is
contemplating a decrease in the storage space
due to an emergency situation. There are two
possibilities being considered, a decrease of 6
cubic feet and a decrease of 9 cubic feet; what
will be the impact on the optimal solution?
95
96. Determine the FR and range of feasibility for each CONS.
1. Recall the original value of the resources
Original value constraints S1 S2 S3
100 S1 1 6 -16/3
22 S2 0 -1 -1/3
39 S3 0 -1 2/3
2. Ratio = Q/respective slack values
S1= 24/1= 24 S2= 24/6= 4 S3= 24/-16/3= -4.5
9/0=undefined 9/-1= -9 9/-1/3= -27
4/0= undefined 4/-1= -4 4/2/3= 6
NB: If there is no suitable negative/positive FR, then the allowable
increase/decrease is ∞ (undefined)
96
97. 3. Find the range of feasibility
Constraints Original
value
Lower limit Upper limit Range of
feasibility
S1 100 100-24= 76 100+∞ 76-∞
S2 22 22-4= 18 22+4= 26 18-26
S3 39 39-6 = 33 39+4.5= 43.5 33-43.5
Therefore:
Constraint one (assembly line): 100-24 up to 100+∞= (76-∞)
Constraint two (inspection time): 22-4 up to 22-4= (18-26)
Constraint three (storage space): 39-6 up to 39+4.5= (33-43.5)
97
98. b) A change of coefficient of objective function
• Two cases
Case 1: Range of insignificance :
The range over which the non basic variables objective function
coefficient can change without making these variables entering in the
solution
Case 2. Range of optimality
The range over which the objective function coefficient of basic variables
can change without changing the optimal values i.e. without changing basic
and non basic variables but change the optimal function value.
98
99. Range of optimality
• Range of optimality is calculated for only original
decision variables because slack/surplus variables
and artificial variables do not have any contribution
for the objective function.
99
100. Cont’d
Determine the range of optimality for the following final simplex tableaue
Min Z = 10X1 + 3X2
Subject to:
2X1 + X2 ≥80
X1 + 4X2 ≥ 200
X1 and X2 ≥ 0
100
101. Range of Insignificance (RoI)
–The range over which a non-basic variable’s objective function
coefficient can change without causing that variable to enter in to
the solution mix is called its range of insignificance
–In a maximization problem if a variable is not currently in solution, its
objective function coefficient would have to increase by an amount
that exceeds the Cj –Zj value in order for it to enter as a basic
variable in the optimal solution. Any lesser value of its objective
function coefficient would keep it out of solution
–In a minimization problem if a variable is not in solution, its
objective function coefficient would have to decrease by an amount
that exceeds the Cj –Zj value for that variable in the final tableau in
order for it to enter as a basic variable in the optimal solution.
101
102. The final tableau of the above problem is:
Basic variable
10
X1
3
X2
0
S1
0
S2
r.h.s.
S2---0 0 0 -4 1 120
X2---3 2 1 -1 0 80
Zj 6 3 -3 0 160
Cj- Zj 4 0 3 0 240
102
103. Cont’d
• X1 is non-basic variable in this optimal table, so,
determine RoI for X1
Since the problem is minimization the objective
function coefficient of x1 must decrease by an
amount that exceeds 4 (i.e the Cj-Zj row
coefficient of x1 in the optimal table.)
• Therefore the range of insignificance for X1 is:
• Its current OF coefficient-4 up to its current of
coefficient + ∞
• 10 – 4 up to 10+ ∞: 6 - ∞
• Interpretation: The cost per unit of Product A
must be less than 6 before the company starts
manufacturing product A
103
104. 2.4.2.Duality
• Every LPP has another LPP associated with it, which is called its dual.
• The given problem is called the primal.
• The dual of a dual is the primal
104
Primal Dual
Objective is minimization Objective is maximization and vice
versa
> type constraints < type constraints
No of columns No of rows
No of rows No of columns
No of decision variables No of constraints
No of constraints No of decision variables
Coefficient of Object function RHS value
RHS value Coefficient of Object function