Linear programming (LP): The linear programming(LP) is also known as linear optimization. Consider a mathematical model, and its requirements are used to represent by the linear relationships. The linear programming is the best method to achieve the best outcome of this mathematical model. The outcomes may be, maximum profit or lower cost. The linear optimization is also called as mathematical optimization because, it is a special case of mathematical programming. More formally, the LP is a technique for optimizing linear objective function subject to constraints of linear equality and linear inequality. Phase 1 in LP: In phase 1, the first step is to multiply both sides of a constraints with “-1” to turn the “ ≥ ” constraints to “ ≤ ” constraints. In this phase itself, one more step included is multiply the inequality with “-1” if the right side of the inequality is negative. If the right side of a “ ≤ ” constraints is negative, then subtract the artificial variable “ a 0 ” from its left side. The artificial variables for the equality constraints are “ a 0 ” and slack variables. The artificial variable should be 0. The user need a Phase I if the initial basic solution is not feasible. The user can begin Phase II otherwise.

Question

Want to see the full answer?

Answer 1

Question

Chapter 4.13, Problem 2P

Program Plan Intro

Linear programming (LP):

The linear programming(LP) is also known as linear optimization.

Consider a mathematical model, and its requirements are used to represent by the linear relationships. The linear programming is the best method to achieve the best outcome of this mathematical model. The outcomes may be, maximum profit or lower cost.

The linear optimization is also called as mathematical optimization because, it is a special case of mathematical programming.

More formally, the LP is a technique for optimizing linear objective function subject to constraints of linear equality and linear inequality.

Phase 1 in LP:

In phase 1, the first step is to multiply both sides of a constraints with “-1” to turn the “≥” constraints to “≤” constraints. In this phase itself, one more step included is multiply the inequality with “-1” if the right side of the inequality is negative.

If the right side of a “≤” constraints is negative, then subtract the artificial variable “a0” from its left side.

The artificial variables for the equality constraints are “a0” and slack variables. The artificial variable should be 0.

The user need a Phase I if the initial basic solution is not feasible. The user can begin Phase II otherwise.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Whentheuserenters!!,themostrecentcommandinthehistoryisexecuted.In the example above, if the user entered the command: Osh> !! The ‘ls -l’ command should be executed and echoed on user’s screen. The command should also be placed in the history buffer as the next command. Whentheuserentersasingle!followedbyanintegerN,theNthcommandin the history is executed. In the example above, if the user entered the command: Osh> ! 3 The ‘ps’ command should be executed and echoed on the user’s screen. The command should also be placed in the history buffer as the next command. Error handling: The program should also manage basic error handling. For example, if there are no commands in the history, entering !! should result in a message “No commands in history.” Also, if there is no command corresponding to the number entered with the single !, the program should output "No such command in history."

Activity No. Activity Time (weeks) Immediate Predecessors 1 Requirements collection 3 2 Requirements structuring 4 1 3 Process analysis 3 2 4 Data analysis 3 2 5 Logical design 50 3,4 6 Physical design 5 5 7 Implementation 6 6 c. Using the information from part b, prepare a network diagram. Identify the critical path.

2. UNIX Shell and History Feature [20 points] This question consists of designing a C program to serve as a shell interface that accepts user commands and then executes each command in a separate process. A shell interface gives the user a prompt, after which the next command is entered. The example below illustrates the prompt osh> and the user's next command: cat prog.c. The UNIX/Linux cat command displays the contents of the file prog.c on the terminal using the UNIX/Linux cat command and your program needs to do the same. osh> cat prog.c The above can be achieved by running your shell interface as a parent process. Every time a command is entered, you create a child process by using fork(), which then executes the user's command using one of the system calls in the exec() family (as described in Chapter 3). A C program that provides the general operations of a command-line shell can be seen below. #include #include #define MAX LINE 80 /* The maximum length command */ { int…