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

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.

Short Answer

Expert verified

Example 1:

x0y0

Example 2:

x0y0xy1

Step by step solution

01

Explain Linear Program

Linear program is used for optimization tasks that has constraints and the optimization criterion as linear functions. A linear program has the set of variables that needs to be assign with the real values to satisfy the linear inequalities and to minimize or maximize a given linear objective function.

02

Give an example of linear program

Example 1:

Consider two variablexandy. The linear program is as follows:

x0y0

Operation or requirement for the constraints :

minx,y(x+y)

The above solution is possible in bounded cost.

Example 2:

Consider the constraints as follows,

x0y0xy1

Operation required:

maxi,j(x2y)

Therefore, an example for the linear program of two variables were obtained.

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

Show that the change-making problem (Exercise) can be formulated as an integer linear program. Can we solve this program as an LP, in the certainty that the solution will turn out to be integral (as in the case of bipartite matching)? Either prove it or give a counterexample.

Consider the following linear program.

maximize 5x+3y

5x-2y0x+y7x5x0y0

Plot the feasible region and identify the optimal solution.

Hollywood. A film producer is seeking actors and investors for his new movie. There are n available actors; actori chargesSj dollars. For funding, there arem available investors. Investorj will providepj dollars, but only on the condition that certain actorsLj{1,2,...,n} are included in the cast (all of these actorsLj must be chosen in order to receive funding from investorrole="math" localid="1658404523817" j ).

The producer’s profit is the sum of the payments from investors minus the payments to actors. The goal is to maximize this profit.

(a) Express this problem as an integer linear program in which the variables take on values {0,1}.

(b) Now relax this to a linear program, and show that there must in fact be an integral optimal solution (as is the case, for example, with maximum flow and bipartite matching).

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 dual of maximum flow. Consider the following network with edge capacities

(a) Write the problem of finding the maximum flow from StoTas a linear program.

(b) Write down the dual of this linear program. There should be a dual variable for each edge of the network and for each vertex other than S,T.

Now we’ll solve the same problem in full generality. Recall the linear program for a general maximum flow problem (Section 7.2).

(c) Write down the dual of this general flow LP, using a variableyefor each edge and xufor each vertexus,t.

(d) Show that any solution to the general dual LP must satisfy the following property: for any directed path from in the network, the sum of the yevalues along the path must be at least 1.

(e) What are the intuitive meanings of the dual variables? Show that anystcut in the network can be translated into a dual feasible solution whose cost is exactly the capacity of that cut.

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