Consider the following network representation of a transportation problem. Des Moines 25 15 Jefferson 30 City Kansas 15 City 11 Omaha St. Louis 30 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. (a) Develop a linear programming model for this problem; be sure to define the variables in your model. Let X- amount shipped from Jefferson City to Des Moines X12- amount shipped from Jefferson City to Kansas City * amount shipped from Jefferson CRy to St. Louis X- amount shipped from Omaha to Des Moines Xa- amount shipped from Omaha to Kansas City X amount shipped from Omaha to St. Louis Min S.t. *12 *12 (b) Solve the inear program to determine the optimal solution. Amount Cost Jefferson City-Des Moines Jefferson City-Kansas City Jefferson City-St. Louis Omaha-Des Moines Omaha-Kansas City Omaha-St. Louis Total

Consider the following network representation of a transportation problem. Des Moines 25 15 Jefferson 30 City Kansas 15 City 11 Omaha St. Louis 30 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. (a) Develop a linear programming model for this problem; be sure to define the variables in your model. Let X- amount shipped from Jefferson City to Des Moines X12- amount shipped from Jefferson City to Kansas City * amount shipped from Jefferson CRy to St. Louis X- amount shipped from Omaha to Des Moines Xa- amount shipped from Omaha to Kansas City X amount shipped from Omaha to St. Louis Min S.t. 12 12 (b) Solve the inear program to determine the optimal solution. Amount Cost Jefferson City-Des Moines Jefferson City-Kansas City Jefferson City-St. Louis Omaha-Des Moines Omaha-Kansas City Omaha-St. Louis Total

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: After studying gross revenues of PQR Production Company over a 25-year period, you model the…

A: #include <cmath> //Needed for pow()#include <iostream> //Needed for cout#include…

Q: Refer to the following hypothetical situation to come up with a linear programming solution…

A: The first part will be hand written and the plot will be drawn in Excel only For 2nd part we have…

Q: Problem 4: With the same parameters as in Problem 2, but the additional parameters $n_1 = 4, n_2…

A: Task : Use Monte Carlo for sampling from distribution and averaging.

Q: Suppose that you want to solve the following quadratic formula in Julia: x = −b ± √(b2 − 4ac) /…

A: Input the coefficients:Read the values of coefficients a, b, and c from the user or another…

Q: Suppose we have the following functions to price bread and ingredients (in cents) fun breadPrice…

A: Stаndаrd ML (SML) is а generаl-рurроse mоdulаr funсtiоnаl рrоgrаmming lаnguаge with…

Q: There are n trading posts along a river numbered 1, 2, 3, ., n. At any of the posts you can rent a…

Q: A lucky draw is organized daily among all shoppers to select three shoppers. The shoppers drawn walk…

A: Program Approach: Importing necessary package Declaring the main class Declaring the static type…

Q: May you please solve quick within 20-40 minutes ? There are two types of personnel working in a…

A: Define three functions - checkEmployee, checkTitleScore, and checkLanguageLevel - that will be used…

Q: 25. N=P p +9 p+r' ƏN др ƏN ди ry ƏN ƏN ди p=u + vw, g = b +uw, r = w + uv. when u=2, v = 3, w = 4 y…

Q: A local merchant goes to a market to buy apples with 500 UM. They offer two types of apples: green…

A: Algorithm:Define the inequality constraint matrix and the right-hand side of the inequality…

Question

