Calculating the extra payment: Let x 1 be the number of pairs of shoes that were produced during the month “t” with non-overtime labor, o t be the number of pairs of shoes that were produced during month “t” with the overtime labor, i t be the inventory of shoes at the end of month “t”, h t is the number of workers that were hired at the beginning of month “t”, f t be the number of workers who were fired at the beginning of month “t” and w t be the number of workers who were available for month “t”. For the objective function, the following cost must be considered as worker’s salaries, hiring costs, firing costs, holding costs, overtime costs and raw-material costs. Hence, the derived objective function is: min z= 1500 w t + 1600 h t + 2000 f t + 30 i t + 25 × 4 o t + 5 ( x t + o t ) min z= 1500 w t + 1600 h t + 2000 f t + 30 i t + 105 o t + 5 x t for t=1,2,3,4. The constraints are described where the first constraint for inventory is, i 1 = 50 + x 1 + o 1 − 300 x 1 + o 1 − i 1 = 250 For the second month, i 2 = i 1 + x 2 + o 2 − 500 i 1 + x 2 + o 2 − i 2 = 500 In the same way, for next two months, x 3 + o 3 + i 2 − i 3 = 100 x 4 + o 4 + i 3 − i 4 = 100 The second constraint for relation available workers to hiring and firing the workers, for the first month, w 1 = 3 + h 1 − f 1 w 1 + f − h 1 = 3 For the second month, w 2 = w 1 + h 2 − f 2 w 2 + f 2 − w 1 − h 2 = 0 In the same way, for next two months, w 3 + f 3 − w 2 − h 3 = 0 w 4 + f 4 − w 3 − h 4 = 0 The third constraint for each month, the amount of shoes made with non-overtime labors is limited by the number of workers, here for the first month, 4 x 1 ≤ 160 w 1 4 x 1 − 160 w 1 ≤ 0 In the same way, for next three months, 4 x 2 − 160 w 2 ≤ 0 4 x 3 − 160 w 3 ≤ 0 4 x 4 − 160 w 4 ≤ 0 The fourth constraint for each month, the amount of shoes made with overtime labor is limited by the number of workers, for the first month, 4 o 1 ≤ 20 w 1 4 o 1 − 20 w 1 ≤ 0 In the same way, for next three months, 4 o 2 − 20 w 2 ≤ 0 4 o 3 − 20 w 3 ≤ 0 4 o 4 − 20 w 4 ≤ 0 Hence, the obtained Linear Programming min z= 1500 w t + 1600 h t + 2000 f t + 30 i t + 105 o t + 5 x t for t=1,2,3,4. Subjected to, x 1 + o 1 − i 1 = 250 i 1 + x 2 + o 2 − i 2 = 500 x 3 + o 3 + i 2 − i 3 = 100 x 4 + o 4 + i 3 − i 4 = 100 w 1 + f − h 1 = 3 w 2 + f 2 − w 1 − h 2 = 0 w 3 + f 3 − w 2 − h 3 = 0 w 4 + f 4 − w 3 − h 4 = 0 4 x 1 − 160 w 1 ≤ 0 4 x 2 − 160 w 2 ≤ 0 4 x 3 − 160 w 3 ≤ 0 4 x 4 − 160 w 4 ≤ 0 4 o 1 − 20 w 1 ≤ 0 4 o 2 − 20 w 2 ≤ 0 4 o 3 − 20 w 3 ≤ 0 4 o 4 − 20 w 4 ≤ 0 The following is the LINDO output for this Linear Programming: min z=

Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms

4th Edition

ISBN: 9780534423551

Author: Wayne L. Winston

Publisher: Cengage Learning

See similar textbooks

Concept explainers

Modular linear equation

Modular arithmetic is a system of arithmetic for integers, whose values reset to zero and begin to increase again, after reaching a certain predefined value, called the modulus (modulo). Modular arithmetic is widely used in computer science and cryptogra…

Expert Solution & Answer

Chapter 5.3, Problem 9P

Explanation of Solution

Calculating the extra payment:

Let x₁ be the number of pairs of shoes that were produced during the month “t” with non-overtime labor, o_t be the number of pairs of shoes that were produced during month “t” with the overtime labor, i_t be the inventory of shoes at the end of month “t”, h_t is the number of workers that were hired at the beginning of month “t”, f_t be the number of workers who were fired at the beginning of month “t” and w_t be the number of workers who were available for month “t”.

For the objective function, the following cost must be considered as worker’s salaries, hiring costs, firing costs, holding costs, overtime costs and raw-material costs.

Hence, the derived objective function is:

min z= 1500wt+1600ht+2000ft+30it+25×4ot+5(xt+ot)

min z= 1500wt+1600ht+2000ft+30it+105ot+5xt

for t=1,2,3,4.

The constraints are described where the first constraint for inventory is,

i1=50+x1+o1−300

x1+o1−i1=250

For the second month,

i2=i1+x2+o2−500

i1+x2+o2−i2=500

In the same way, for next two months,

x3+o3+i2−i3=100

x4+o4+i3−i4=100

