LINEAR PROGRAMMING

Linear Programming (LP) is a quantitative technique used to determine the most efficient way to
allocate limited resources to achieve a desired objective, such as maximizing profit or minimizing
cost, subject to certain constraints (Taha, 2017). It involves the formulation of a mathematical
model where both the objective function and constraints are expressed as linear equations or
inequalities. Essentially, LP helps decision-makers find the “best possible” outcome within a
feasible set of options, assuming linear relationships among variables (Hillier & Lieberman, 2020).

Brief History and Development of LP

The concept of linear programming emerged during the 1940s as a result of military operations
research during World War II. The method was formalized by George B. Dantzig in 1947, who
developed the Simplex Method, a computational algorithm for solving LP problems efficiently.
Dantzig’s work revolutionized resource optimization and paved the way for modern operational
research (Dantzig, 1963). Over the decades, LP has evolved through improvements in
computational techniques, algorithms, and software applications, making it a fundamental tool in
business, economics, engineering, and social sciences.

Importance of LP in Economics and Production Decision-Making

Linear programming plays a vital role in economics, especially in production theory and resource
management. It enables firms and industries to make rational decisions regarding the optimal
combination of inputs and outputs given limited resources (Varian, 2019). In production
economics, LP assists in determining the optimal production mix, minimizing production costs,
maximizing returns, and efficiently utilizing labor, capital, and raw materials. It also aids
policymakers and managers in evaluating trade-offs between competing activities and
understanding how constraints—such as budget, labor hours, or raw material supply—impact
productivity (Chiang & Wainwright, 2005).

1
ng & Wainwright, 2005).

Objectives of the Paper

The primary objective of this paper is to explore the concept and application of Linear
Programming within the context of production economics. Specifically, it seeks to:

1) Explain the theoretical foundation and mathematical formulation of LP.

2) Examine its practical applications in production planning and resource allocation.

3) Highlight its significance in improving production efficiency and decision-making.

4) Identify challenges and limitations associated with applying LP in real-world economic

environments.

By addressing these objectives, the paper aims to illustrate how LP serves as an indispensable
analytical tool in optimizing production processes and achieving economic efficiency.

Theoretical Framework of Linear Programming

Basic Concepts

Linear Programming (LP) is a quantitative decision-making technique that provides an optimal

solution to problems involving the allocation of limited resources among competing activities. It
plays an essential role in production economics, where firms must determine the most efficient
combination of inputs or production plans to maximize output or minimize cost (Hillier &
Lieberman, 2021).

The core elements of LP include the objective function, decision variables, constraints, and the
feasible region.

1. Objective Function:
The objective function represents the ultimate goal of the decision-maker, which could be
to maximize profit, maximize output, or minimize cost or waste. In production
economics, for instance, a firm may want to determine the level of output for different
products that will yield the highest total profit, given limited labor and material resources.
Mathematically, it is expressed as a linear equation such as:
2
 𝑍 = 𝑐1 𝑥1 + 𝑐2 𝑥2 + ⋯ + 𝑐𝑛 𝑥𝑛

where 𝑍is the total profit (or cost), 𝑐𝑖 is the contribution per unit of product 𝑖, and 𝑥𝑖 represents the
quantity produced of that product (Render et al., 2018).

2. Decision Variables:
These are the unknown quantities or choices that decision-makers must determine in
order to achieve the objective. In production settings, decision variables could represent
the number of units of each product to produce, the amount of raw material to allocate to
different departments, or the level of labor hours to assign (Taha, 2017).

3. Constraints:
Constraints are the limitations that restrict the feasible solutions to a problem. They
reflect the scarcity of resources such as raw materials, labor, time, or machinery capacity.
For example, a manufacturing firm cannot produce beyond the available labor hours or
material supply. These constraints are expressed as linear inequalities or equalities in LP
models (Hillier & Lieberman, 2021).

4. Feasible Region:
The feasible region represents the set of all possible combinations of decision variables
that satisfy the constraints. Graphically, it is the area (or region) within which all
restrictions are met. The optimal solution lies within this region—usually at one of its
corner points—where the objective function achieves either its maximum or minimum
value (Snyder & Shen, 2019).

Together, these components provide a framework through which economic decisions can be
modeled mathematically and solved systematically.

Assumptions of Linear Programming

For LP models to yield meaningful and applicable results, several key assumptions are made:

1. Linearity:
All relationships in the model (both objective function and constraints) must be linear.
3
 This implies proportionality—doubling input results in doubling output. Nonlinear
