A note on programming problems with linear-plus-linear-fractional objective functions

Article Abstract:

The deficiencies of S.S. Chadha's dual of a maximation problem for the sum of a linear and linear fractional function under linear constraints are discussed. Chadha's method depends on the concepts of A.G. Teterev on linear and piecewise-linear programming which have already been found defective. The variable x1 is not the global maximizer of F(x) on S whereas for x3 and x2, the optimal criterion is not satisfied. Moreover, F(x2) and F(x3) are greater than G assigned to x1 contrary to the weak duality.

Duality theory (Mathematics)

---

Multiparametric sensitivity analysis in programming problem with linear-plus-linear fractional objective function

Article Abstract:

A multiparametric sensitivity analysis is presented for the linear-plus-linear fractional programming problem (LLFP) with a tolerance approach and parametric analysis. The results are also presented with examples.

Technology application, Mathematical optimization, Optimization theory

---

The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price

Article Abstract:

A study attempts to solve problems related to mixed integer linear programming using a valid shadow price. The method can help in making effective resource acquisition plans.

Integer programming

Similar abstracts:

• Abstracts: Some constrained partitioning problems and majorization. Additive rules in discrete allocation problems. k-Sided permutation games and multiprices of equilibrium
• Abstracts: On the complexity of minimax regret linear programing. Analyzing linear systems containing strict inequalities via evenly convex hulls

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.