7.

Identify the curve of the following function and determine whether it is a concave or
a convex function: f (x) = 3x^2 + 7x – 9
 8. Enlist and explain three types of Linear Programming Problem.

Linear programming (LP) is a mathematical optimization technique used to maximize or minimize a

linear objective function, subject to a set of linear equality and inequality constraints. It is widely used
in various fields such as economics, engineering, operations research, and management science to find
the best possible outcome given limited resources.

Different Types of Linear Programming Problems

The following are the types of linear programming problems:
 Manufacturing problems
 Diet problems
 Transportation problems
 Optimal alignment problem
Manufacturing Problems
In these problems, we evaluate the number of units of various items that should be produced
and sold by a company when each product requires a given number of workforce, machine
hours, labour hours per unit of product, warehouse space per unit of output, and so on, to
maximize profit.
Manufacturing problems involve maximizing the production rate or net profits of
manufactured products, which might measure the available workspace, the number of workers,
machine hours, packing materials used, raw materials required, the product’s market value, and
other factors. These are commonly used in the industrial sector to anticipate a company’s
future capital increase over time.
Diet Problems
In these challenges, we assess how many components or nutrients a diet should contain in
order to lower the cost of the desired diet while guaranteeing the minimal amount of each
vitamin.
As the name suggests, diet-related problems can be resolved by eating more particular foods
that are rich in essential nutrients and can support the adoption of a particular diet plan.
Finding a set of meals that will satisfy a set of daily nutritional demands for the least amount of
money is the aim of a diet problem.
Transportation Problems
In these problems, we create a transportation schedule to discover the most cost-effective
method of carrying a product from various plants/factories to various markets.
The study of transportation routes or how items from diverse production sources are
transported to various markets to minimize the total transportation cost is linked to
transportation difficulties. Analyzing such challenges is crucial for large firms with several
production units and a broad customer base.
Optimal Assignment Problems
This problem addresses a company’s completion of a given task/assignment by selecting a
specific number of employees to complete the assignment within the required timeframe,
assuming that each person works on only one job. Event planning and management in major
organizations, for example, are examples of such problems.
9. Principle of Simplex Method also explain Optimum Points

The Simplex Method is a widely-used algorithm for solving linear programming problems,
especially when the problem is expressed in standard form. It is an iterative process used to
find the optimal solution to a linear programming problem by traversing the vertices (corner
points) of the feasible region defined by the constraints. The algorithm moves from one feasible
solution to the next, always improving the objective function until an optimal solution is found.

Principle of the Simplex Method

The Simplex Method is based on the following principles:

1. Feasible Region:
o The set of all possible solutions to the linear programming problem is called the feasible
region, which is defined by the constraints.
o The feasible region is usually a convex polytope (a geometric object with flat sides). Each
corner or vertex of the polytope corresponds to a potential solution, and the Simplex
Method moves between these vertices in search of the optimal solution.
2. Objective Function:
o The goal of linear programming is to maximize or minimize an objective function, such as
profit, cost, or some other quantity.
o The objective function is typically expressed as a linear combination of decision
variables:

o The Simplex Method aims to move along the feasible region to find the optimal point
where the objective function has its maximum or minimum value.
3. Basic and Non-Basic Variables:
o In the Simplex Method, the decision variables are divided into two categories:
 Basic variables: These are the variables that correspond to the current vertex of
the feasible region. They are considered "active" at the current iteration.
 Non-basic variables: These are the variables that are currently set to zero in the
solution. They are considered "inactive" at the current iteration.
4. Iterative Process:
o The Simplex algorithm starts at an initial feasible solution, which is typically a basic
feasible solution (BFS) that satisfies all the constraints.
o At each step, the algorithm selects a non-basic variable to increase (or decrease) in such
a way that the objective function improves. This variable is called the entering variable.
o Simultaneously, a basic variable is reduced to zero to maintain the solution's feasibility,
and it leaves the basis. This is called the leaving variable.
o This process continues iteratively until the algorithm reaches the optimal solution or
determines that no solution exists (if the objective function cannot be improved
further).
5. Optimality Conditions:
o The Simplex Method will stop when no further improvement can be made to the
objective function. Specifically, if all the coefficients in the objective row (the row
 corresponding to the objective function in the tableau) are non-negative (for
maximization) or non-positive (for minimization), the current solution is optimal.
o If there are negative coefficients in the objective row (for maximization), the algorithm
continues by moving to the next vertex.
6. Pivoting:
o Pivoting refers to the process of changing the basic and non-basic variables, i.e.,
selecting the entering and leaving variables.
o The entering variable is selected based on the improvement in the objective function,
and the leaving variable is selected to maintain the feasibility of the solution.

Steps in the Simplex Method:

1. Set up the initial Simplex tableau based on the constraints and the objective function.
2. Identify the entering variable (the non-basic variable with the most negative coefficient in the
objective row for maximization problems).
3. Determine the leaving variable by calculating the ratio of the right-hand side (RHS) values to the
coefficients of the entering variable in the constraint rows. The row with the smallest ratio
determines the leaving variable.
4. Perform the pivot operation to update the tableau.
5. Repeat the process until there are no more negative coefficients in the objective row, indicating
that the optimal solution has been found.

Optimum Points in the Simplex Method

An optimum point (or optimal solution) refers to the point in the feasible region that yields the
best value for the objective function. This point corresponds to the vertex of the feasible region.
In the context of the Simplex Method:

1. Feasible Solution: A solution that satisfies all the constraints (including non-negativity
constraints) but may not necessarily optimize the objective function.
2. Optimal Solution: A feasible solution that maximizes (for a maximization problem) or
minimizes (for a minimization problem) the objective function.
3. Corner Point Theorem: The Simplex Method works on the corner points or vertices of
the feasible region because the optimal solution of a linear programming problem always
lies at one of these vertices (if the feasible region is non-empty and bounded).
 10.Write steps in details Graphical Method of Solving Linear Programming
Problems.

Step 1: Convert the Problem to Standard Form

Ensure that the problem is in standard form with linear constraints and an objective function.

 The objective function is typically of the form:

Step 8: Check for Unbounded or Infeasible Solutions

11.Example 8.3. Find the minimum of the function f (x) = x2−sin(x) on the interval [0, 1]
using the Fibonacci search method. Use a tolerance of = 10−4 and the distinguishability
constant e = 0.01.
12.Write in details Bellmann‘s principle with mathematical equation.
2. The ongoing sewer line project has to move from 1 to 12 various activities (no. of
activities is not limited to 12. The average cost is Rs. in the multiple of 5000 of
completion of an activity, then to move next. Determine the best suitable path
should adopt to minimize the average cost of completion of all the activities.
3.difference between LP and NLP problems & elaborate Hessian matrix.