relationships are not captured by LP models (Taha, 2017).

2. Divisibility:
Decision variables are continuous and can take fractional values. This means that
resources can be divided into any quantity rather than whole numbers. In production, this
could mean producing 2.5 units of a product, which is theoretically acceptable in the
model (Hillier & Lieberman, 2021).

3. Certainty:
All parameters, such as profit coefficients and resource availability, are known with
certainty and do not change during the analysis period. This assumption simplifies real-
world uncertainty into a deterministic model.

4. Non-negativity:
Decision variables cannot be negative, since negative production levels or resource
allocations are not physically meaningful. Thus, 𝑥𝑖 ≥ 0for all 𝑖.

5. Additivity:
The total effect of decision variables on the objective function or constraints is the sum of
their individual effects. For example, if two products contribute independently to profit,
their total contribution is simply the sum of both (Render et al., 2018).

Although these assumptions make LP models more manageable, they also limit their realism. In
practice, economic and production systems often violate some of these assumptions, but LP still
provides valuable approximations for decision-making.

Structure of a Typical LP Model

A general LP problem is represented as:

Maximize or Minimize 𝑍 = 𝑐1 𝑥1 + 𝑐2 𝑥2 + ⋯ + 𝑐𝑛 𝑥𝑛

4
Subject to resource constraints:

𝑎11 𝑥1 + 𝑎12 𝑥2 + ⋯ + 𝑎1𝑛 𝑥𝑛 ≤ 𝑏1

𝑎21 𝑥1 + 𝑎22 𝑥2 + ⋯ + 𝑎2𝑛 𝑥𝑛 ≤ 𝑏2
𝑥1 , 𝑥2 , … , 𝑥𝑛 ≥ 0

Here:

 𝑍= objective function (profit or cost),

 𝑐𝑖 = unit contribution of each decision variable,

 𝑎𝑖𝑗 = resource usage coefficients, and

 𝑏𝑖 = total available resources.

For example, a production firm might want to determine how many units of Product A and
Product B to produce to maximize profit given labor and raw material constraints. LP allows
managers to formulate and solve this problem systematically (Snyder & Shen, 2019).

Graphical and Simplex Methods of Solving LP Problems

There are several techniques for solving LP models depending on their size and complexity:

1. Graphical Method:
This method is used when there are only two decision variables, making it possible to
plot the constraints and objective function on a two-dimensional graph. The feasible
region is identified as the intersection of all constraint lines. The optimal solution occurs
at one of the corner points of this region. Although the graphical method is simple and
illustrative, it becomes impractical for problems with more than two variables (Taha,
2017).

2. Simplex Method:
The simplex method, developed by George Dantzig in 1947, is an iterative algebraic
technique used for solving LP problems involving multiple variables. It systematically

5
 examines the corner points of the feasible region using matrix operations to determine the
optimal solution. The method is widely used in production planning, transportation, and
inventory control because of its efficiency in handling large-scale problems (Hillier &
Lieberman, 2021).

Relevance of Linear Programming Theory to Production Optimization

Linear Programming has significant applications in production optimization. In production

economics, firms often face the challenge of maximizing profit or minimizing cost while
operating under limited resources. LP provides a scientific and analytical framework for
addressing these challenges by identifying the most efficient allocation of inputs.

For example, a manufacturing firm may produce multiple products using shared resources such
as labor, machinery, and raw materials. Using LP, the firm can determine the optimal production
quantities of each product to achieve the highest possible profit without exceeding resource
limits (Ahuja & Orlin, 2018). Similarly, LP helps in product mix optimization, resource
scheduling, transportation planning, and supply chain management.

Beyond economics, LP models are also applied in agriculture to determine the best cropping
pattern, in logistics to minimize transportation costs, and in finance to optimize investment
portfolios (Snyder & Shen, 2019).

Thus, Linear Programming bridges the gap between theory and practical decision-making by
providing a clear, structured, and quantitative basis for optimizing production processes and
improving overall economic efficiency.

Application of Linear Programming in Production Economics

Linear Programming (LP) is a mathematical tool used in economics to achieve the best possible
outcome—such as maximum profit or minimum cost—given limited resources. It helps
producers, managers, and policymakers make rational decisions about how to allocate scarce
resources like labor, capital, materials, and time efficiently.

6
 1. Use of LP in Production Planning:

