# The Value of Supply Chain Network Design

This chapter is from the book

## Solving the Quantitative Aspects of the Problem Using Optimization

Because of the supply chain complexities and rich set of quantitative data we have discussed, mathematical optimization technology is the best way to sort through the various options, balance the trade-offs, determine the best locations for facilities, and support better decision making. The mathematical optimization relies on linear and integer programming.

One common misconception we see is that managers sometimes confuse having good data and a good reporting system with having an optimal supply chain. That is, they think that their investment in good data and reporting systems should equip them with the ability to complete network design analysis. (These systems are often called business intelligence systems.) But in reality, if your warehouses or factories are located in the wrong places, these reporting systems will not correct the situation or suggest new locations.

So although these systems do, in fact, generate good reports and allow managers to gain good insights, they do not lead to better designs for the supply chain. That is, they are not built to construct models of your supply chains to which you can apply mathematical optimization. At best, they may allow you to evaluate a small handful of alternatives, but in doing so, you have to define all the details of each of the alternatives. Optimization is a complementary, not competitive, technology that allows you to actually determine the best locations for your facilities. And you can let optimization do the heavy number crunching to determine the details of the alternatives (where to locate, what is made where, how product flows, which customer is served by which warehouse). And, in many cases, if the optimization is set up correctly, it will uncover ideas that you never thought about.

Of course, because these problems are of great strategic value to an organization and touch on many aspects of the business, there will be nonquantitative aspects you must consider. These nonquantifiable aspects are important and are discussed later in this chapter and throughout the book.

With all that said, solving the quantitative aspects of this problem with mathematical optimization is the key to coming up with the best answers. So, let’s start there.

To formulate a logical supply chain network model, you need to think about the following four elements:

• Objective
• Constraints
• Decisions
• Data

The objective is the goal of the optimization and the criteria we’ll use to compare different solutions. For example, the most common objective in strategic network design is to minimize cost. If our objective is to minimize cost, we can now compare two solutions and judge which one is better based on the cost. When the mathematical optimization engine is running, it searches for the solution with the lowest cost. So with this common example you can see that an optimization problem needs to have a quantifiable objective. It is important to point this out because we have encountered many situations in which supply chain managers say their objective is to “optimize their supply chain.” The appropriate response is to ask what exactly they want to optimize, or what criteria they will use to determine which of two solutions is better. For example, is the key criteria transportation cost, is it service, is it facilities costs, or something else? Later, we’ll discuss optimizing multiple objectives (as long as you can quantify them). And we will show methods for analyzing nonquantifiable factors such as risk and robustness, because these are also very important. But for now, we’ll start with one quantifiable objective. When we understand this one, we’ll be able to understand more detailed analysis later.

The constraints define the rules of a legitimate solution. For example, if you want to just minimize cost, it is probably best to not make any products, not ship anything, or have no facilities. A cost of zero is indeed the minimum; however, that’s clearly not realistic. So there are some logical constraints we must include such as the fact that you want to meet all the demand. There are also constraints that specify which products may be made where, how much production capacity is available, how close your warehouses must be to customers, and a variety of other details. In this step, you also want to be careful not to specify so many constraints that you prohibit the optimization from finding new and creative strategies.

The decisions (sometimes called decision variables) define what you allow the optimization to choose from. So in the optimization of the physical supply chain, the main decisions include how much product moves from one location to another, how many sites are picked, where those sites are, and what product is made in which location. But, certainly, there are other decisions as well. The allowable decisions cannot be separated from the constraints. For example, if you have existing warehouses, you may or may not be able to close some of these sites.

Finally, you must consider the data you have available to you. There may be factors you would like to consider in the optimization, but you do not have the data to support. In this case, you still need to figure out ways to make a good decision. This could include running multiple scenarios, considering approximate data, or adjusting the data you have. We will further discuss a variety of these techniques later in this text.

After you have thought about your problem in terms of the objective, constraints, decisions, and data, there are ways to translate this into a series of equations and then solve the problem using linear and integer programming techniques. This is also sometimes referred to as mixed integer programming (MIP)—the “mix” refers to a mix of linear and integer variables. We will cover what this means in more detail later in the book, and will also provide information on how these problems work. There are whole courses on MIP however, so we will cover the topic only as it relates to supply chain network design problems in this text.

One way to think about a MIP is to think of it as a series of steps that are influenced by the objective, the constraints, and the decision variables. That is, during the steps, the objective steers the solution to more favorable costs and avoids less favorable costs, the constraints set the rules and can prevent it from doing more of what it wants or can force it to do something that is not favorable to the objective, and the decision variables tell it what it is allowed to change. A nice benefit of MIPs is that they solve for all the decisions and consider all the constraints simultaneously. That is, this approach allows you to come up with the overall best solution for a given problem.

### InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

## Overview

Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

## Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

### Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

### Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

### Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

### Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

### Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

### Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

## Other Collection and Use of Information

### Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

### Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

### Do Not Track

This site currently does not respond to Do Not Track signals.

## Security

Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

## Children

This site is not directed to children under the age of 13.

## Marketing

Pearson may send or direct marketing communications to users, provided that

• Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
• Such marketing is consistent with applicable law and Pearson's legal obligations.
• Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
• Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

## Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

## Choice/Opt-out

Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

## Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

## Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

## Sharing and Disclosure

Pearson may disclose personal information, as follows:

• As required by law.
• With the consent of the individual (or their parent, if the individual is a minor)
• In response to a subpoena, court order or legal process, to the extent permitted or required by law
• To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
• In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
• To investigate or address actual or suspected fraud or other illegal activities
• To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
• To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
• To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.