--%>
Assignment Help - homework help

Sample Questions in Graphical Solution Procedure

Solved problems in Graphical Solution Procedure, sample assignments and homework

Questions: Minimize Z = 10x1 + 4x2

Subject to

3x1 + 2x2 ≥ 60

            7x1 + 2x2 ≥ 84

            3x1 +6x2 ≥ 72

x1 ≥ 0 , x2 ≥ 0

 

Answer

The first constraint 3x1 + 2x2 ≥ 60, can be written in form of equation

3x1 + 2x2 = 60

Place x1 =0, then x2 = 30

Place x2 =0, then x1 = 20

Then the coordinates are (0, 30) and (20, 0)

 

The second constraint 7x1 + 2x2 ≥ 84, can be written in form of equation

7x1 + 2x2 = 84

Place x1 =0, then x2 = 42

Place x2 =0, then x1 = 12

The coordinates then are (0, 42) and (12, 0)

 

The third constraint 3x1 +6x2 ≥ 72, can be written in form of equation

3x1 +6x2 = 72

Place x1 =0, then x2 = 12

Place x2 =0, then x1 = 24

Thus, coordinates are (0, 12) and (24, 0)

 

The graphical presentation is

 

 1485_Graphical Solution Procedure Sample Assignment.png 

 

The corner positions of feasible region are A, B, C and D. Thus the coordinates for the corner points are

A (0, 42)

B (6, 21) (Solve the two equations 7x1 + 2x2 = 84 and 3x1 + 2x2 = 60 to obtain the coordinates)

C (18, 3) Solve the two equations 3x1 +6x2 = 72 and 3x1 + 2x2 = 60 to obtain the coordinates)

D (24, 0)

 

We are given that Min Z = 10x1 + 4x2

At A (0, 42)

Z = 10(0) + 4(42) = 168

 

At B (6, 21)

Z = 10(6) + 4(21) = 144

 

At C (18, 3)

Z = 10(18) + 4(3) = 192

 

At D (24, 0)

Z = 10(24) + 4(0) = 240

 

The minimum value is calculated at the point B. Consequently Min Z = 144 and x1 = 6, x2 = 21

   Related Questions in Basic Statistics

  • Q : Problem on queuing diagram Draw a 

    Draw a queuing diagram for the systems below and describe them using Kendall’s notation: A) Single CPU system <

    		•
  • Q : Building Models Building Models • What

    Building Models • What do we need to know to build a model?– For model checking we need to specify behavior • Consider a simple vending machine – A custome rinserts coins, selects a beverage and receives a can of soda &bul

    		•
  • Q : Derived quantities in Queuing system

    Derived quantities in Queuing system: • λ = A / T, Arrival rate • X = C / T, Throughput or completion rate • ρ =U= B / T, Utilization &bu

    		•
  • Q : Define SPIN simulation modes SPIN: •

    SPIN: • SPIN generates C program that is the model checker – The pan verifier • Process Analyzer – Run the pan executable to do the model check

    		•
  • Q : Problems on ANOVA We are going to

    We are going to simulate an experiment where we are trying to see whether any of the four automated systems (labeled A, B, C, and D) that we use to produce our root beer result in a different specific gravity than any of the other systems. For this example, we would l

    		•
  • Q : Data Description 1. If the mean number

    1. If the mean number of hours of television watched by teenagers per week is 12 with a standard deviation of 2 hours, what proportion of teenagers watch 16 to 18 hours of TV a week? (Assume a normal distribution.) A. 2.1% B. 4.5% C. 0.3% D. 4.2% 2. The probability of an offender having a s

    		•
  • Q : Designing a system What are the

    What are the questions that comes into mind when designing a system?

    		•
  • Q : Problem on Model Checking Part (a).

    Part (a). Draw a state diagram for a car with the following state variables: D indicating whether the car is in drive; B indicating the brake pedal is depressed; G indicating the gas pedal is depressed; and M indicating whether the car is moving. (For example, the sta

    		•
  • Q : Define Utilization Law Utilization Law

    Utilization Law: • ρk = XK . SK = X . DK • Utilization of a resource is the fraction

    		•
  • Q : Define Service Demand Law

    Service Demand Law:• Dk = SKVK, Average time spent by a typical request obtaining service from resource k• DK = (ρk/X

    		•