Linear Programming assists producers in determining the best product combination (or “product
mix”) that will maximize profits or minimize costs under existing constraints such as labor
hours, raw materials, or machine capacity.
Example: A textile factory in Lagos can use Linear Programming to decide how many shirts,
trousers, and jackets to produce each week based on limited fabric and worker hours to maximize
total profit.

2. Resource Allocation and Cost Minimization:

Linear Programming ensures efficient allocation of scarce resources among competing

production activities. It helps firms minimize costs while achieving production goals and
avoiding the wastage of resources.
Example: A rice milling company in Kebbi State can apply Linear Programming to allocate
machinery, fuel, and labor optimally across multiple milling sites to reduce total operational
costs.

3. Input-Output Relationships and Efficiency Improvement:

Linear Programming analyzes the relationship between inputs (like labor and capital) and outputs
(goods produced). By identifying inefficiencies, it suggests ways to improve productivity and
output levels.
Example: A cassava processing plant in Ogun State can use Linear Programming to balance
inputs such as tubers, water, and energy to produce starch and Garri efficiently with minimal
waste.

4. Case Examples and Sectoral Applications:

Linear Programming is widely applicable in agriculture, industry, and public planning. In

agriculture, it helps farmers determine how much land, fertilizer, and labor to allocate to different
crops. In manufacturing, it helps firms plan machine use and workforce schedules to meet
production targets efficiently.

7
Example: The Nigerian Agricultural Development Program (ADP) could use Linear
Programming to plan the most profitable mix of crops to cultivate in different regions based on
soil type, rainfall, and labor availability.

Case Study or Empirical Illustration of Linear Programming

Production Scenario: Optimal Crop Mix for a Farm

To illustrate the application of Linear Programming (LP) in production economics, consider a

small agricultural firm—a farm that produces two main crops: maize and rice. The farmer
seeks to maximize profit by determining how many hectares of land to allocate to each crop,
given limited availability of land, labor, and capital.

This scenario reflects a typical resource allocation problem, where LP can be used to determine
the optimal combination of outputs that yields the highest possible profit within the constraints of
available resources (Taha, 2017).

Formulation of the Linear Programming Model

Decision Variables

Let:

 𝑋1= number of hectares allocated to maize

 𝑋2= number of hectares allocated to rice

Objective Function

The goal of the farmer is to maximize total profit (Z).

Assume that:

 The profit from one hectare of maize = ₦250,000

 The profit from one hectare of rice = ₦200,000

Thus, the objective function becomes:

8
 Maximize 𝑍 = 250,000𝑋1 + 200,000𝑋2

Constraints

The farmer is subject to three main constraints:

1. Land availability: The total farmland is limited to 10 hectares.

𝑋1 + 𝑋2 ≤ 10

2. Labor availability: Each hectare of maize requires 5 units of labor, while rice requires
10 units of labor, and only 60 labor units are available.

5𝑋1 + 10𝑋2 ≤ 60

3. Capital availability: The cost of cultivating one hectare of maize is ₦100,000, and rice
is ₦150,000, while the available capital is ₦900,000.

100,000𝑋1 + 150,000𝑋2 ≤ 900,000

Finally, the non-negativity condition applies:

𝑋1 , 𝑋2 ≥ 0

Complete LP Model

Maximize 𝑍 = 250,000𝑋1 + 200,000𝑋2

Subject to:

𝑋1 + 𝑋2 ≤ 10
5𝑋1 + 10𝑋2 ≤ 60

9
 100,000𝑋1 + 150,000𝑋2 ≤ 900,000
𝑋1 , 𝑋2 ≥ 0

Conceptual Solution and Interpretation

This model can be solved graphically or using the simplex method, but even without numerical
computation, it can be conceptually interpreted.

1. Feasible Region:
The feasible region consists of all non-negative combinations of maize and rice that
satisfy land, labor, and capital constraints.

2. Binding Constraints:
The optimal solution will lie at a corner (vertex) of the feasible region—usually where
two constraints intersect.

3. Economic Interpretation:

o If the farmer produces only maize, the maximum land and capital can allow
production up to the limits of resources, but it may underutilize some labor.

o If the farmer produces only rice, the labor constraint (10 units per hectare)
becomes binding, limiting expansion.

o The best solution is typically a combination of both crops, where resources are
fully and efficiently utilized.

Assuming the model is solved (by graphical method or simplex computation), the result might
show an optimal allocation such as:

𝑋1 = 6 hectares of maize, 𝑋2 = 4 hectares of rice

Substituting into the objective function:

