Deck 9: Nonlinear Optimization Models
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/60
Play
Full screen (f)
Deck 9: Nonlinear Optimization Models
1
Like linear programs, nonlinear programs will have a maximization or minimization objective function.
True
2
Nonlinear optimization models are more popular in usage than linear optimization models because real life applications have more nonlinearity.
False
3
Nonlinear models involve more computing burden than linear models for problems of comparable size.
True
4
A necessary condition for a one-variable decision problem with an objective function, which is continuous, is that the first derivative of the function be 0 at a local maximum or minimum point.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
5
Necessary and sufficient conditions for the existence of a local maximum in a single- variable, unconstrained, nonlinear optimization problem are that the first derivative be 0 at a point and the second derivative be negative at the same point.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
6
Necessary and sufficient conditions for the existence of a local minimum in a single- variable, unconstrained, nonlinear optimization problem are that the second derivative be negative at a point and at the same point the slope of the function be 0 .
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
7
In general, the values of global maximums of the objective function for unconstrained, nonlinear optimization problems will be greater than all local maximums.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
8
The local minimum of a convex function will also be the global minimum.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
9
Partial derivatives are used to find extreme values of decision variables in a nonlinear model with 2 or more variables.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
10
In single-variable, constrained minimization problems, the optimal solution will always be at a local minimum.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
11
In single-variable, unconstrained minimization problems, if there is only one local minimum, then it must be the global minimum.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
12
In single-variable, constrained minimization problems, the optimal solution may be at one of the extreme PPints, thatsejs, a point where the function intersects a constraint.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
13
Suitability of linear approximations for nonlinear problems can be found by analytical methods and does not involve judgment or experience.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
14
A point is a local minimum of a function if the value of is more for all points around a fixed distance, usually around .
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
15
As the number of turning points of a continuous function increases, the number of local maximums and minimums will increase.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
16
If a continuous function has only one local maximum, then it must also be its global maximum.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
17
A quadratic function has one local and global maximum or one local and global minimum.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
18
Lagrangian method for optimization may be used for even unconstrained two variable optimization problems.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
19
Lagrangian method with a single may be used to find optimal solutions for problems with, at most, two constraints.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
20
A two-variable problem with an inequality constraint may, in some instances, be solvable by ignoring the constraint because it may not be binding.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
21
the function .
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
22
the function .
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
23
the function .
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
24
If a local optimal solution is found for a two-variable maximization problem, the maximum value of the
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
25
In an unconstrained two-variable problem with a quadratic objective function, if there is a local optimum, it must also be the global optimum solution.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
26
In an unconstrained two-variable problem with a quadratic objective function, there will always be a local optimal solution, though global optimal solution may not be available even in such problems.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
27
In an unconstrained two-variable problem with a quadratic objective function, the constant does not have a role in the problem and hence may be dropped.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
28
In an unconstrained two-variable problem with a quadratic objective function, the constant affects the value of the objective function corresponding to the optimal solution, if any, but does not affect the optimal value of the variables.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
29
In an unconstrained two-variable problem with a quadratic objective function, the saddle point is where one variable reaches a local maximum and the other variable reaches a local minimum.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
30
In order to find whether a local minimum is a global minimum, one must
A) set the second derivative to 0 and solve for and check whether the first derivative is negative at that
B) check whether the second derivative is negative at the value of corresponding to the local minimum
C) set the second derivative to 0 and solve for and check whether the first derivative is positive at that
D) check whether the second derivative is positive at the value of corresponding to the local minimum
A) set the second derivative to 0 and solve for and check whether the first derivative is negative at that
B) check whether the second derivative is negative at the value of corresponding to the local minimum
C) set the second derivative to 0 and solve for and check whether the first derivative is positive at that
D) check whether the second derivative is positive at the value of corresponding to the local minimum
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
31
In order to find whether a local maximum is a global maximum, one must
A) set the second derivative to 0 and solve for and check whether the function is negative at that
B) check whether the second derivative is negative at the value of corresponding to the local maximum
C) set the second derivative to 0 and solve for and check whether the function is positive at that
D) check whether the second derivative is positive at the value of corresponding to the local maximum
A) set the second derivative to 0 and solve for and check whether the function is negative at that
B) check whether the second derivative is negative at the value of corresponding to the local maximum
C) set the second derivative to 0 and solve for and check whether the function is positive at that
D) check whether the second derivative is positive at the value of corresponding to the local maximum
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
32
Linear models are more popular than nonlinear models because
A) they are relatively easier to formulate and solve
B) most practical problems are linear
C) they involve proportionate relationship between variables
D) are more accurate than non-linear models
A) they are relatively easier to formulate and solve
B) most practical problems are linear
C) they involve proportionate relationship between variables
D) are more accurate than non-linear models
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
33
Causes of nonlinearity include all of the following except
A) additivity may be absent because mixing one cup each of two ingredients may produce less than 2 cups of products
B) increasing sales may result in less than proportionate total sales revenue because of price breaks
C) doubling of sales volume doubles sales revenue
D) economies produced in consumption of raw materials, such as making a 4-pack, uses less materials than individual wraps
A) additivity may be absent because mixing one cup each of two ingredients may produce less than 2 cups of products
B) increasing sales may result in less than proportionate total sales revenue because of price breaks
C) doubling of sales volume doubles sales revenue
D) economies produced in consumption of raw materials, such as making a 4-pack, uses less materials than individual wraps
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
34
Which of the following is true for a strictly convex function?
A) It is easier to plot
B) Local maximum is less than global maximum
C) Local minimum is equal to global minimum
D) Local minimum is greater than global minimum
A) It is easier to plot
B) Local maximum is less than global maximum
C) Local minimum is equal to global minimum
D) Local minimum is greater than global minimum
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
35
In a small, specialty door-locks business, demand is given by , where is the monthly demand in units and is the price per unit. Identify the expression that correctly captures
A) total sales revenue
B) It is easier to plot
C) Local maximum is less than global maximum
D) Local minimum is equal to global minimum
E) Local minimum is greater than global minimum
A) total sales revenue
B) It is easier to plot
C) Local maximum is less than global maximum
D) Local minimum is equal to global minimum
E) Local minimum is greater than global minimum
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
36
The local minimum for the function occurs at equal to
A) 2
B) 5
C) 0.25
D) 4
A) 2
B) 5
C) 0.25
D) 4
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
37
The local maximum for the function is obtained when is equal to:
A) 8
B) 4
C) 0.75
D) 0.5
A) 8
B) 4
C) 0.75
D) 0.5
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
38
Which of the following is true of the function ?
A) It reaches global maximum at
B) It reaches global minimum at
C) It reaches local maximum at
D) It reaches local minimum at
A) It reaches global maximum at
B) It reaches global minimum at
C) It reaches local maximum at
D) It reaches local minimum at
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
39
The optimal solution to the nonlinear model : Maximize: , subject to and 4 , is given by equal to
A) 4
B) 0
C) 2
D) 1
A) 4
B) 0
C) 2
D) 1
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
40
The optimal solution to the nonlinear model : Minimize: , subject to , is given by equal to
A) -29
B) -39
C) 0
D) 1
A) -29
B) -39
C) 0
D) 1
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
41
The optimal solution to the nonlinear model : Maximize: , subject to , is given by equal to
A) 2
B) 1.5
C) 1.333
D) 1.867
A) 2
B) 1.5
C) 1.333
D) 1.867
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
42
The optimal solution to the nonlinear model : Minimize: , subject to and , is given by equal to
A) 0
B) 4.4444
C) 2.828
D) 5
A) 0
B) 4.4444
C) 2.828
D) 5
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
43
The local maximum for the function is obtained when is equal to
A) 1
B) -1
C)
D)
A) 1
B) -1
C)
D)
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
44
The value of the function at its local maximum is
A) -8
B) 8
C) 1
D) -1
A) -8
B) 8
C) 1
D) -1
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
45
For the function , the slope of the function is 0 at equal to
A) 6
B) 12
C) 3
D) -1
A) 6
B) 12
C) 3
D) -1
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
46
If the slope of the function is 0 at , then it follows that is a
A) local maximum
B) local minimum
C) global maximum
D) saddle point
A) local maximum
B) local minimum
C) global maximum
D) saddle point
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
47
The necessary condition for optimality in a two-variable unconstrained function is that
A) both partial derivatives must be non-negative
B) at least one of the partial derivatives must be negative
C) the partial derivatives must be equal and negative
D) both partial derivatives must be negative
A) both partial derivatives must be non-negative
B) at least one of the partial derivatives must be negative
C) the partial derivatives must be equal and negative
D) both partial derivatives must be negative
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
48
Which of these factors is essential in deciding when to use linear approximation of nonlinear problems?
A) Feasibility
B) Experience
C) Efficiency
D) Performance
A) Feasibility
B) Experience
C) Efficiency
D) Performance
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
49
A point on a complex curve of a two-variable unconstrained function where two partial derivatives are zero is a local maximum if
A) the second partial derivatives and mixed partial derivative are zero
B) the second partial derivative is negative
C) the second partial derivatives are negative, and the mixed partial derivative is positive
D) the second and mixed partial derivatives are positive
A) the second partial derivatives and mixed partial derivative are zero
B) the second partial derivative is negative
C) the second partial derivatives are negative, and the mixed partial derivative is positive
D) the second and mixed partial derivatives are positive
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
50
If the first partial derivative of a Lagrangian function of two decision variables are equal to zero at a point, then the point is
A) a saddle point maximum if the mixed partial is negative
B) a local maximum if the second partials are negative and
C) a global maximum if the second and mixed partials are all positive
D) a global minimum if the second partials are positive and
A) a saddle point maximum if the mixed partial is negative
B) a local maximum if the second partials are negative and
C) a global maximum if the second and mixed partials are all positive
D) a global minimum if the second partials are positive and
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
51
Which of the following assertions concerning the Lagrangian multiplier is true?
A)If it is negative, then a one-unit increase in RHS value will decrease the objective function by the value of the multiplier
B) It has the same interpretation as the dual variables in linear programming
C) It represents the slope of the objective function
D) A and B
A)If it is negative, then a one-unit increase in RHS value will decrease the objective function by the value of the multiplier
B) It has the same interpretation as the dual variables in linear programming
C) It represents the slope of the objective function
D) A and B
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
52
The optimal solution to the problem: Minimize : is
A)
B)
C)
D)
A)
B)
C)
D)
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
53
The optimal solution to the problem: Minimize : is
A)
B)
C)
D)
A)
B)
C)
D)
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
54
The Lagrangian function corresponding to the following constrained optimization problem: Maximize: , subject to is
A)
B)
C)
D)
A)
B)
C)
D)
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
55
In a constrained, nonlinear, optimization problem with a maximize objective function and a single equality constraint, if the value of corresponding to the optimal solution is:
A) 5 , then the objective function will go up by 5 for each additional unit of the resource represented by RHS
B) 5 , then the objective function will go down by 5 for each additional unit of the resource represented by RHS
C) -5 , then the objective function will go up by 5 for each additional unit of the resource represented by RHS
D) -5 then the objective function will go down by 5 for each additional unit of the resource represented by RHS
A) 5 , then the objective function will go up by 5 for each additional unit of the resource represented by RHS
B) 5 , then the objective function will go down by 5 for each additional unit of the resource represented by RHS
C) -5 , then the objective function will go up by 5 for each additional unit of the resource represented by RHS
D) -5 then the objective function will go down by 5 for each additional unit of the resource represented by RHS
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
56
In a wax business two types are made, jar wax and tube wax. The selling price of jar wax is per unit and tube wax is per unit. Let be the number of units of jar wax sold and the number of units of tube wax sold. Direct costs for each type of wax are times the square of the number of units sold. Profit contribution for this business is given by
A)
B)
C)
D)
A)
B)
C)
D)
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
57
XYZ Inc. manufactures a critical vaccine needed for homeland security, and its cost of production is given by the following function: , where is the number of thousands of vaccines produced. The government wants to go in for a cost plus contract and wants XYZ Inc. to produce as many vaccines as possible at the lowest total cost. What is the correct value of that would minimize the cost of the contract?
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
58
We hire today a firm specializing in temporary employment opportunities in New Orleans, after the damages of Hurricane Katrina, which has developed a profit function for November 2005 given by , where is the number of employees hired in November 2005 . What should be their target employment for November in order to maximize their profit for November? Their current facilities have sufficient capacity to accommodate, at most, 400 new-hires in November 2005.
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
59
In a paper business two types of paper are being made-sponge and cloth. Sponge sells for per package, and cloth sells for per package. Let is the number of packages of sponge sold and be the number of packages of cloth sold. Direct costs are times the square of the number of units of sponge sold and times the square of the number of units of cloth sold. Fixed costs for the two paper types together are for all the volumes contemplated or possible. There are no other costs or revenues. Find the net profit maximizing combination of sponge and cloth to be sold. (It may be assumed that the firm can sell whatever volume they produce.)
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck
60
In a paper business two types of paper are being made-sponge and cloth. Sponge sells for per package, and cloth sells for per package. Let be the number of packages of sponge sold and the number of packages of cloth sold. Direct costs are times the square of the number of units of sponge sold and times the square of the number of units of cloth sold. Fixed costs for the two paper types together are for all the volumes contemplated or possible. There are no other costs or revenues. However, all paper rolls have to be labeled by a single labeling machine which can handle at most 50 rolls of both types put together. Find the net profit maximizing combination of sponge and cloth to be sold subject to the constraint. (It may be assumed that the firm can sell whatever volume they produce.)
Unlock Deck
Unlock for access to all 60 flashcards in this deck.
Unlock Deck
k this deck