Consider the following network representation of a transportation problem.
Des Moines
25
15
Jefferson
30
City
Kansas
15
City
11
Omaha
St. Louis
30
Supplies
Demands
The supplies, demands, and transportation costs per unit are shown on the network.
(a) Develop a linear programming model for this problem; be sure to define the variables in your model.
Let
X- amount shipped from Jefferson City to Des Moines
X12- amount shipped from Jefferson City to Kansas City
* amount shipped from Jefferson CRy to St. Louis
X- amount shipped from Omaha to Des Moines
Xa- amount shipped from Omaha to Kansas City
X amount shipped from Omaha to St. Louis
Min
S.t.
*12
*12
(b) Solve the inear program to determine the optimal solution.
Amount
Cost
Jefferson City-Des Moines
Jefferson City-Kansas City
Jefferson City-St. Louis
Omaha-Des Moines
Omaha-Kansas City
Omaha-St. Louis
Total

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Please explain all sabpart. I will really upvote
Suppose you are in Canada's Thousand Islands National Park, and in one particular lake there are n small islands that park officials want to connect with floating bridges so that people can experience going between islands without a canoe. The cost of constructing a bridge is proportional to its length. Assume the distance between every pair of islands is given to you as a two dimensional matrix (an example of such a table for n = 8 islands is shown below). A B C Ꭰ E F G H A 240 210 340 280 200 345 120 B 240 265 175 215 180 185 155 C 210 265 - 260 115 350 435 195 Ꭰ 340 175 260 160 330 295 230 E 280 215 115 160 360 400 170 F 200 180 350 330 360 175 205 G 345 185 435 295 400 175 305 H 120 155 195 230 170 205 305 Design an algorithm for determining which bridges they should build to connect the islands at minimal cost. Write down the pseudocode and explain why your algorithm correctly computes the set of bridges of minimal cost. Analyze the runnning time of your algorithm.
You wish to drive from point A to point B along a highway minimizing the time that you are stopped for gas. You are told beforehand the capacity C of you gas tank in liters, your rate F of fuel consumption in liters/kilometer, the rate r in liters/minute at which you can fill your tank at a gas station, and the locations A = x1, ··· , B = xn of the gas stations along the highway. So if you stop to fill your tank from 2 liters to 8 liters, you would have to stop for 6/r minutes. Consider the following two algorithms: (a) Stop at every gas station, and fill the tank with just enough gas to make it to the next gas station. (b) Stop if and only if you don’t have enough gas to make it to the next gas station, and if you stop,fill the tank up all the way. For each algorithm either prove or disprove that this algorithm correctly solves the problem. Your proof of correctness must use an exchange argument.
Please help step by step with Program R (CS) with a final code for understanding thank you
pleaseee solve question 2 please
Knapsack 0/1 problem: Given N items where each item has some weight and profit associated with it and also given a bag with capacity W, [i.e., the bag can hold at most W weight in it]. The task is to put the items into the bag such that the sum of profits associated with them is the maximum possible. Given the problem is solved using a dynamic programming approach and the matrix derived is given below, answer the below set of questions by analyzing the DP matrix. weights = [2, 3, 4, 5], profits = [1, 2, 5, 6], Capacity W = 8 Capacity 2 3 Profits weights|0 1 2 5 16 14 |-> 5 10 0 O 10 1 2 3 4 0 O 0 1 1 0 1 0 1 O 10 1 2 2 2 5 2 O 15 50 1 356 6 O 1 3 6 18 00378 7 10 10 1 3 7 7 1 18
More and more seafood is being farm-raised these days. A model (differentialequation) used for the rate of change for a fish population, P(t) in farmingponds is given by P'(t) = b(1-(P(t)/Pm)) - hP(t) where b is the birth rate, PM is the maximum number of fish the pond cansupport, and h is the rate the fish are harvested. Write a python code that implements the Forward Euler method to solve thedifferential equation Suppose that the carrying capacity PM = 20, 000 fish with a birth rateof 6% and a harvesting rate of h = 0%, use your Python code to findand plot the numerical solution for the first 400 days for different valuesof y0. Pick y0 < 20, 000, y0 > 20, 000. Don’t forget to label all your plotswith x and y axes label, titles and legends. Use a time step ∆t = 0.1
Construct a graph to show how the time to complete the 10th car changes as the learning curve slope parameter is varied from 75% to 95%. The Mechanical Engineering department has a student team that is designing a formula car for national competition. The time required for the team to assemble the first car is 100 hours. Their improvement (or learning rate) is 0.8, which means that as output is doubled, their time to assemble a car is reduced by 20%. Use this information to determine, Solve, (a) the time it will take the team to assemble the 10th car. (b) the total time required to assemble the first 10 cars. (c) the estimated cumulative average assembly time for the first 10 cars. Solve by hand and by spreadsheet.
Rod cutting problem: A cutting factory buys long steel rods and then and cuts them into shorter rods, which it then sells. Each cut is free. The selling price is based on the length of the cut. The factory want to determine the best cuts in order to maximize its revenue. Below, the price that the factory can make for each length of rod is given. Determine the maximum revenue, rn, obtainable by cutting up the rod and selling the pieces using bottom-up dynamic-programming approach. Length, I 1 2 3 4 5 6 7 Price, pi 2 4 5 6 9 10 12 r5 = ?