𝑍 = 250,000(6) + 200,000(4) = 1,500,000 + 800,000 = ₦2,300,000

10
Hence, the maximum total profit is ₦2,300,000, achieved by cultivating 6 hectares of maize
and 4 hectares of rice.

Interpretation in Production Economics

This empirical illustration demonstrates the power of Linear Programming in production

decision-making. The model helps the farmer:

 Allocate scarce resources efficiently among alternative uses,

 Identify which constraints are most restrictive (in this case, possibly labor or capital),

 Evaluate the marginal value of resources—how much an additional hectare or labor hour
would increase total profit.

In practical production settings, LP models help firms decide what products to produce, in what
quantities, and with what combination of inputs to achieve the best economic outcomes (Hillier
& Lieberman, 2021).

For example, manufacturing firms use LP to schedule production lines, minimize waste, and
optimize machine time, while agricultural enterprises use it for land-use planning, fertilizer
allocation, and crop rotation (Snyder & Shen, 2019).

Overall, the case study illustrates that LP provides a systematic and quantitative framework for
production optimization, enabling firms to make rational, data-driven decisions in resource-
constrained environments.

Challenges and Limitations of Linear Programming in Production Economics

11
In production economics, Linear Programming (LP) has emerged as a powerful quantitative
tool used to optimize the allocation of scarce resources such as labor, capital, and raw materials.
The primary objective of LP is to achieve the most efficient outcome—typically cost
minimization or profit maximization—subject to given constraints. Its applications span various
production sectors including manufacturing, agriculture, energy, and transportation.

However, while LP offers a systematic and mathematical approach to decision-making, its use in
real-world production environments is often constrained by several limitations. These challenges
arise from the assumptions underlying LP, the complexities of real-world production processes,
computational difficulties, and data-related issues. Understanding these limitations is essential
for economists and managers to ensure that LP is applied appropriately and its results are
interpreted realistically.

Practical Constraints in Applying LP

Linearity vs. Real-World Production Relationships

A fundamental assumption of Linear Programming is that relationships between inputs and

outputs are linear—meaning that a proportional increase in inputs leads to a proportional
increase in outputs. In practice, however, production systems are rarely linear. Most real-world
production processes exhibit non-linear relationships due to factors such as the law of
diminishing marginal returns, increasing or decreasing returns to scale, and technological
indivisibilities.

For example, in a manufacturing firm, doubling the labor and raw material inputs may not
necessarily double production output due to machine capacity limits, bottlenecks, or
inefficiencies. Similarly, in agriculture, crop yields do not always increase proportionally with
fertilizer or land usage because of ecological constraints and diminishing productivity.

In such cases, LP models may provide mathematically optimal solutions that are economically
unrealistic. Non-linear programming (NLP) techniques or quadratic programming are often more
appropriate when marginal returns vary with scale.

Certainty and Data Accuracy

12
Another critical limitation of LP in production economics is the assumption of certainty in all
coefficients and parameters. LP assumes that the values of costs, resource availability, demand,
and production coefficients are known with precision and remain constant over time. In reality,
these parameters are subject to uncertainty due to fluctuating market conditions, changes in
input prices, exchange rates, or technological disruptions.

This challenge is particularly significant in developing economies such as Nigeria, where reliable
production and cost data are often scarce or outdated. Poor data collection and record-keeping
can distort model outputs, leading to misleading conclusions and inefficient policy or managerial
decisions.

For instance, an agricultural planning model designed to optimize land use under uncertain
rainfall patterns may generate infeasible recommendations if rainfall and yield data are
inaccurate. As the saying goes, “garbage in, garbage out”—if the input data is flawed, the
resulting LP solution will be unreliable.

To address this, some researchers recommend the use of stochastic programming or robust
optimization, which explicitly account for uncertainty in parameters.

Divisibility of Decision Variables

LP models assume that all decision variables are divisible, meaning they can take any fractional
value. However, in many production systems, resources and activities are indivisible. For
instance, it is impossible to employ 4.5 workers or purchase half a machine.

This issue makes LP unsuitable for decisions that require discrete choices. The use of integer
linear programming (ILP) or mixed-integer linear programming (MILP) models becomes
necessary to handle such cases. Although these models provide more realistic results, they are
more computationally demanding and complex to formulate.

Limited Data and Institutional Constraints

LP relies heavily on the availability of quantitative data regarding input coefficients,

constraints, and production technologies. However, in many production systems—especially
small-scale agricultural or informal manufacturing sectors—data is often incomplete or

