Introduction to mathematical programming
Introduction to mathematical programming
4th Edition
ISBN: 9780534359645
Author: Jeffrey B. Goldberg
Publisher: Cengage Learning
Expert Solution & Answer
Book Icon
Chapter 4, Problem 13RP

Explanation of Solution

Optimal solution:

  • Consider the job grading of Indiana University. Job at IU is rated on the following factors:
    • Factor 1: Complexity of duties
    • Factor 2: Education required
    • Factor 3: Mental or visual demands
  • To determine grade of each job its point value and desired score is tabulated.
  • Given table:
 Factor level  
Job123Desired score
1444105
233293
322275
411268
  • Let the variables x1,x2,x3,x4, be the point total assigned level 1,2,3,4, respectively. The given goals are:
    • Goal 1: When increasing the level of a factory by one, the points should increase by at least 10.
    • So the constraint equations become
      • x2x110
      • x3x210
      • x4x310
    • It is observed that for those set of constraint equations are:
      • x2x1+s1+s1=10
      • x3x2+s2+s2=10
      • x4x3+s3+s3=10
    • Goal 2: Difference between actual point total for each job and desired score should be minimum.
    • So the constraint equations are:
      • 3x4+s4+s4=105
      • 2x3+x2+s5+s5=93
      • 3x2+s6+s6=75
      • x2+2x1+s7+s7=68
    • Any deviation from the desired score is not desirable. So both si+ and si should be included. To minimize total deviation, the following should be minimized:
      • d=s4+s4+s5+s5+s6+s6+s7+s7
    • It is observed that these set of constraints do not belong to a feasible region. That is all constraints cannot be met. Hence, a cost value is assigned which is incurred if any of the goal is not met. So, introduce deviational variables as follows.
      • si+=Amount by which we numerically exceed the ith goal.
      • si=Amount by which we are numerically under the ith goal

Blurred answer
Students have asked these similar questions
Create a static function in C# where poachers appear and attempt to hunt animals. It gets the location of the closest animal to itself. Take account of that the animal also move too, so it should update the closest location (x, y) everytime it moves to a new location. Use winforms to show the movements of poachers.
Create a static function in C# where poachers appear and attempt to hunt animals. It gets the location of the closest animal to itself. Take account of that the animal also moves too, so it should update the closest location (x, y) everytime it moves to a new location. Use winforms to show to movements
I have to develop an efficient parallel numerical integration program on a 2-D mesh but I'm struggling. And it has to be in Cstar

Chapter 4 Solutions

Introduction to mathematical programming

Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Text book image
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Text book image
Fundamentals of Information Systems
Computer Science
ISBN:9781305082168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Text book image
Information Technology Project Management
Computer Science
ISBN:9781337101356
Author:Kathy Schwalbe
Publisher:Cengage Learning
Text book image
Fundamentals of Information Systems
Computer Science
ISBN:9781337097536
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning