Question: min z - Si S.L. 7x + 3x2 + $T - $ = 40 (HIM constraint) 10x + 5x2 + 52 $2 60 (LIP constraint)

min z - Si S.L. 7x + 3x2 + $T - $ = 40 (HIM
min z - Si S.L. 7x + 3x2 + $T - $ = 40 (HIM
min z - Si S.L. 7x + 3x2 + $T - $ = 40 (HIM constraint) 10x + 5x2 + 52 $2 60 (LIP constraint) 5x + 4x2 + 83 s3 35 (HIW constraint) 100x + 60x2 S 600 (Budget constraint) All variables nonnegative Using LINDO or LINGO to Solve Preemptive Goal Programming Problems Readers who do not have access to a computer program that will solve preemptive goal programming problems may still use LINDO (or any other LP package) to solve them. To illustrate how LINDO can be used to solve a preemptive goal programming problem, let's look at the Priceler example with our original set of priorities (HIM followed by LIP fol- lowed by HIW). We begin by asking LINDO to minimize the deviation from the highest-priority (HIM) goal by solving the following LP: min z si 7x7 + 3x2 +51 - 5= 40 (HIM constraint) 10x, + 5x2 + $2 $ (LIP constraint) 5x + 4x2 + 53 - $ 35 (HIW constraint) 100x; + 60x2 S 600 (Budget constraint) All variables nonnegative S.L. 60

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!