13
unavailable. The absence of adequate information limits the ability of analysts to define realistic
constraints and objective functions.

Moreover, institutional constraints such as poor infrastructure, inadequate record-keeping, and

limited access to modern computing tools further hinder the practical application of LP in
production economics.

Computational and Model Formulation Issues

Complexity of Model Formulation

Formulating an LP model requires precise definition of decision variables, objective functions,

and constraints. In production systems involving multiple products, production stages, or
interdependent processes, the model can become extremely complex. Errors in defining
constraints or ignoring interrelationships among variables can lead to infeasible or misleading
results.

For instance, in a multi-plant production system, an LP model must consider transportation costs,
inventory levels, and regional demand differences. Oversimplifying these factors to fit a linear
model may distort the optimal solution.

Computational Limitations

Although modern computer algorithms like the Simplex Method and Interior-Point Method
have significantly improved LP’s computational efficiency, large-scale industrial problems
involving thousands of variables can still be computationally expensive. In production planning
where time-sensitive decisions are required, solving complex LP models can be impractical.

Furthermore, numerical instability or degeneracy may occur when there are redundant
constraints or when the model has multiple optimal solutions. These computational issues can
make the interpretation of LP results challenging, especially for policymakers and practitioners
without technical training.

14
Static Nature of LP Models

LP is a static optimization tool—it analyzes production at a single point in time. However,

production systems are inherently dynamic, evolving with technological changes, input prices,
and market demand. For instance, equipment may depreciate, labor productivity may improve,
and production capacity may expand over time.

To address this, Dynamic Programming (DP) or Multi-Period Linear Programming (MPLP)

models are often used to incorporate time-dependent variables. However, these extensions
increase model complexity and computational burden, which limits their widespread use in
developing regions.

Theoretical Assumptions that Restrict Real-World Application

LP is based on several simplifying assumptions that rarely hold true in production economics:

1. Linearity Assumption:
Both the objective function and constraints are assumed to be linear, implying constant
marginal productivity and no economies or diseconomies of scale. Real production
processes are often non-linear due to technological interdependencies, input substitution,
and capacity limits.

2. Certainty Assumption:
All coefficients in the objective and constraints are assumed to be known and constant. In
reality, prices, input availability, and demand fluctuate.

3. Divisibility Assumption:
LP assumes continuous variables, but many resources—such as workers, machines, or
land plots are discrete and cannot be divided.

4. Additivity Assumption:
The total output or cost is assumed to be the sum of individual contributions. In practice,
inputs often interact, creating joint effects that violate this assumption.

15
 5. Single Objective Optimization:
LP typically optimizes a single criterion, such as profit maximization or cost
minimization. However, production economics often involves multiple objectives,
including sustainability, employment generation, and social welfare.

6. Perfect Information:
LP presumes that all relevant information is available to decision-makers, an assumption
rarely satisfied in real production environments.

These assumptions simplify mathematical modeling but significantly reduce the realism and
generalizability of LP results in practical applications.

Implications for Production Decision-Making

Despite its limitations, LP remains a valuable analytical framework in production economics.

However, its results must be interpreted as guidelines rather than absolute solutions.

For example, in a manufacturing firm, LP can help identify the most efficient allocation of
resources given known constraints. Yet, the manager must still rely on judgment and experience
to adjust for uncertainty, market volatility, or human factors not captured in the model.

Similarly, in agricultural production, LP models may optimize crop allocation under land and
labor constraints, but unpredictable weather patterns or pest infestations can render the “optimal”
solution impractical.

Therefore, LP should be complemented with sensitivity analysis, simulation models, and

expert judgment to ensure robustness in decision-making.

Extensions and Alternative Approaches

To overcome the shortcomings of LP, several extensions have been developed:

 Nonlinear Programming (NLP): Handles non-linear relationships between variables.

 Integer and Mixed-Integer Programming (MIP): Accounts for indivisible resources.

16
  Stochastic Programming: Incorporates uncertainty by modeling random variables.

 Robust Optimization: Seeks solutions that remain feasible under a range of

uncertainties.

 Goal Programming: Allows for the optimization of multiple objectives simultaneously.

 Dynamic Programming: Considers time-dependent decisions in multi-period models.

These techniques enhance the applicability of LP in complex and uncertain production

environments, making them more reflective of economic realities.

Policy Implications and Recommendations

1. Guidance for Production and Resource Management:

Linear Programming (LP) offers a structured approach for producers to make rational and data-
driven decisions. It helps minimize waste, cut down production costs, and increase profitability
by ensuring that limited resources are used in the most efficient way possible.
Example: A Nigerian manufacturing company like Dangote Cement can apply Linear
Programming to determine the most efficient mix of raw materials (limestone, clay, and gypsum)
to minimize cost while maintaining quality output.

2. Implications for Producers and Policymakers in Nigeria:

Linear Programming can guide Nigerian producers in optimizing scarce resources such as labor,
land, and capital, especially in agriculture and small-scale industries. Policymakers can also
adopt Linear Programming models for national budgeting, transportation scheduling, and
agricultural production planning to ensure equitable and efficient resource use.
Example: The Nigerian Ministry of Agriculture could use Linear Programming to determine the
best allocation of fertilizer and seeds across states to maximize national food output.

3. Future Trends and Innovations

Modern technologies such as Artificial Intelligence (AI), optimization software (e.g., LINGO,
Excel Solver, MATLAB), and big data analytics are enhancing the Linear Programming’s speed,
precision, and accessibility. These tools enable real-time decision-making and can revolutionize

17
efficiency in Nigeria’s industrial, agricultural, and public sectors.
Example: Nigerian Breweries could integrate Linear Programming with AI-based forecasting
tools to optimize production schedules based on demand trends and raw material availability.

Conclusion

This paper has examined the concept, evolution, and application of Linear Programming in
production economics. It established that LP provides a structured approach to decision-making
by optimizing an objective function—such as profit maximization or cost minimization—within
given constraints. Historical developments, from Dantzig’s Simplex method to modern
computational models, have enhanced LP’s relevance across various sectors. Through examples
and theoretical discussion, it is evident that LP is a cornerstone in quantitative economic analysis
and production management.
Linear programming contributes significantly to enhancing production efficiency by enabling
firms to make data-driven decisions about resource utilization. It allows producers to determine
the most cost-effective combination of inputs while achieving the desired level of output.
Additionally, LP supports the optimal allocation of scarce resources, reduces wastage, and
improves productivity by ensuring that every decision aligns with an overarching objective
(Taha, 2017; Varian, 2019). Beyond individual firms, LP models are also applied in national
planning, logistics, transportation, and agricultural optimization, demonstrating their wide-
ranging impact on economic systems.
In conclusion, Linear Programming remains a crucial analytical and operational tool in
production economics. Its systematic and mathematical approach bridges the gap between
theoretical economics and practical production management. Although real-world conditions
sometimes involve uncertainties and nonlinearities that challenge LP assumptions, ongoing
advancements in computational techniques and model extensions (such as Integer and Nonlinear
Programming) continue to enhance its applicability. Therefore, understanding and applying LP is
essential for economists, managers, and policymakers striving for efficiency, sustainability, and
economic growth in today’s competitive global economy.

18
References

Ahuja, R. K., & Orlin, J. B. (2018). Network flows: Theory, algorithms, and applications.
Prentice Hall.

Chiang, A. C., & Wainwright, K. (2005). Fundamental methods of mathematical economics (4th
ed.). McGraw-Hill Education.

Dantzig, G. B. (1963). Linear programming and extensions. Princeton University Press.

Hillier, F. S., & Lieberman, G. J. (2021). Introduction to operations research (11th ed.).
McGraw-Hill Education.

Idisi, B. E., & Ogumeyo, S. A. (2024). A linear programming approach to optimizing

environmental resource management in urban areas. FUDMA Journal of Sciences (FJS), 8(6),
277–284.

19
Optimal agricultural resource allocation using linear programming: A case study of rice
production in Nigeria. (2018). Journal of Economics and Sustainable Development, 9(16), 94–
104.

Osagie, G. N., & Icheme, M. O. (2018). Optimization of resources with the aid of linear
programming model in Steve Shoe Production Centre, Enugu, Nigeria. International Journal of
Research – Granthaalayah, 6(9), 123–136. https://doi.org/10.5281/zenodo.1436782

Render, B., Stair, R. M., Hanna, M. E., & Hale, T. S. (2018). Quantitative analysis for
management (13th ed.). Pearson Education.

Snyder, L. V., & Shen, Z. J. M. (2019). Fundamentals of supply chain theory (2nd ed.). Wiley.

Taha, H. A. (2017). Operations research: An introduction (10th ed.). Pearson Education Limited.

Varian, H. R. (2019). Intermediate microeconomics: A modern approach (10th ed.). W. W.

Norton & Company.

20