The second constraint for relation available workers to hiring and firing the workers, for the first month,

w1=3+h1−f1

w1+f−h1=3

For the second month,

w2=w1+h2−f2

w2+f2−w1−h2=0

In the same way, for next two months,

w3+f3−w2−h3=0

w4+f4−w3−h4=0

The third constraint for each month, the amount of shoes made with non-overtime labors is limited by the number of workers, here for the first month,

4x1≤160w1

4x1−160w1≤0

In the same way, for next three months,

4x2−160w2≤0

4x3−160w3≤0

4x4−160w4≤0

The fourth constraint for each month, the amount of shoes made with overtime labor is limited by the number of workers, for the first month,

4o1≤20w1

4o1−20w1≤0

In the same way, for next three months,

4o2−20w2≤0

4o3−20w3≤0

4o4−20w4≤0

Hence, the obtained Linear Programming

min z= 1500wt+1600ht+2000ft+30it+105ot+5xt

for t=1,2,3,4.

Subjected to,

x1+o1−i1=250

i1+x2+o2−i2=500

x3+o3+i2−i3=100

x4+o4+i3−i4=100

w1+f−h1=3

w2+f2−w1−h2=0

w3+f3−w2−h3=0

w4+f4−w3−h4=0

4x1−160w1≤0

4x2−160w2≤0

4x3−160w3≤0

4x4−160w4≤0

4o1−20w1≤0

4o2−20w2≤0

4o3−20w3≤0

4o4−20w4≤0

The following is the LINDO output for this Linear Programming:

min z=

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 5.3, Problem 7P

Chapter 5.3, Problem 10P

Students have asked these similar questions

The next problem concerns the following C code: /copy input string x to buf */ void foo (char *x) { char buf [8]; strcpy((char *) buf, x); } void callfoo() { } foo("ZYXWVUTSRQPONMLKJIHGFEDCBA"); Here is the corresponding machine code on a Linux/x86 machine: 0000000000400530 : 400530: 48 83 ec 18 sub $0x18,%rsp 400534: 48 89 fe mov %rdi, %rsi 400537: 48 89 e7 mov %rsp,%rdi 40053a: e8 d1 fe ff ff 40053f: 48 83 c4 18 add callq 400410 $0x18,%rsp 400543: c3 retq 0000000000400544 : 400544: 48 83 ec 08 sub $0x8,%rsp 400548: bf 00 06 40 00 mov $0x400600,%edi 40054d: e8 de ff ff ff callq 400530 400552: 48 83 c4 08 add $0x8,%rsp 400556: c3 This problem tests your understanding of the program stack. Here are some notes to help you work the problem: • strcpy(char *dst, char *src) copies the string at address src (including the terminating '\0' character) to address dst. It does not check the size of the destination buffer. You will need to know the hex values of the following characters:

A ROP (Return-Oriented Programming) attack can be used to execute arbitrary instructions by chaining together small pieces of code called "gadgets." Your goal is to create a stack layout for a ROP attack that calls a function located at '0x4018bd3'. Below is the assembly code for the function 'getbuf', which allocates 8 bytes of stack space for a 'char' array. This array is then passed to the 'gets' function. Additionally, you are provided with five useful gadgets and their addresses. Use these gadgets to construct the stack layout. Assembly for getbuf 1 getbuf: 2 sub $8, %rsp 3 mov %rsp, %rdi 4 call gets 56 add $8, %rsp ret #Allocate 8 bytes for buffer #Load buffer address into %rdi #Call gets with buffer #Restore the stack pointer #Return to caller. Stack Layout (fill in Gadgets each 8-byte section) Address Gadget Address Value (8 bytes) 0x4006a7 pop %rdi; ret 0x7fffffffdfc0 Ox4006a9 pop %rsi; ret 0x7fffffffdfb8 0x4006ab pop %rax; ret 0x7fffffffdfb0 0x7fffffffdfa8 Ox4006ad mov %rax,…

In each of the following C code snippets, there are issues that can prevent the compilerfrom applying certain optimizations. For each snippet:• Circle the line number that contains compiler optimization blocker.• Select the best modification to improve optimization.1. Which line prevents compiler optimization? Circle one: 2 3 4 5 6Suggested solution:• Remove printf or move it outside the loop.• Remove the loop.• Replace arr[i] with a constant value.1 int sum( int ∗ ar r , int n) {2 int s = 0 ;3 for ( int i = 0 ; i < n ; i++) {4 s += a r r [ i ] ;5 p r i n t f ( ”%d\n” , s ) ;6 }7 return s ;8 }2. Which line prevents compiler optimization? Circle one: 2 3 4 5 6Suggested solution:• Move or eliminate do extra work() if it’s not necessary inside the loop.• Remove the loop (but what about scaling?).• Replace arr[i] *= factor; with arr[i] = 0; (why would that help?).1 void s c a l e ( int ∗ ar r , int n , int f a c t o r ) {2 for ( int i = 0 ; i < n ; i++) {3 a r r [ i ] ∗= f a c t o r…

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.

Concept explainers

Explanation of Solution

Want to see the full answer?

Chapter 5 Solutions