Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

A cargo plane can carry a maximum weight of 100 tons and a maximum volume of 60 cubic meters. There are three materials to be transported, and the cargo company may choose to carry any amount of each, up to the maximum available limits given below.

  • Material 1 has density 2tons/cubicmeters, maximum available amount 40 cubic meters, and revenue \(1,000 per cubic meter.
  • Material 2 has density 1ton/cubicmeters,maximum available amount 30 cubic meters, and revenue \)1,200 per cubic meter.
  • Material 3 has density 3tons/cubicmeters, maximum available amount 20 cubic meters, and revenue $12,000 per cubic meter.

Write a linear program that optimizes revenue within the constraints.

Short Answer

Expert verified

The aim of a linear programming is to optimize the operations according to the constraints. In our question, we need to optimize the revenue.

Step by step solution

01

Defining the variables of constraints

Let the first material given be: x1 and corresponding revenue=1000$/m3. So total revenue for x1will be=1000x1.

Let the second material given be: x2 and corresponding revenue=1200$/m3. So total revenue for x2will be=1200x2.

Let the third material given be: x3 and corresponding revenue=12000$/m3. So total revenue for x3will be=12000x3.

Now in the question, we have given ‘A cargo plane can carry a maximum weight of 100 tons’. So the constraint according it can be represented as:

2x1+x2+3x3100.

Also it is mention that, ‘: A cargo plane can carry and a maximum volume of 60 cubic meters’. This can be represented as:

x1+x2+x360.

02

Linear Programming

According to the given constraints, we have to maximize(optimize) our revenue:

Maximun:1000x1+1200x2+12000x32x1+x2+3x3100x140x230x320x1,x2,x30

This is our required linear program.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Question: A linear program for shortest path. Suppose we want to compute the shortest path from node s to node t in a directed graph with edge lengths le>0.

a) Show that this is equivalent to finding an s - tflow fthat minimizes elefesubject to size (f) = 1. There are no capacity constraints.

b) Write the shortest path problem as a linear program.

c) Show that the dual LP can be written as

role="math" localid="1659250472483" maxxs-xtxu-xvluvforall(u,v)E

d) An interpretation for the dual is given in the box on page 223. Why isn’t our dual LP identical to the one on that page?

Question: Duckwheat is produced in Kansas and Mexico and consumed in New York and California. Kansas produces 15 shnupells of duckwheat and Mexico 8. Meanwhile, New York consumes 10 shnupells and California 13. The transportation costs per shnupell are \(4 from Mexico to New York, \)1 from Mexico to California, \(2 from Kansas to New York, and \)3 and from Kansas to California. Write a linear program that decides the amounts of duckwheat (in shnupells and fractions of a shnupell) to be transported from each producer to each consumer, so as to minimize the overall transportation cost

The pizza business in Little Town is split between two rivals, Tony and Joey. They are each investigating strategies to steal business away from the other. Joey is considering either lowering prices or cutting bigger slices. Tony is looking into starting up a line of gourmet pizzas, or offering outdoor seating, or giving free sodas at lunchtime. The effects of these various strategies are summarized in the following payoff matrix (entries are dozens of pizzas, Joey’s gain and Tony’s loss).




TONY




Gourmet

Seating

Freesoda

JOEY

Lower price

+2

0

-3


BiggerSlices

_1

-2

+1

For instance, if Joey reduces prices and Tony goes with the gourmet option, then Tony will lose 2 dozen pizzas worth of nosiness to Joey.

What is the value of this game, and what are the optimal strategies for Tony and Joey?

Give an example of a linear program in two variables whose feasible region is infinite, but such that there is an optimum solution of bounded cost.

Write the dual to the following linear program.

maxx+y2x+y3x+3y5x,y0

Find the optimal solutions to both primal and dual LPs

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free