English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, an alternative method for Wolfe’s modified simplex method is introduced. This method is easy to solve quadratic programming problem (QPP) concern with non-linear programming problem (NLPP). In linear programming models, the characteristic assumption is the linearity of the objective function and constraints. Although this assumption holds in numerous practical situations, yet we come across many situations where the objective function and some or all of the constraints are nonlinear functions. The non-linearity of the functions makes the solution of the problem much more involved as compared to LPPs and there is no single algorithm like the simplex method, which can be employed to solve efficiently all NPPs.

NEW APPROACH FOR WOLFE’S MODIFIED SIMPLEX METHOD TO SOLVE QUADRATIC PROGRAMMING PROBLEMS