Consider the LP problem of HAL computer considering the projects that should be started. Data related to each of the project tabulated.

Consider the following variables $x1,x2,........,x7$ ,

$xi={1 If project i is undertaken0 otherwise$

HAL has the following goals

Goal 1:

The total NPV of all chosen should be at least $$200$ million. Thus the constraint becomes,

$40x1+30x2+60x3+45x4+55x5+40x6+90x7≥200$

Goal 2:

The average probability of success for all projects chosen should be at least 0.75. Thus the constraint becomes,

$0.75x1+0.70x2+0.75x3+0.90x4+0.65x5+0.60x6+0.65x7≥0.75$

Goal 3:

The average growth rate of all projects chosen should be at least 15%. Thus the constraint becomes,

$20x1+16x2+12x3+8x4+18x5+18x6+19x7≥15$

Goal 4:

The total cost of all chosen project should be at most $1billion. Thus the constraint becomes,

$220x1+140x2+280x3+240x4+300x5+200x6+440x7≤1000$

Hence the LP is formulated as given below

Minimize, $0x1+0x2+0x3+0x4+0x5+0x6+0x7$

Subjected to the constraints,

$40x1+30x2+60x3+45x4+55x5+40x6+90x7≥2000.75x1+0.70x2+0.75x3+0.90x4+0.65x5+0.60x6+0.65x7≥0.7520x1+16x2+12x3+8x4+18x5+18x6+19x7≥15220x1+140x2+280x3+240x4+300x5+200x6+440x7≤1000$

$xi=0$ or $1$

From the above equations it is found that these set of constraints there is no feasible region. That is all constraints cannot be met. So assign a cost value incurred if any of the priorities or goal is not met. So, introduce the following deviational variables.

$Si−$ = Amount by which numerically under the $ith$ goal

$Si+$ = Amount by which numerically exceed the $ith$ goal

Hence the constraints become,

$40x1+30x2+60x3+45x4+55x5+40x6+90x7+S1+−S1−=2000.75x1+0.70x2+0.75x3+0.90x4+0.65x5+0.60x6+0.65x7+S2+−S2−=0.7520x1+16x2+12x3+8x4+18x5+18x6+19x7+S3+−S3−=15220x1+140x2+280x3+240x4+300x5+200x6+440x7+S4+−S4−=1000$

Giving lowest priority to goal 4 and highest priority to goal 1, assign weight to each goal

$P1>>P2>>P3>>P4$

Now, the goal is to minimize the deviation from each goal

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Chapter 4.16, Problem 13P

Chapter 4.17, Problem 1P

Students have asked these similar questions

Create 6 users: Don, Liz, Shamir, Jose, Kate, and Sal. Create 2 groups: marketing and research. Add Shamir, Jose, and Kate to the marketing group. Add Don, Liz, and Sal to the research group. Create a shared directory for each group. Create two files to put into each directory: spreadsheetJanuary.txt meetingNotes.txt Assign access permissions to the directories: Groups should have Read+Write access Leave owner permissions as they are “Everyone else” should not have any access Submit for grade: Screenshot of /etc/passwd contents showing your new users Screenshot of /etc/group contents showing new groups with their members Screenshot of shared directories you created with files and permissions

⚫ your circuit diagrams for your basic bricks, such as AND, OR, XOR gates and 1 bit multiplexers, ⚫ your circuit diagrams for your extended full adder, designed in Section 1 and ⚫ your circuit diagrams for your 8-bit arithmetical-logical unit, designed in Section 2. 1 An Extended Full Adder In this Section, we are going to design an extended full adder circuit (EFA). That EFA takes 6 one bit inputs: aj, bj, Cin, Tin, t₁ and to. Depending on the four possible combinations of values on t₁ and to, the EFA produces 3 one bit outputs: sj, Cout and rout. The EFA can be specified in principle by a truth table with 26 = 64 entries and 3 outputs. However, as the EFA ignores certain inputs in certain cases, it is easier to work with the following overview specification, depending only on t₁ and to in the first place: t₁ to Description 00 Output Relationship Ignored Inputs Addition Mode 2 Coutsjaj + bj + Cin, Tout= 0 Tin 0 1 Shift Left Mode Sj = Cin, Cout=bj, rout = 0 rin, aj 10 1 1 Shift Right…

Show the correct stereochemistry when needed!! mechanism: mechanism: Show the correct stereochemistry when needed!! Br NaOPh diethyl ether substitution

Chapter 4 Solutions

Operations Research : Applications and Algorithms

Ch. 4.1 - Prob. 1P Ch. 4.1 - Prob. 2P Ch. 4.1 - Prob. 3P Ch. 4.4 - Prob. 1P Ch. 4.4 - Prob. 2P Ch. 4.4 - Prob. 3P Ch. 4.4 - Prob. 4P Ch. 4.4 - Prob. 5P Ch. 4.4 - Prob. 6P Ch. 4.4 - Prob. 7P

Ch. 4.5 - Prob. 1P Ch. 4.5 - Prob. 2P Ch. 4.5 - Prob. 3P Ch. 4.5 - Prob. 4P Ch. 4.5 - Prob. 5P Ch. 4.5 - Prob. 6P Ch. 4.5 - Prob. 7P Ch. 4.6 - Prob. 1P Ch. 4.6 - Prob. 2P Ch. 4.6 - Prob. 3P Ch. 4.6 - Prob. 4P Ch. 4.7 - Prob. 1P Ch. 4.7 - Prob. 2P Ch. 4.7 - Prob. 3P Ch. 4.7 - Prob. 4P Ch. 4.7 - Prob. 5P Ch. 4.7 - Prob. 6P Ch. 4.7 - Prob. 7P Ch. 4.7 - Prob. 8P Ch. 4.7 - Prob. 9P Ch. 4.8 - Prob. 1P Ch. 4.8 - Prob. 2P Ch. 4.8 - Prob. 3P Ch. 4.8 - Prob. 4P Ch. 4.8 - Prob. 5P Ch. 4.8 - Prob. 6P Ch. 4.10 - Prob. 1P Ch. 4.10 - Prob. 2P Ch. 4.10 - Prob. 3P Ch. 4.10 - Prob. 4P Ch. 4.10 - Prob. 5P Ch. 4.11 - Prob. 1P Ch. 4.11 - Prob. 2P Ch. 4.11 - Prob. 3P Ch. 4.11 - Prob. 4P Ch. 4.11 - Prob. 5P Ch. 4.11 - Prob. 6P Ch. 4.12 - Prob. 1P Ch. 4.12 - Prob. 2P Ch. 4.12 - Prob. 3P Ch. 4.12 - Prob. 4P Ch. 4.12 - Prob. 5P Ch. 4.12 - Prob. 6P Ch. 4.13 - Prob. 2P Ch. 4.14 - Prob. 1P Ch. 4.14 - Prob. 2P Ch. 4.14 - Prob. 3P Ch. 4.14 - Prob. 4P Ch. 4.14 - Prob. 5P Ch. 4.14 - Prob. 6P Ch. 4.14 - Prob. 7P Ch. 4.16 - Prob. 1P Ch. 4.16 - Prob. 2P Ch. 4.16 - Prob. 3P Ch. 4.16 - Prob. 5P Ch. 4.16 - Prob. 7P Ch. 4.16 - Prob. 8P Ch. 4.16 - Prob. 9P Ch. 4.16 - Prob. 10P Ch. 4.16 - Prob. 11P Ch. 4.16 - Prob. 12P Ch. 4.16 - Prob. 13P Ch. 4.16 - Prob. 14P Ch. 4.17 - Prob. 1P Ch. 4.17 - Prob. 2P Ch. 4.17 - Prob. 3P Ch. 4.17 - Prob. 4P Ch. 4.17 - Prob. 5P Ch. 4.17 - Prob. 7P Ch. 4.17 - Prob. 8P Ch. 4 - Prob. 1RP Ch. 4 - Prob. 2RP Ch. 4 - Prob. 3RP Ch. 4 - Prob. 4RP Ch. 4 - Prob. 5RP Ch. 4 - Prob. 6RP Ch. 4 - Prob. 7RP Ch. 4 - Prob. 8RP Ch. 4 - Prob. 9RP Ch. 4 - Prob. 10RP Ch. 4 - Prob. 12RP Ch. 4 - Prob. 13RP Ch. 4 - Prob. 14RP Ch. 4 - Prob. 16RP Ch. 4 - Prob. 17RP Ch. 4 - Prob. 18RP Ch. 4 - Prob. 19RP Ch. 4 - Prob. 20RP Ch. 4 - Prob. 21RP Ch. 4 - Prob. 22RP Ch. 4 - Prob. 23RP Ch. 4 - Prob. 24RP Ch. 4 - Prob. 26RP Ch. 4 - Prob. 27RP Ch. 4 - Prob. 28RP

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.

Solution Summary: The author analyzes the LP problem of HAL computer considering the projects that should be started.

Concept explainers

Explanation of Solution

Chapter 4 Solutions